./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1052c.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1052c.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dfa840d25aa8e4c2571f9c229001b7ecc827955ca79f4052c712316342cac738 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:03:19,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:03:19,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:03:19,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:03:19,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:03:19,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:03:19,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:03:19,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:03:19,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:03:19,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:03:19,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:03:19,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:03:19,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:03:19,537 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:03:19,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:03:19,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:03:19,541 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:03:19,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:03:19,543 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:03:19,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:03:19,545 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:03:19,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:03:19,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:03:19,548 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:03:19,549 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:03:19,551 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:03:19,551 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:03:19,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:03:19,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:03:19,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:03:19,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:03:19,554 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:03:19,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:03:19,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:03:19,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:03:19,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:03:19,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:03:19,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:03:19,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:03:19,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:03:19,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:03:19,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:03:19,565 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:03:19,589 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:03:19,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:03:19,590 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:03:19,590 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:03:19,591 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:03:19,591 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:03:19,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:03:19,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:03:19,592 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:03:19,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:03:19,593 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:03:19,594 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:03:19,594 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:03:19,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:03:19,594 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:03:19,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:03:19,594 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:03:19,595 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:03:19,595 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:03:19,596 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:03:19,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:03:19,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:03:19,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:03:19,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:03:19,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:03:19,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:03:19,598 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:03:19,598 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:03:19,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:03:19,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:03:19,599 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:03:19,599 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:03:19,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:03:19,599 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> dfa840d25aa8e4c2571f9c229001b7ecc827955ca79f4052c712316342cac738 [2022-07-12 03:03:19,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:03:19,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:03:19,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:03:19,845 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:03:19,846 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:03:19,847 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1052c.c [2022-07-12 03:03:19,905 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b5eb2c51/a42fba5656944e7eaee0cc13cb3b2335/FLAG495abf07b [2022-07-12 03:03:20,263 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:03:20,264 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1052c.c [2022-07-12 03:03:20,275 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b5eb2c51/a42fba5656944e7eaee0cc13cb3b2335/FLAG495abf07b [2022-07-12 03:03:20,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b5eb2c51/a42fba5656944e7eaee0cc13cb3b2335 [2022-07-12 03:03:20,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:03:20,288 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:03:20,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:03:20,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:03:20,291 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:03:20,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:03:20" (1/1) ... [2022-07-12 03:03:20,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49fcc6ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:20, skipping insertion in model container [2022-07-12 03:03:20,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:03:20" (1/1) ... [2022-07-12 03:03:20,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:03:20,315 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:03:20,523 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1052c.c[2271,2284] [2022-07-12 03:03:20,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:03:20,533 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:03:20,556 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1052c.c[2271,2284] [2022-07-12 03:03:20,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:03:20,569 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:03:20,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:20 WrapperNode [2022-07-12 03:03:20,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:03:20,572 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:03:20,572 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:03:20,572 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:03:20,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:20" (1/1) ... [2022-07-12 03:03:20,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:20" (1/1) ... [2022-07-12 03:03:20,621 INFO L137 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2022-07-12 03:03:20,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:03:20,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:03:20,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:03:20,623 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:03:20,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:20" (1/1) ... [2022-07-12 03:03:20,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:20" (1/1) ... [2022-07-12 03:03:20,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:20" (1/1) ... [2022-07-12 03:03:20,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:20" (1/1) ... [2022-07-12 03:03:20,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:20" (1/1) ... [2022-07-12 03:03:20,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:20" (1/1) ... [2022-07-12 03:03:20,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:20" (1/1) ... [2022-07-12 03:03:20,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:03:20,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:03:20,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:03:20,653 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:03:20,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:20" (1/1) ... [2022-07-12 03:03:20,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:03:20,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:03:20,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 03:03:20,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 03:03:20,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:03:20,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:03:20,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:03:20,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-12 03:03:20,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:03:20,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-12 03:03:20,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:03:20,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:03:20,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:03:20,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:03:20,787 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:03:20,789 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:03:21,025 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:03:21,030 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:03:21,043 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-12 03:03:21,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:03:21 BoogieIcfgContainer [2022-07-12 03:03:21,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:03:21,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:03:21,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:03:21,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:03:21,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:03:20" (1/3) ... [2022-07-12 03:03:21,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc2ca3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:03:21, skipping insertion in model container [2022-07-12 03:03:21,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:20" (2/3) ... [2022-07-12 03:03:21,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc2ca3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:03:21, skipping insertion in model container [2022-07-12 03:03:21,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:03:21" (3/3) ... [2022-07-12 03:03:21,053 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1052c.c [2022-07-12 03:03:21,076 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:03:21,077 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:03:21,141 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:03:21,166 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5bad95c1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5e38536c [2022-07-12 03:03:21,166 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:03:21,170 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:21,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 03:03:21,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:21,177 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:21,177 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:21,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:21,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1930029915, now seen corresponding path program 1 times [2022-07-12 03:03:21,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:03:21,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49280706] [2022-07-12 03:03:21,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:21,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:03:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:21,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:03:21,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:03:21,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49280706] [2022-07-12 03:03:21,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49280706] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:21,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:21,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:03:21,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659799553] [2022-07-12 03:03:21,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:21,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:03:21,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:03:21,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:03:21,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:03:21,418 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:21,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:21,439 INFO L93 Difference]: Finished difference Result 74 states and 118 transitions. [2022-07-12 03:03:21,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:03:21,441 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 03:03:21,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:21,455 INFO L225 Difference]: With dead ends: 74 [2022-07-12 03:03:21,455 INFO L226 Difference]: Without dead ends: 35 [2022-07-12 03:03:21,458 INFO L412 NwaCegarLoop]: 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 [2022-07-12 03:03:21,461 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:03:21,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:03:21,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-12 03:03:21,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-12 03:03:21,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 34 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:21,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2022-07-12 03:03:21,490 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 11 [2022-07-12 03:03:21,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:21,490 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2022-07-12 03:03:21,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:21,491 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2022-07-12 03:03:21,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 03:03:21,492 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:21,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:21,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:03:21,493 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:21,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:21,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1310108990, now seen corresponding path program 1 times [2022-07-12 03:03:21,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:03:21,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009659143] [2022-07-12 03:03:21,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:21,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:03:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:03:21,659 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 03:03:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:03:21,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 03:03:21,727 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 03:03:21,728 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:03:21,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:03:21,735 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-07-12 03:03:21,738 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:03:21,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:03:21 BoogieIcfgContainer [2022-07-12 03:03:21,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:03:21,761 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:03:21,761 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:03:21,761 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:03:21,762 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:03:21" (3/4) ... [2022-07-12 03:03:21,764 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 03:03:21,764 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:03:21,765 INFO L158 Benchmark]: Toolchain (without parser) took 1476.93ms. Allocated memory was 119.5MB in the beginning and 161.5MB in the end (delta: 41.9MB). Free memory was 84.6MB in the beginning and 112.6MB in the end (delta: -28.0MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2022-07-12 03:03:21,765 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 83.9MB. Free memory was 38.0MB in the beginning and 38.0MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:03:21,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.04ms. Allocated memory is still 119.5MB. Free memory was 84.4MB in the beginning and 92.5MB in the end (delta: -8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 03:03:21,766 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.16ms. Allocated memory is still 119.5MB. Free memory was 92.5MB in the beginning and 90.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:03:21,766 INFO L158 Benchmark]: Boogie Preprocessor took 29.55ms. Allocated memory is still 119.5MB. Free memory was 90.0MB in the beginning and 88.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:03:21,767 INFO L158 Benchmark]: RCFGBuilder took 393.01ms. Allocated memory is still 119.5MB. Free memory was 88.0MB in the beginning and 70.5MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-12 03:03:21,767 INFO L158 Benchmark]: TraceAbstraction took 713.07ms. Allocated memory was 119.5MB in the beginning and 161.5MB in the end (delta: 41.9MB). Free memory was 69.8MB in the beginning and 113.1MB in the end (delta: -43.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:03:21,767 INFO L158 Benchmark]: Witness Printer took 3.12ms. Allocated memory is still 161.5MB. Free memory was 113.1MB in the beginning and 112.6MB in the end (delta: 512.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:03:21,769 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 83.9MB. Free memory was 38.0MB in the beginning and 38.0MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.04ms. Allocated memory is still 119.5MB. Free memory was 84.4MB in the beginning and 92.5MB in the end (delta: -8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.16ms. Allocated memory is still 119.5MB. Free memory was 92.5MB in the beginning and 90.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.55ms. Allocated memory is still 119.5MB. Free memory was 90.0MB in the beginning and 88.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 393.01ms. Allocated memory is still 119.5MB. Free memory was 88.0MB in the beginning and 70.5MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 713.07ms. Allocated memory was 119.5MB in the beginning and 161.5MB in the end (delta: 41.9MB). Free memory was 69.8MB in the beginning and 113.1MB in the end (delta: -43.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.12ms. Allocated memory is still 161.5MB. Free memory was 113.1MB in the beginning and 112.6MB in the end (delta: 512.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 105]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of shiftRight at line 39, overapproximation of bitwiseOr at line 40, overapproximation of someUnaryDOUBLEoperation at line 100, overapproximation of bitwiseAnd at line 40, overapproximation of someBinaryDOUBLEComparisonOperation at line 104. Possible FailurePath: [L16] static const double huge_floor = 1.0e300; VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L100] double x = -0.0; [L101] CALL, EXPR floor_double(x) [L19] __int32_t i0, i1, j0; [L20] __uint32_t i, j; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] [L22] ieee_double_shape_type ew_u; [L23] ew_u.value = (x) [L24] EXPR ew_u.parts.msw [L24] (i0) = ew_u.parts.msw [L25] EXPR ew_u.parts.lsw [L25] (i1) = ew_u.parts.lsw [L27] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-1048576, i1=0, j0=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] [L28] COND TRUE j0 < 20 VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-1048576, i1=0, j0=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] [L29] COND FALSE !(j0 < 0) [L39] i = (0x000fffff) >> j0 VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i=1, i0=-1048576, i1=0, j0=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] [L40] COND TRUE ((i0 & i) | i1) == 0 [L41] return x; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, \result=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i=1, i0=-1048576, i1=0, j0=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] [L101] RET, EXPR floor_double(x) [L101] double res = floor_double(x); [L104] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, res == -0.0 && __signbit_double(res) == 1=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] [L104] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L105] reach_error() VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 53 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, 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=38occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-12 03:03:21,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1052c.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dfa840d25aa8e4c2571f9c229001b7ecc827955ca79f4052c712316342cac738 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:03:23,998 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:03:24,000 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:03:24,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:03:24,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:03:24,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:03:24,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:03:24,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:03:24,049 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:03:24,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:03:24,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:03:24,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:03:24,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:03:24,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:03:24,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:03:24,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:03:24,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:03:24,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:03:24,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:03:24,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:03:24,076 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:03:24,077 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:03:24,080 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:03:24,081 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:03:24,082 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:03:24,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:03:24,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:03:24,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:03:24,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:03:24,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:03:24,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:03:24,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:03:24,094 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:03:24,095 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:03:24,096 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:03:24,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:03:24,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:03:24,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:03:24,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:03:24,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:03:24,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:03:24,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:03:24,107 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 03:03:24,140 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:03:24,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:03:24,141 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:03:24,141 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:03:24,142 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:03:24,142 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:03:24,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:03:24,143 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:03:24,143 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:03:24,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:03:24,144 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:03:24,144 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:03:24,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:03:24,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:03:24,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:03:24,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:03:24,145 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 03:03:24,145 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 03:03:24,146 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 03:03:24,146 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:03:24,146 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:03:24,146 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:03:24,146 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:03:24,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:03:24,146 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:03:24,147 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:03:24,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:03:24,147 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:03:24,147 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:03:24,147 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:03:24,147 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 03:03:24,148 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 03:03:24,148 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:03:24,148 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:03:24,148 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:03:24,148 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 03:03:24,148 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> dfa840d25aa8e4c2571f9c229001b7ecc827955ca79f4052c712316342cac738 [2022-07-12 03:03:24,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:03:24,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:03:24,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:03:24,480 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:03:24,481 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:03:24,483 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1052c.c [2022-07-12 03:03:24,537 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b50dc7914/b4c2473b825044bcaabe665bc1a09e95/FLAG72ae8b204 [2022-07-12 03:03:25,021 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:03:25,022 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1052c.c [2022-07-12 03:03:25,027 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b50dc7914/b4c2473b825044bcaabe665bc1a09e95/FLAG72ae8b204 [2022-07-12 03:03:25,533 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b50dc7914/b4c2473b825044bcaabe665bc1a09e95 [2022-07-12 03:03:25,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:03:25,543 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:03:25,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:03:25,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:03:25,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:03:25,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:03:25" (1/1) ... [2022-07-12 03:03:25,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f18ba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:25, skipping insertion in model container [2022-07-12 03:03:25,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:03:25" (1/1) ... [2022-07-12 03:03:25,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:03:25,577 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:03:25,727 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1052c.c[2271,2284] [2022-07-12 03:03:25,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:03:25,743 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:03:25,762 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1052c.c[2271,2284] [2022-07-12 03:03:25,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:03:25,777 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:03:25,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:25 WrapperNode [2022-07-12 03:03:25,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:03:25,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:03:25,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:03:25,779 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:03:25,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:25" (1/1) ... [2022-07-12 03:03:25,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:25" (1/1) ... [2022-07-12 03:03:25,812 INFO L137 Inliner]: procedures = 19, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2022-07-12 03:03:25,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:03:25,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:03:25,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:03:25,814 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:03:25,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:25" (1/1) ... [2022-07-12 03:03:25,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:25" (1/1) ... [2022-07-12 03:03:25,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:25" (1/1) ... [2022-07-12 03:03:25,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:25" (1/1) ... [2022-07-12 03:03:25,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:25" (1/1) ... [2022-07-12 03:03:25,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:25" (1/1) ... [2022-07-12 03:03:25,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:25" (1/1) ... [2022-07-12 03:03:25,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:03:25,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:03:25,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:03:25,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:03:25,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:25" (1/1) ... [2022-07-12 03:03:25,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:03:25,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:03:25,925 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 03:03:25,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 03:03:25,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:03:25,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-07-12 03:03:25,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-12 03:03:25,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 03:03:25,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:03:25,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 03:03:25,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:03:25,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:03:25,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 03:03:25,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:03:26,031 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:03:26,032 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:03:26,902 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:03:26,906 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:03:26,906 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-12 03:03:26,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:03:26 BoogieIcfgContainer [2022-07-12 03:03:26,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:03:26,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:03:26,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:03:26,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:03:26,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:03:25" (1/3) ... [2022-07-12 03:03:26,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526f8366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:03:26, skipping insertion in model container [2022-07-12 03:03:26,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:03:25" (2/3) ... [2022-07-12 03:03:26,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526f8366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:03:26, skipping insertion in model container [2022-07-12 03:03:26,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:03:26" (3/3) ... [2022-07-12 03:03:26,912 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1052c.c [2022-07-12 03:03:26,923 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:03:26,923 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:03:26,954 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:03:26,958 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5e40c7d9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@19f17026 [2022-07-12 03:03:26,959 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:03:26,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:26,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 03:03:26,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:26,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:26,968 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:26,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:26,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1930029915, now seen corresponding path program 1 times [2022-07-12 03:03:26,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:03:26,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045666218] [2022-07-12 03:03:26,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:26,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:03:26,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:03:26,991 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:03:26,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 03:03:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:27,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 03:03:27,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:03:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:03:27,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:03:27,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:03:27,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045666218] [2022-07-12 03:03:27,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045666218] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:27,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:27,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:03:27,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972779061] [2022-07-12 03:03:27,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:27,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:03:27,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:03:27,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:03:27,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:03:27,107 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:27,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:27,125 INFO L93 Difference]: Finished difference Result 74 states and 118 transitions. [2022-07-12 03:03:27,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:03:27,128 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 03:03:27,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:27,133 INFO L225 Difference]: With dead ends: 74 [2022-07-12 03:03:27,134 INFO L226 Difference]: Without dead ends: 35 [2022-07-12 03:03:27,136 INFO L412 NwaCegarLoop]: 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 [2022-07-12 03:03:27,140 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:03:27,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:03:27,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-12 03:03:27,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-12 03:03:27,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 34 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:27,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2022-07-12 03:03:27,175 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 11 [2022-07-12 03:03:27,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:27,175 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2022-07-12 03:03:27,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:27,175 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2022-07-12 03:03:27,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 03:03:27,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:27,176 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:27,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:03:27,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:03:27,388 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:27,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:27,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1310108990, now seen corresponding path program 1 times [2022-07-12 03:03:27,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:03:27,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929706820] [2022-07-12 03:03:27,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:27,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:03:27,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:03:27,400 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:03:27,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 03:03:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:27,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:03:27,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:03:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:03:27,625 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:03:27,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:03:27,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929706820] [2022-07-12 03:03:27,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929706820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:27,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:27,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:03:27,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413898299] [2022-07-12 03:03:27,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:27,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:03:27,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:03:27,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:03:27,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:03:27,628 INFO L87 Difference]: Start difference. First operand 35 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:28,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:28,425 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-07-12 03:03:28,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:03:28,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 03:03:28,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:28,428 INFO L225 Difference]: With dead ends: 47 [2022-07-12 03:03:28,428 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 03:03:28,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:03:28,429 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 03:03:28,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 119 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 22 Unchecked, 0.8s Time] [2022-07-12 03:03:28,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 03:03:28,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-12 03:03:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:28,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2022-07-12 03:03:28,433 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 12 [2022-07-12 03:03:28,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:28,433 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-07-12 03:03:28,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:28,434 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-07-12 03:03:28,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 03:03:28,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:28,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:28,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 03:03:28,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:03:28,648 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:28,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:28,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1803079892, now seen corresponding path program 1 times [2022-07-12 03:03:28,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:03:28,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4841210] [2022-07-12 03:03:28,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:28,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:03:28,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:03:28,653 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:03:28,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 03:03:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:28,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:03:28,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:03:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:03:28,750 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:03:28,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:03:28,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4841210] [2022-07-12 03:03:28,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4841210] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:28,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:28,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:03:28,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032358055] [2022-07-12 03:03:28,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:28,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:03:28,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:03:28,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:03:28,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:03:28,753 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:29,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:29,081 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-07-12 03:03:29,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:03:29,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 03:03:29,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:29,082 INFO L225 Difference]: With dead ends: 43 [2022-07-12 03:03:29,082 INFO L226 Difference]: Without dead ends: 22 [2022-07-12 03:03:29,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:03:29,083 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:03:29,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 11 Unchecked, 0.3s Time] [2022-07-12 03:03:29,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-12 03:03:29,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-12 03:03:29,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-07-12 03:03:29,086 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 12 [2022-07-12 03:03:29,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:29,087 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-07-12 03:03:29,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:29,088 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-07-12 03:03:29,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 03:03:29,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:29,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:29,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 03:03:29,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:03:29,302 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:29,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:29,303 INFO L85 PathProgramCache]: Analyzing trace with hash -649381144, now seen corresponding path program 1 times [2022-07-12 03:03:29,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:03:29,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740491465] [2022-07-12 03:03:29,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:29,304 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:03:29,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:03:29,309 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:03:29,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 03:03:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:29,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 03:03:29,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:03:29,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:03:29,545 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:03:29,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:03:29,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740491465] [2022-07-12 03:03:29,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740491465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:29,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:29,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:03:29,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577895090] [2022-07-12 03:03:29,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:29,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:03:29,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:03:29,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:03:29,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:03:29,548 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:29,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:29,624 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-07-12 03:03:29,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:03:29,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-12 03:03:29,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:29,627 INFO L225 Difference]: With dead ends: 34 [2022-07-12 03:03:29,627 INFO L226 Difference]: Without dead ends: 22 [2022-07-12 03:03:29,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:03:29,628 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:03:29,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:03:29,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-12 03:03:29,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-12 03:03:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-07-12 03:03:29,632 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2022-07-12 03:03:29,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:29,632 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-07-12 03:03:29,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:29,632 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-07-12 03:03:29,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 03:03:29,633 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:29,633 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:29,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 03:03:29,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:03:29,844 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:29,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:29,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1381924140, now seen corresponding path program 1 times [2022-07-12 03:03:29,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:03:29,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184797190] [2022-07-12 03:03:29,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:29,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:03:29,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:03:29,847 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:03:29,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 03:03:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:29,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 03:03:29,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:03:30,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:03:30,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:03:30,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:03:30,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184797190] [2022-07-12 03:03:30,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184797190] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:30,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:30,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:03:30,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566236063] [2022-07-12 03:03:30,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:30,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:03:30,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:03:30,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:03:30,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:03:30,018 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:30,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:30,052 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-07-12 03:03:30,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:03:30,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 03:03:30,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:30,054 INFO L225 Difference]: With dead ends: 34 [2022-07-12 03:03:30,054 INFO L226 Difference]: Without dead ends: 22 [2022-07-12 03:03:30,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:03:30,057 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:03:30,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 47 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 7 Unchecked, 0.0s Time] [2022-07-12 03:03:30,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-12 03:03:30,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-12 03:03:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-07-12 03:03:30,066 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 16 [2022-07-12 03:03:30,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:30,067 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-07-12 03:03:30,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:30,069 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-07-12 03:03:30,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 03:03:30,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:30,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:30,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 03:03:30,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:03:30,293 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:30,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:30,294 INFO L85 PathProgramCache]: Analyzing trace with hash 461150674, now seen corresponding path program 1 times [2022-07-12 03:03:30,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:03:30,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181234574] [2022-07-12 03:03:30,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:30,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:03:30,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:03:30,296 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:03:30,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 03:03:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:30,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 03:03:30,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:03:30,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:03:30,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:03:30,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:03:30,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181234574] [2022-07-12 03:03:30,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181234574] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:30,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:30,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:03:30,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782320244] [2022-07-12 03:03:30,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:30,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:03:30,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:03:30,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:03:30,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:03:30,544 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:30,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:30,576 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-07-12 03:03:30,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:03:30,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-12 03:03:30,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:30,578 INFO L225 Difference]: With dead ends: 34 [2022-07-12 03:03:30,578 INFO L226 Difference]: Without dead ends: 22 [2022-07-12 03:03:30,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:03:30,579 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:03:30,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-07-12 03:03:30,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-12 03:03:30,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-12 03:03:30,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:30,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-07-12 03:03:30,582 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 17 [2022-07-12 03:03:30,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:30,582 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-07-12 03:03:30,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:30,582 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-07-12 03:03:30,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 03:03:30,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:30,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:30,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-12 03:03:30,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:03:30,794 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:30,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:30,794 INFO L85 PathProgramCache]: Analyzing trace with hash -348195952, now seen corresponding path program 1 times [2022-07-12 03:03:30,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:03:30,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182171982] [2022-07-12 03:03:30,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:30,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:03:30,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:03:30,796 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:03:30,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 03:03:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:30,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 03:03:30,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:03:30,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 15 treesize of output 16 [2022-07-12 03:03:31,097 INFO L390 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 47 treesize of output 27 [2022-07-12 03:03:31,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:03:31,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:03:31,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:03:31,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182171982] [2022-07-12 03:03:31,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182171982] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:31,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:31,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 03:03:31,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449663072] [2022-07-12 03:03:31,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:31,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:03:31,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:03:31,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:03:31,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:03:31,164 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:31,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:31,264 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2022-07-12 03:03:31,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:03:31,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-12 03:03:31,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:31,264 INFO L225 Difference]: With dead ends: 25 [2022-07-12 03:03:31,265 INFO L226 Difference]: Without dead ends: 22 [2022-07-12 03:03:31,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-12 03:03:31,265 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:03:31,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 45 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 18 Unchecked, 0.0s Time] [2022-07-12 03:03:31,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-12 03:03:31,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-12 03:03:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0) internal successors, (21), 21 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:31,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2022-07-12 03:03:31,267 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 17 [2022-07-12 03:03:31,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:31,268 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2022-07-12 03:03:31,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:31,268 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2022-07-12 03:03:31,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 03:03:31,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:03:31,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:31,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-12 03:03:31,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:03:31,476 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:03:31,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:03:31,476 INFO L85 PathProgramCache]: Analyzing trace with hash -475618843, now seen corresponding path program 1 times [2022-07-12 03:03:31,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:03:31,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922967678] [2022-07-12 03:03:31,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:03:31,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:03:31,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:03:31,479 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:03:31,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 03:03:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:03:31,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-12 03:03:31,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:03:31,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 15 treesize of output 16 [2022-07-12 03:03:31,793 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 03:03:31,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-07-12 03:03:31,986 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 03:03:31,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 29 [2022-07-12 03:03:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:03:32,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:03:32,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:03:32,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922967678] [2022-07-12 03:03:32,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922967678] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:03:32,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:03:32,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 03:03:32,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431429921] [2022-07-12 03:03:32,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:03:32,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 03:03:32,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:03:32,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 03:03:32,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-12 03:03:32,111 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:32,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:03:32,159 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2022-07-12 03:03:32,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 03:03:32,160 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-12 03:03:32,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:03:32,160 INFO L225 Difference]: With dead ends: 22 [2022-07-12 03:03:32,160 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 03:03:32,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:03:32,161 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:03:32,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 60 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 31 Unchecked, 0.0s Time] [2022-07-12 03:03:32,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 03:03:32,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 03:03:32,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:32,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 03:03:32,162 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2022-07-12 03:03:32,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:03:32,162 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 03:03:32,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:03:32,162 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 03:03:32,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 03:03:32,164 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:03:32,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-12 03:03:32,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:03:32,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 03:03:32,444 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 67) no Hoare annotation was computed. [2022-07-12 03:03:32,445 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 03:03:32,445 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 03:03:32,445 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 71) no Hoare annotation was computed. [2022-07-12 03:03:32,445 INFO L895 garLoopResultBuilder]: At program point L78(lines 18 79) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= .cse0 |ULTIMATE.start_floor_double_#res#1|) (= |ULTIMATE.start_floor_double_~x#1| .cse0) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= currentRoundingMode roundNearestTiesToEven) (exists ((|v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_18| (_ BitVec 64)) (|v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17| (_ BitVec 32))) (let ((.cse3 (select |#memory_int| |v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11|))) (let ((.cse1 (select .cse3 (_ bv4 32)))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17|) (_ bv4 32)) .cse1) (= (let ((.cse2 (concat .cse1 (select .cse3 (_ bv0 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) |ULTIMATE.start_floor_double_#res#1|) (= .cse1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_18|)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_18|)) (fp.neg (_ +zero 11 53))))))))) [2022-07-12 03:03:32,445 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 48) no Hoare annotation was computed. [2022-07-12 03:03:32,445 INFO L899 garLoopResultBuilder]: For program point L21-1(lines 21 26) no Hoare annotation was computed. [2022-07-12 03:03:32,445 INFO L895 garLoopResultBuilder]: At program point L21-2(lines 21 26) the Hoare annotation is: (and (= |ULTIMATE.start_floor_double_~x#1| (fp.neg (_ +zero 11 53))) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-12 03:03:32,445 INFO L899 garLoopResultBuilder]: For program point L21-3(lines 21 26) no Hoare annotation was computed. [2022-07-12 03:03:32,445 INFO L899 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2022-07-12 03:03:32,445 INFO L899 garLoopResultBuilder]: For program point L104-2(lines 104 107) no Hoare annotation was computed. [2022-07-12 03:03:32,445 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 37) no Hoare annotation was computed. [2022-07-12 03:03:32,445 INFO L899 garLoopResultBuilder]: For program point L105(line 105) no Hoare annotation was computed. [2022-07-12 03:03:32,445 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 77) no Hoare annotation was computed. [2022-07-12 03:03:32,446 INFO L899 garLoopResultBuilder]: For program point L72-1(lines 18 79) no Hoare annotation was computed. [2022-07-12 03:03:32,446 INFO L899 garLoopResultBuilder]: For program point L72-2(lines 72 77) no Hoare annotation was computed. [2022-07-12 03:03:32,446 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 65) no Hoare annotation was computed. [2022-07-12 03:03:32,446 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 36) no Hoare annotation was computed. [2022-07-12 03:03:32,446 INFO L899 garLoopResultBuilder]: For program point L64-2(lines 64 65) no Hoare annotation was computed. [2022-07-12 03:03:32,446 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 57) no Hoare annotation was computed. [2022-07-12 03:03:32,446 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 41) no Hoare annotation was computed. [2022-07-12 03:03:32,446 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 03:03:32,446 INFO L895 garLoopResultBuilder]: At program point L90(lines 81 91) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= .cse0 |ULTIMATE.start_floor_double_#res#1|) |ULTIMATE.start_main_#t~short10#1| (= |ULTIMATE.start_floor_double_~x#1| .cse0) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= (_ bv1 32) |ULTIMATE.start___signbit_double_#res#1|) (= currentRoundingMode roundNearestTiesToEven))) [2022-07-12 03:03:32,446 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2022-07-12 03:03:32,446 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 71) no Hoare annotation was computed. [2022-07-12 03:03:32,446 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 36) no Hoare annotation was computed. [2022-07-12 03:03:32,446 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 03:03:32,446 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 70) no Hoare annotation was computed. [2022-07-12 03:03:32,446 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 53) no Hoare annotation was computed. [2022-07-12 03:03:32,446 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 47) no Hoare annotation was computed. [2022-07-12 03:03:32,446 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 68) no Hoare annotation was computed. [2022-07-12 03:03:32,446 INFO L899 garLoopResultBuilder]: For program point L59-1(lines 59 68) no Hoare annotation was computed. [2022-07-12 03:03:32,447 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 84 88) no Hoare annotation was computed. [2022-07-12 03:03:32,447 INFO L895 garLoopResultBuilder]: At program point L84-2(lines 84 88) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= .cse0 |ULTIMATE.start_floor_double_#res#1|) |ULTIMATE.start_main_#t~short10#1| (= |ULTIMATE.start_floor_double_~x#1| .cse0) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (exists ((|v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_18| (_ BitVec 64)) (|v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17| (_ BitVec 32))) (let ((.cse3 (select |#memory_int| |v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11|))) (let ((.cse1 (select .cse3 (_ bv4 32)))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17|) (_ bv4 32)) .cse1) (= (let ((.cse2 (concat .cse1 (select .cse3 (_ bv0 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) |ULTIMATE.start___signbit_double_~x#1|) (= .cse1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_18|)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_18|)) (fp.neg (_ +zero 11 53))))))) (= currentRoundingMode roundNearestTiesToEven))) [2022-07-12 03:03:32,447 INFO L899 garLoopResultBuilder]: For program point L84-3(lines 84 88) no Hoare annotation was computed. [2022-07-12 03:03:32,447 INFO L902 garLoopResultBuilder]: At program point L109(lines 93 110) the Hoare annotation is: true [2022-07-12 03:03:32,447 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 44) no Hoare annotation was computed. [2022-07-12 03:03:32,447 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 43 44) no Hoare annotation was computed. [2022-07-12 03:03:32,449 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:03:32,451 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:03:32,457 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:03:32,458 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,458 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,458 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,458 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,458 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,458 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,459 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,459 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,459 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,459 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,459 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,459 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,461 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:32,464 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:03:32,464 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,464 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,464 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,464 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,464 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,465 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,465 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,465 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,465 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,465 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,469 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,469 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,469 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:32,470 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:32,471 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:32,471 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:32,472 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:03:32,472 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,472 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,472 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,472 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,472 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,472 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,473 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,473 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,473 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,473 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,473 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,473 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,474 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:32,474 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:03:32,474 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,474 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,474 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,474 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,475 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,475 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,475 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,475 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,475 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,475 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,475 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,476 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,476 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:32,477 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:32,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:03:32 BoogieIcfgContainer [2022-07-12 03:03:32,477 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:03:32,478 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:03:32,478 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:03:32,478 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:03:32,479 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:03:26" (3/4) ... [2022-07-12 03:03:32,481 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 03:03:32,488 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-07-12 03:03:32,488 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-07-12 03:03:32,489 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 03:03:32,489 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 03:03:32,505 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300) == huge_floor) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11 : bv32, v_skolemized_q#valueAsBitvector_18 : bv64, v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17 : bv32 :: ((unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17][4bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] && ~fp~LONGDOUBLE((unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][0bv32])[63:63], (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][0bv32])[62:52], (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][0bv32])[51:0]) == \result) && unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] == v_skolemized_q#valueAsBitvector_18[63:32]) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_18[63:63], v_skolemized_q#valueAsBitvector_18[62:52], v_skolemized_q#valueAsBitvector_18[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) [2022-07-12 03:03:32,506 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300) == huge_floor) && (\exists v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11 : bv32, v_skolemized_q#valueAsBitvector_18 : bv64, v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17 : bv32 :: ((unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17][4bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] && ~fp~LONGDOUBLE((unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][0bv32])[63:63], (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][0bv32])[62:52], (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][0bv32])[51:0]) == x) && unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] == v_skolemized_q#valueAsBitvector_18[63:32]) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_18[63:63], v_skolemized_q#valueAsBitvector_18[62:52], v_skolemized_q#valueAsBitvector_18[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-12 03:03:32,506 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300) == huge_floor) && 1bv32 == \result) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-12 03:03:32,514 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 03:03:32,514 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:03:32,514 INFO L158 Benchmark]: Toolchain (without parser) took 6974.32ms. Allocated memory was 50.3MB in the beginning and 73.4MB in the end (delta: 23.1MB). Free memory was 25.1MB in the beginning and 48.8MB in the end (delta: -23.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:03:32,515 INFO L158 Benchmark]: CDTParser took 0.77ms. Allocated memory is still 50.3MB. Free memory was 31.1MB in the beginning and 31.1MB in the end (delta: 32.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:03:32,515 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.44ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 24.9MB in the beginning and 41.6MB in the end (delta: -16.7MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2022-07-12 03:03:32,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.68ms. Allocated memory is still 60.8MB. Free memory was 41.6MB in the beginning and 39.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:03:32,515 INFO L158 Benchmark]: Boogie Preprocessor took 51.08ms. Allocated memory is still 60.8MB. Free memory was 39.8MB in the beginning and 38.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:03:32,516 INFO L158 Benchmark]: RCFGBuilder took 1042.27ms. Allocated memory is still 60.8MB. Free memory was 38.0MB in the beginning and 37.2MB in the end (delta: 826.2kB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2022-07-12 03:03:32,516 INFO L158 Benchmark]: TraceAbstraction took 5568.81ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 36.5MB in the beginning and 52.4MB in the end (delta: -15.9MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2022-07-12 03:03:32,516 INFO L158 Benchmark]: Witness Printer took 36.18ms. Allocated memory is still 73.4MB. Free memory was 52.4MB in the beginning and 48.8MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:03:32,517 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.77ms. Allocated memory is still 50.3MB. Free memory was 31.1MB in the beginning and 31.1MB in the end (delta: 32.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.44ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 24.9MB in the beginning and 41.6MB in the end (delta: -16.7MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.68ms. Allocated memory is still 60.8MB. Free memory was 41.6MB in the beginning and 39.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.08ms. Allocated memory is still 60.8MB. Free memory was 39.8MB in the beginning and 38.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1042.27ms. Allocated memory is still 60.8MB. Free memory was 38.0MB in the beginning and 37.2MB in the end (delta: 826.2kB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5568.81ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 36.5MB in the beginning and 52.4MB in the end (delta: -15.9MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * Witness Printer took 36.18ms. Allocated memory is still 73.4MB. Free memory was 52.4MB in the beginning and 48.8MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,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_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,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 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_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,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_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 105]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 472 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 95 IncrementalHoareTripleChecker+Unchecked, 279 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43 IncrementalHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 193 mSDtfsCounter, 43 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 210 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 113 ConstructedInterpolants, 43 QuantifiedInterpolants, 1415 SizeOfPredicates, 47 NumberOfNonLiveVariables, 436 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 84]: Loop Invariant [2022-07-12 03:03:32,528 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:03:32,528 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,529 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,530 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,530 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,530 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,530 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:32,531 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:03:32,531 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,531 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,531 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,531 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,531 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,532 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,532 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,532 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,532 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,532 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,532 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,532 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,532 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300) == huge_floor) && (\exists v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11 : bv32, v_skolemized_q#valueAsBitvector_18 : bv64, v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17 : bv32 :: ((unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17][4bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] && ~fp~LONGDOUBLE((unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][0bv32])[63:63], (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][0bv32])[62:52], (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][0bv32])[51:0]) == x) && unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] == v_skolemized_q#valueAsBitvector_18[63:32]) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_18[63:63], v_skolemized_q#valueAsBitvector_18[62:52], v_skolemized_q#valueAsBitvector_18[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 81]: Loop Invariant [2022-07-12 03:03:32,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:32,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300) == huge_floor) && 1bv32 == \result) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 18]: Loop Invariant [2022-07-12 03:03:32,534 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:32,534 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:03:32,534 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,534 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,534 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,534 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,534 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,535 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,535 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,535 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,535 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,535 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,535 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,535 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,536 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:32,536 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:03:32,536 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,536 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,536 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,536 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,536 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,537 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,537 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,537 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:03:32,537 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,537 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,537 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2022-07-12 03:03:32,537 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] Derived loop invariant: (((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300) == huge_floor) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11 : bv32, v_skolemized_q#valueAsBitvector_18 : bv64, v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17 : bv32 :: ((unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#ew_u~0#1.base_17][4bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] && ~fp~LONGDOUBLE((unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][0bv32])[63:63], (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][0bv32])[62:52], (unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] ++ unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][0bv32])[51:0]) == \result) && unknown-#memory_int-unknown[v_ULTIMATE.start_floor_double_~#iw_u~0#1.base_11][4bv32] == v_skolemized_q#valueAsBitvector_18[63:32]) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_18[63:63], v_skolemized_q#valueAsBitvector_18[62:52], v_skolemized_q#valueAsBitvector_18[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 21]: Loop Invariant [2022-07-12 03:03:32,538 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:03:32,538 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E300) == huge_floor) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven RESULT: Ultimate proved your program to be correct! [2022-07-12 03:03:32,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE