./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 ae007674 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-dev-ae00767 [2021-12-27 23:37:23,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-27 23:37:23,677 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-27 23:37:23,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-27 23:37:23,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-27 23:37:23,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-27 23:37:23,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-27 23:37:23,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-27 23:37:23,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-27 23:37:23,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-27 23:37:23,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-27 23:37:23,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-27 23:37:23,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-27 23:37:23,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-27 23:37:23,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-27 23:37:23,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-27 23:37:23,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-27 23:37:23,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-27 23:37:23,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-27 23:37:23,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-27 23:37:23,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-27 23:37:23,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-27 23:37:23,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-27 23:37:23,739 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-27 23:37:23,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-27 23:37:23,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-27 23:37:23,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-27 23:37:23,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-27 23:37:23,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-27 23:37:23,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-27 23:37:23,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-27 23:37:23,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-27 23:37:23,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-27 23:37:23,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-27 23:37:23,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-27 23:37:23,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-27 23:37:23,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-27 23:37:23,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-27 23:37:23,748 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-27 23:37:23,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-27 23:37:23,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-27 23:37:23,753 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-27 23:37:23,773 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-27 23:37:23,774 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-27 23:37:23,775 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-27 23:37:23,775 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-27 23:37:23,775 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-27 23:37:23,776 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-27 23:37:23,776 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-27 23:37:23,777 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-27 23:37:23,777 INFO L138 SettingsManager]: * Use SBE=true [2021-12-27 23:37:23,777 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-27 23:37:23,778 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-27 23:37:23,778 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-27 23:37:23,778 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-27 23:37:23,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-27 23:37:23,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-27 23:37:23,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-27 23:37:23,779 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-27 23:37:23,779 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-27 23:37:23,779 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-27 23:37:23,779 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-27 23:37:23,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-27 23:37:23,779 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-27 23:37:23,779 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-27 23:37:23,780 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-27 23:37:23,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 23:37:23,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-27 23:37:23,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-27 23:37:23,780 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-27 23:37:23,780 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-27 23:37:23,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-27 23:37:23,781 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-27 23:37:23,781 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-27 23:37:23,781 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-27 23:37:23,781 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 [2021-12-27 23:37:24,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-27 23:37:24,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-27 23:37:24,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-27 23:37:24,027 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-27 23:37:24,028 INFO L275 PluginConnector]: CDTParser initialized [2021-12-27 23:37:24,029 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 [2021-12-27 23:37:24,077 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2e8fad5/fb462ffd481b4ee184d28be3bdea0aa1/FLAGa5dd0fa0f [2021-12-27 23:37:24,438 INFO L306 CDTParser]: Found 1 translation units. [2021-12-27 23:37:24,439 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1052c.c [2021-12-27 23:37:24,444 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2e8fad5/fb462ffd481b4ee184d28be3bdea0aa1/FLAGa5dd0fa0f [2021-12-27 23:37:24,457 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2e8fad5/fb462ffd481b4ee184d28be3bdea0aa1 [2021-12-27 23:37:24,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-27 23:37:24,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-27 23:37:24,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-27 23:37:24,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-27 23:37:24,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-27 23:37:24,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:37:24" (1/1) ... [2021-12-27 23:37:24,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e85685e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:24, skipping insertion in model container [2021-12-27 23:37:24,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:37:24" (1/1) ... [2021-12-27 23:37:24,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-27 23:37:24,482 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-27 23:37:24,604 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] [2021-12-27 23:37:24,607 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 23:37:24,614 INFO L203 MainTranslator]: Completed pre-run [2021-12-27 23:37:24,660 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] [2021-12-27 23:37:24,661 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 23:37:24,670 INFO L208 MainTranslator]: Completed translation [2021-12-27 23:37:24,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:24 WrapperNode [2021-12-27 23:37:24,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-27 23:37:24,672 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-27 23:37:24,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-27 23:37:24,672 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-27 23:37:24,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:24" (1/1) ... [2021-12-27 23:37:24,682 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:24" (1/1) ... [2021-12-27 23:37:24,704 INFO L137 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2021-12-27 23:37:24,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-27 23:37:24,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-27 23:37:24,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-27 23:37:24,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-27 23:37:24,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:24" (1/1) ... [2021-12-27 23:37:24,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:24" (1/1) ... [2021-12-27 23:37:24,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:24" (1/1) ... [2021-12-27 23:37:24,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:24" (1/1) ... [2021-12-27 23:37:24,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:24" (1/1) ... [2021-12-27 23:37:24,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:24" (1/1) ... [2021-12-27 23:37:24,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:24" (1/1) ... [2021-12-27 23:37:24,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-27 23:37:24,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-27 23:37:24,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-27 23:37:24,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-27 23:37:24,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:24" (1/1) ... [2021-12-27 23:37:24,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 23:37:24,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:37:24,769 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) [2021-12-27 23:37:24,791 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 [2021-12-27 23:37:24,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-27 23:37:24,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-27 23:37:24,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-27 23:37:24,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-12-27 23:37:24,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-27 23:37:24,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2021-12-27 23:37:24,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-27 23:37:24,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-27 23:37:24,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-27 23:37:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-27 23:37:24,866 INFO L234 CfgBuilder]: Building ICFG [2021-12-27 23:37:24,867 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-27 23:37:25,057 INFO L275 CfgBuilder]: Performing block encoding [2021-12-27 23:37:25,062 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-27 23:37:25,071 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-27 23:37:25,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:37:25 BoogieIcfgContainer [2021-12-27 23:37:25,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-27 23:37:25,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-27 23:37:25,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-27 23:37:25,077 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-27 23:37:25,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:37:24" (1/3) ... [2021-12-27 23:37:25,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4dfbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:37:25, skipping insertion in model container [2021-12-27 23:37:25,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:24" (2/3) ... [2021-12-27 23:37:25,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4dfbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:37:25, skipping insertion in model container [2021-12-27 23:37:25,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:37:25" (3/3) ... [2021-12-27 23:37:25,079 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1052c.c [2021-12-27 23:37:25,087 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-27 23:37:25,089 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-27 23:37:25,135 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-27 23:37:25,143 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-27 23:37:25,143 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-27 23:37:25,164 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) [2021-12-27 23:37:25,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-27 23:37:25,169 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:37:25,169 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:37:25,170 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:37:25,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:37:25,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1930029915, now seen corresponding path program 1 times [2021-12-27 23:37:25,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:37:25,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220688310] [2021-12-27 23:37:25,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:37:25,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:37:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:37:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:37:25,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 23:37:25,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220688310] [2021-12-27 23:37:25,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220688310] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:37:25,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:37:25,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-27 23:37:25,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791427002] [2021-12-27 23:37:25,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:37:25,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-27 23:37:25,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 23:37:25,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-27 23:37:25,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 23:37:25,327 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) [2021-12-27 23:37:25,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:37:25,341 INFO L93 Difference]: Finished difference Result 74 states and 118 transitions. [2021-12-27 23:37:25,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-27 23:37:25,343 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 [2021-12-27 23:37:25,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:37:25,349 INFO L225 Difference]: With dead ends: 74 [2021-12-27 23:37:25,349 INFO L226 Difference]: Without dead ends: 35 [2021-12-27 23:37:25,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 23:37:25,360 INFO L933 BasicCegarLoop]: 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 [2021-12-27 23:37:25,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:37:25,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-27 23:37:25,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-12-27 23:37:25,383 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) [2021-12-27 23:37:25,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2021-12-27 23:37:25,386 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 11 [2021-12-27 23:37:25,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:37:25,387 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2021-12-27 23:37:25,387 INFO L471 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) [2021-12-27 23:37:25,387 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2021-12-27 23:37:25,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-27 23:37:25,388 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:37:25,389 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:37:25,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-27 23:37:25,389 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:37:25,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:37:25,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1310108990, now seen corresponding path program 1 times [2021-12-27 23:37:25,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 23:37:25,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284840657] [2021-12-27 23:37:25,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:37:25,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 23:37:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-27 23:37:25,441 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-27 23:37:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-27 23:37:25,492 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-27 23:37:25,492 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-27 23:37:25,494 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-27 23:37:25,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-27 23:37:25,507 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-12-27 23:37:25,509 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-27 23:37:25,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:37:25 BoogieIcfgContainer [2021-12-27 23:37:25,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-27 23:37:25,536 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-27 23:37:25,536 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-27 23:37:25,536 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-27 23:37:25,537 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:37:25" (3/4) ... [2021-12-27 23:37:25,539 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-27 23:37:25,539 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-27 23:37:25,540 INFO L158 Benchmark]: Toolchain (without parser) took 1078.38ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 41.3MB in the beginning and 59.4MB in the end (delta: -18.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 23:37:25,540 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 60.8MB. Free memory was 43.1MB in the beginning and 43.0MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 23:37:25,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.87ms. Allocated memory is still 60.8MB. Free memory was 41.2MB in the beginning and 43.7MB in the end (delta: -2.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-27 23:37:25,543 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.01ms. Allocated memory is still 60.8MB. Free memory was 43.7MB in the beginning and 42.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 23:37:25,543 INFO L158 Benchmark]: Boogie Preprocessor took 39.90ms. Allocated memory is still 60.8MB. Free memory was 42.0MB in the beginning and 40.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-27 23:37:25,545 INFO L158 Benchmark]: RCFGBuilder took 326.82ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 40.4MB in the beginning and 61.3MB in the end (delta: -20.9MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2021-12-27 23:37:25,545 INFO L158 Benchmark]: TraceAbstraction took 461.03ms. Allocated memory is still 79.7MB. Free memory was 60.7MB in the beginning and 59.6MB in the end (delta: 1.1MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2021-12-27 23:37:25,546 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 79.7MB. Free memory was 59.6MB in the beginning and 59.4MB in the end (delta: 182.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 23:37:25,550 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.15ms. Allocated memory is still 60.8MB. Free memory was 43.1MB in the beginning and 43.0MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.87ms. Allocated memory is still 60.8MB. Free memory was 41.2MB in the beginning and 43.7MB in the end (delta: -2.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.01ms. Allocated memory is still 60.8MB. Free memory was 43.7MB in the beginning and 42.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.90ms. Allocated memory is still 60.8MB. Free memory was 42.0MB in the beginning and 40.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 326.82ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 40.4MB in the beginning and 61.3MB in the end (delta: -20.9MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * TraceAbstraction took 461.03ms. Allocated memory is still 79.7MB. Free memory was 60.7MB in the beginning and 59.6MB in the end (delta: 1.1MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 79.7MB. Free memory was 59.6MB in the beginning and 59.4MB in the end (delta: 182.9kB). 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 27, 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=-2, i1=-1, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] [L28] COND TRUE j0 < 20 VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2, i1=-1, j0=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] [L29] COND FALSE !(j0 < 0) [L39] i = (0x000fffff) >> j0 VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2, i1=-1, j0=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001] [L40] COND TRUE ((i0 & i) | i1) == 0 [L41] return x; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, \result=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2, i1=-1, 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.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 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.0s 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 [2021-12-27 23:37:25,583 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 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-dev-ae00767 [2021-12-27 23:37:27,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-27 23:37:27,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-27 23:37:27,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-27 23:37:27,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-27 23:37:27,175 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-27 23:37:27,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-27 23:37:27,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-27 23:37:27,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-27 23:37:27,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-27 23:37:27,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-27 23:37:27,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-27 23:37:27,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-27 23:37:27,191 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-27 23:37:27,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-27 23:37:27,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-27 23:37:27,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-27 23:37:27,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-27 23:37:27,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-27 23:37:27,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-27 23:37:27,204 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-27 23:37:27,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-27 23:37:27,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-27 23:37:27,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-27 23:37:27,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-27 23:37:27,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-27 23:37:27,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-27 23:37:27,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-27 23:37:27,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-27 23:37:27,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-27 23:37:27,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-27 23:37:27,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-27 23:37:27,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-27 23:37:27,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-27 23:37:27,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-27 23:37:27,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-27 23:37:27,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-27 23:37:27,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-27 23:37:27,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-27 23:37:27,219 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-27 23:37:27,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-27 23:37:27,220 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-27 23:37:27,252 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-27 23:37:27,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-27 23:37:27,253 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-27 23:37:27,253 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-27 23:37:27,254 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-27 23:37:27,254 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-27 23:37:27,255 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-27 23:37:27,255 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-27 23:37:27,255 INFO L138 SettingsManager]: * Use SBE=true [2021-12-27 23:37:27,255 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-27 23:37:27,256 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-27 23:37:27,256 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-27 23:37:27,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-27 23:37:27,257 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-27 23:37:27,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-27 23:37:27,257 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-27 23:37:27,257 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-27 23:37:27,257 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-27 23:37:27,257 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-27 23:37:27,257 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-27 23:37:27,257 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-27 23:37:27,258 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-27 23:37:27,258 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-27 23:37:27,258 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-27 23:37:27,258 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-27 23:37:27,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-27 23:37:27,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 23:37:27,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-27 23:37:27,259 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-27 23:37:27,259 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-27 23:37:27,259 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-27 23:37:27,259 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-27 23:37:27,259 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-27 23:37:27,260 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-27 23:37:27,260 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-27 23:37:27,260 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-27 23:37:27,260 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 [2021-12-27 23:37:27,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-27 23:37:27,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-27 23:37:27,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-27 23:37:27,527 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-27 23:37:27,527 INFO L275 PluginConnector]: CDTParser initialized [2021-12-27 23:37:27,528 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 [2021-12-27 23:37:27,580 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1419fffb/b828c13f83fe431290f1fc47247a9bbe/FLAGda4b9f730 [2021-12-27 23:37:27,985 INFO L306 CDTParser]: Found 1 translation units. [2021-12-27 23:37:27,986 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1052c.c [2021-12-27 23:37:27,991 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1419fffb/b828c13f83fe431290f1fc47247a9bbe/FLAGda4b9f730 [2021-12-27 23:37:28,001 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1419fffb/b828c13f83fe431290f1fc47247a9bbe [2021-12-27 23:37:28,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-27 23:37:28,004 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-27 23:37:28,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-27 23:37:28,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-27 23:37:28,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-27 23:37:28,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:37:28" (1/1) ... [2021-12-27 23:37:28,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1efb7b7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:28, skipping insertion in model container [2021-12-27 23:37:28,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:37:28" (1/1) ... [2021-12-27 23:37:28,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-27 23:37:28,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-27 23:37:28,195 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] [2021-12-27 23:37:28,199 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 23:37:28,215 INFO L203 MainTranslator]: Completed pre-run [2021-12-27 23:37:28,250 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] [2021-12-27 23:37:28,254 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 23:37:28,270 INFO L208 MainTranslator]: Completed translation [2021-12-27 23:37:28,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:28 WrapperNode [2021-12-27 23:37:28,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-27 23:37:28,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-27 23:37:28,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-27 23:37:28,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-27 23:37:28,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:28" (1/1) ... [2021-12-27 23:37:28,297 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:28" (1/1) ... [2021-12-27 23:37:28,321 INFO L137 Inliner]: procedures = 19, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2021-12-27 23:37:28,321 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-27 23:37:28,322 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-27 23:37:28,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-27 23:37:28,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-27 23:37:28,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:28" (1/1) ... [2021-12-27 23:37:28,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:28" (1/1) ... [2021-12-27 23:37:28,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:28" (1/1) ... [2021-12-27 23:37:28,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:28" (1/1) ... [2021-12-27 23:37:28,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:28" (1/1) ... [2021-12-27 23:37:28,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:28" (1/1) ... [2021-12-27 23:37:28,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:28" (1/1) ... [2021-12-27 23:37:28,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-27 23:37:28,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-27 23:37:28,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-27 23:37:28,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-27 23:37:28,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:28" (1/1) ... [2021-12-27 23:37:28,378 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 23:37:28,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 23:37:28,396 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) [2021-12-27 23:37:28,423 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 [2021-12-27 23:37:28,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-27 23:37:28,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2021-12-27 23:37:28,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2021-12-27 23:37:28,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-27 23:37:28,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-27 23:37:28,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-27 23:37:28,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-27 23:37:28,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-27 23:37:28,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-27 23:37:28,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-27 23:37:28,497 INFO L234 CfgBuilder]: Building ICFG [2021-12-27 23:37:28,498 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-27 23:37:29,414 INFO L275 CfgBuilder]: Performing block encoding [2021-12-27 23:37:29,418 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-27 23:37:29,418 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-27 23:37:29,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:37:29 BoogieIcfgContainer [2021-12-27 23:37:29,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-27 23:37:29,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-27 23:37:29,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-27 23:37:29,423 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-27 23:37:29,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:37:28" (1/3) ... [2021-12-27 23:37:29,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60587a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:37:29, skipping insertion in model container [2021-12-27 23:37:29,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:37:28" (2/3) ... [2021-12-27 23:37:29,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60587a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:37:29, skipping insertion in model container [2021-12-27 23:37:29,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:37:29" (3/3) ... [2021-12-27 23:37:29,425 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1052c.c [2021-12-27 23:37:29,429 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-27 23:37:29,429 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-27 23:37:29,459 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-27 23:37:29,463 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-27 23:37:29,464 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-27 23:37:29,473 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) [2021-12-27 23:37:29,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-27 23:37:29,477 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:37:29,477 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:37:29,478 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:37:29,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:37:29,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1930029915, now seen corresponding path program 1 times [2021-12-27 23:37:29,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:37:29,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131614047] [2021-12-27 23:37:29,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:37:29,491 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:37:29,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:37:29,493 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) [2021-12-27 23:37:29,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-27 23:37:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:37:29,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-27 23:37:29,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:37:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:37:29,599 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:37:29,600 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:37:29,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131614047] [2021-12-27 23:37:29,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131614047] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:37:29,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:37:29,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-27 23:37:29,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573215491] [2021-12-27 23:37:29,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:37:29,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-27 23:37:29,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:37:29,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-27 23:37:29,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 23:37:29,632 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) [2021-12-27 23:37:29,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:37:29,650 INFO L93 Difference]: Finished difference Result 74 states and 118 transitions. [2021-12-27 23:37:29,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-27 23:37:29,652 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 [2021-12-27 23:37:29,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:37:29,658 INFO L225 Difference]: With dead ends: 74 [2021-12-27 23:37:29,658 INFO L226 Difference]: Without dead ends: 35 [2021-12-27 23:37:29,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-27 23:37:29,665 INFO L933 BasicCegarLoop]: 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 [2021-12-27 23:37:29,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:37:29,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-27 23:37:29,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-12-27 23:37:29,694 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) [2021-12-27 23:37:29,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2021-12-27 23:37:29,697 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 11 [2021-12-27 23:37:29,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:37:29,698 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2021-12-27 23:37:29,698 INFO L471 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) [2021-12-27 23:37:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2021-12-27 23:37:29,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-27 23:37:29,700 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:37:29,705 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:37:29,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-27 23:37:29,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:37:29,913 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:37:29,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:37:29,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1310108990, now seen corresponding path program 1 times [2021-12-27 23:37:29,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:37:29,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965825305] [2021-12-27 23:37:29,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:37:29,914 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:37:29,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:37:29,915 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) [2021-12-27 23:37:29,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-27 23:37:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:37:29,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-27 23:37:29,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:37:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:37:30,076 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:37:30,077 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:37:30,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965825305] [2021-12-27 23:37:30,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1965825305] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:37:30,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:37:30,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 23:37:30,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683653022] [2021-12-27 23:37:30,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:37:30,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 23:37:30,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:37:30,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 23:37:30,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 23:37:30,080 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) [2021-12-27 23:37:30,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:37:30,761 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2021-12-27 23:37:30,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 23:37:30,762 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 [2021-12-27 23:37:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:37:30,763 INFO L225 Difference]: With dead ends: 47 [2021-12-27 23:37:30,763 INFO L226 Difference]: Without dead ends: 31 [2021-12-27 23:37:30,763 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:37:30,764 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2021-12-27 23:37:30,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 119 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 22 Unchecked, 0.7s Time] [2021-12-27 23:37:30,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-27 23:37:30,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-12-27 23:37:30,766 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) [2021-12-27 23:37:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2021-12-27 23:37:30,767 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 12 [2021-12-27 23:37:30,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:37:30,767 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2021-12-27 23:37:30,767 INFO L471 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) [2021-12-27 23:37:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2021-12-27 23:37:30,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-27 23:37:30,768 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:37:30,768 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:37:30,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-27 23:37:30,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:37:30,973 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:37:30,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:37:30,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1803079892, now seen corresponding path program 1 times [2021-12-27 23:37:30,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:37:30,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282003988] [2021-12-27 23:37:30,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:37:30,974 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:37:30,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:37:30,975 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) [2021-12-27 23:37:30,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-27 23:37:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:37:31,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-27 23:37:31,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:37:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:37:31,145 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:37:31,145 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:37:31,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282003988] [2021-12-27 23:37:31,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282003988] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:37:31,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:37:31,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 23:37:31,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340030686] [2021-12-27 23:37:31,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:37:31,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 23:37:31,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:37:31,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 23:37:31,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 23:37:31,147 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) [2021-12-27 23:37:31,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:37:31,452 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2021-12-27 23:37:31,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 23:37:31,454 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 [2021-12-27 23:37:31,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:37:31,454 INFO L225 Difference]: With dead ends: 43 [2021-12-27 23:37:31,454 INFO L226 Difference]: Without dead ends: 22 [2021-12-27 23:37:31,455 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:37:31,455 INFO L933 BasicCegarLoop]: 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 [2021-12-27 23:37:31,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 11 Unchecked, 0.3s Time] [2021-12-27 23:37:31,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-12-27 23:37:31,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-12-27 23:37:31,459 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) [2021-12-27 23:37:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2021-12-27 23:37:31,460 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 12 [2021-12-27 23:37:31,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:37:31,460 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-12-27 23:37:31,460 INFO L471 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) [2021-12-27 23:37:31,460 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2021-12-27 23:37:31,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-27 23:37:31,461 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:37:31,461 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:37:31,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-27 23:37:31,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:37:31,669 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:37:31,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:37:31,670 INFO L85 PathProgramCache]: Analyzing trace with hash -649381144, now seen corresponding path program 1 times [2021-12-27 23:37:31,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:37:31,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323672059] [2021-12-27 23:37:31,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:37:31,670 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:37:31,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:37:31,671 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) [2021-12-27 23:37:31,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-27 23:37:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:37:31,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-27 23:37:31,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:37:31,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:37:31,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:37:31,910 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:37:31,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323672059] [2021-12-27 23:37:31,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323672059] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:37:31,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:37:31,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 23:37:31,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702352627] [2021-12-27 23:37:31,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:37:31,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 23:37:31,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:37:31,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 23:37:31,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-27 23:37:31,911 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) [2021-12-27 23:37:31,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:37:31,962 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2021-12-27 23:37:31,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 23:37:31,964 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 [2021-12-27 23:37:31,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:37:31,965 INFO L225 Difference]: With dead ends: 34 [2021-12-27 23:37:31,965 INFO L226 Difference]: Without dead ends: 22 [2021-12-27 23:37:31,965 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:37:31,966 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:37:31,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 23:37:31,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-12-27 23:37:31,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-12-27 23:37:31,967 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) [2021-12-27 23:37:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-12-27 23:37:31,968 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2021-12-27 23:37:31,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:37:31,968 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-12-27 23:37:31,968 INFO L471 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) [2021-12-27 23:37:31,968 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2021-12-27 23:37:31,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-27 23:37:31,968 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:37:31,968 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:37:31,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-27 23:37:32,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:37:32,178 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:37:32,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:37:32,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1381924140, now seen corresponding path program 1 times [2021-12-27 23:37:32,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:37:32,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001013470] [2021-12-27 23:37:32,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:37:32,179 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:37:32,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:37:32,181 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) [2021-12-27 23:37:32,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-27 23:37:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:37:32,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-27 23:37:32,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:37:32,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:37:32,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:37:32,348 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:37:32,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001013470] [2021-12-27 23:37:32,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001013470] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:37:32,348 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:37:32,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 23:37:32,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852084711] [2021-12-27 23:37:32,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:37:32,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 23:37:32,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:37:32,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 23:37:32,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 23:37:32,351 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) [2021-12-27 23:37:32,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:37:32,392 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2021-12-27 23:37:32,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 23:37:32,393 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 [2021-12-27 23:37:32,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:37:32,394 INFO L225 Difference]: With dead ends: 34 [2021-12-27 23:37:32,394 INFO L226 Difference]: Without dead ends: 22 [2021-12-27 23:37:32,394 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:37:32,395 INFO L933 BasicCegarLoop]: 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 [2021-12-27 23:37:32,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 47 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 7 Unchecked, 0.0s Time] [2021-12-27 23:37:32,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-12-27 23:37:32,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-12-27 23:37:32,396 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) [2021-12-27 23:37:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2021-12-27 23:37:32,398 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 16 [2021-12-27 23:37:32,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:37:32,399 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-12-27 23:37:32,399 INFO L471 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) [2021-12-27 23:37:32,399 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2021-12-27 23:37:32,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-27 23:37:32,400 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:37:32,400 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:37:32,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-27 23:37:32,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:37:32,611 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:37:32,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:37:32,612 INFO L85 PathProgramCache]: Analyzing trace with hash 461150674, now seen corresponding path program 1 times [2021-12-27 23:37:32,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:37:32,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380144798] [2021-12-27 23:37:32,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:37:32,613 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:37:32,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:37:32,613 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) [2021-12-27 23:37:32,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-27 23:37:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:37:32,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-27 23:37:32,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:37:32,758 INFO L387 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 15 treesize of output 13 [2021-12-27 23:37:32,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:37:32,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:37:32,866 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:37:32,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380144798] [2021-12-27 23:37:32,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380144798] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:37:32,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:37:32,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 23:37:32,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847828988] [2021-12-27 23:37:32,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:37:32,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 23:37:32,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:37:32,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 23:37:32,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 23:37:32,869 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) [2021-12-27 23:37:32,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:37:32,894 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2021-12-27 23:37:32,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 23:37:32,897 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 [2021-12-27 23:37:32,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:37:32,898 INFO L225 Difference]: With dead ends: 34 [2021-12-27 23:37:32,898 INFO L226 Difference]: Without dead ends: 22 [2021-12-27 23:37:32,898 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:37:32,899 INFO L933 BasicCegarLoop]: 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 [2021-12-27 23:37:32,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2021-12-27 23:37:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-12-27 23:37:32,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-12-27 23:37:32,901 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) [2021-12-27 23:37:32,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2021-12-27 23:37:32,901 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 17 [2021-12-27 23:37:32,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:37:32,902 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2021-12-27 23:37:32,902 INFO L471 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) [2021-12-27 23:37:32,902 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2021-12-27 23:37:32,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-27 23:37:32,902 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:37:32,902 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:37:32,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-27 23:37:33,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:37:33,112 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:37:33,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:37:33,113 INFO L85 PathProgramCache]: Analyzing trace with hash -348195952, now seen corresponding path program 1 times [2021-12-27 23:37:33,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:37:33,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64396592] [2021-12-27 23:37:33,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:37:33,113 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:37:33,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:37:33,114 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) [2021-12-27 23:37:33,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-27 23:37:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:37:33,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-27 23:37:33,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:37:33,240 INFO L387 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 [2021-12-27 23:37:33,444 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-27 23:37:33,444 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 69 [2021-12-27 23:37:33,477 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2021-12-27 23:37:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:37:33,545 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:37:33,546 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:37:33,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64396592] [2021-12-27 23:37:33,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64396592] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:37:33,546 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:37:33,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 23:37:33,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222576116] [2021-12-27 23:37:33,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:37:33,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 23:37:33,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:37:33,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 23:37:33,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-27 23:37:33,547 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) [2021-12-27 23:37:33,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:37:33,596 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2021-12-27 23:37:33,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-27 23:37:33,596 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 [2021-12-27 23:37:33,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:37:33,597 INFO L225 Difference]: With dead ends: 25 [2021-12-27 23:37:33,597 INFO L226 Difference]: Without dead ends: 22 [2021-12-27 23:37:33,597 INFO L932 BasicCegarLoop]: 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 [2021-12-27 23:37:33,597 INFO L933 BasicCegarLoop]: 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 [2021-12-27 23:37:33,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 45 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 18 Unchecked, 0.0s Time] [2021-12-27 23:37:33,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-12-27 23:37:33,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-12-27 23:37:33,599 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) [2021-12-27 23:37:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2021-12-27 23:37:33,600 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 17 [2021-12-27 23:37:33,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:37:33,600 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2021-12-27 23:37:33,600 INFO L471 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) [2021-12-27 23:37:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2021-12-27 23:37:33,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-27 23:37:33,600 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 23:37:33,600 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:37:33,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-27 23:37:33,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:37:33,808 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 23:37:33,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 23:37:33,808 INFO L85 PathProgramCache]: Analyzing trace with hash -475618843, now seen corresponding path program 1 times [2021-12-27 23:37:33,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 23:37:33,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546998560] [2021-12-27 23:37:33,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 23:37:33,809 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 23:37:33,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 23:37:33,809 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) [2021-12-27 23:37:33,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-27 23:37:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 23:37:33,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-27 23:37:33,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 23:37:33,953 INFO L387 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 [2021-12-27 23:37:34,136 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-27 23:37:34,136 INFO L387 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 [2021-12-27 23:37:34,404 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-27 23:37:34,404 INFO L387 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 [2021-12-27 23:37:34,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 23:37:34,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 23:37:34,615 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 23:37:34,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546998560] [2021-12-27 23:37:34,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546998560] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 23:37:34,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 23:37:34,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-27 23:37:34,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939919208] [2021-12-27 23:37:34,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 23:37:34,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-27 23:37:34,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 23:37:34,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-27 23:37:34,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-27 23:37:34,617 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) [2021-12-27 23:37:34,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 23:37:34,645 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2021-12-27 23:37:34,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-27 23:37:34,645 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 [2021-12-27 23:37:34,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 23:37:34,645 INFO L225 Difference]: With dead ends: 22 [2021-12-27 23:37:34,645 INFO L226 Difference]: Without dead ends: 0 [2021-12-27 23:37:34,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-12-27 23:37:34,646 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 23:37:34,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 60 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 27 Unchecked, 0.0s Time] [2021-12-27 23:37:34,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-27 23:37:34,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-27 23:37:34,646 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) [2021-12-27 23:37:34,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-27 23:37:34,647 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2021-12-27 23:37:34,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 23:37:34,647 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-27 23:37:34,647 INFO L471 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) [2021-12-27 23:37:34,647 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-27 23:37:34,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-27 23:37:34,649 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-27 23:37:34,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-27 23:37:34,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 23:37:34,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-27 23:37:34,933 INFO L858 garLoopResultBuilder]: For program point L60(lines 60 67) no Hoare annotation was computed. [2021-12-27 23:37:34,934 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-27 23:37:34,934 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-27 23:37:34,934 INFO L858 garLoopResultBuilder]: For program point L28(lines 28 71) no Hoare annotation was computed. [2021-12-27 23:37:34,934 INFO L854 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))))))))) [2021-12-27 23:37:34,934 INFO L858 garLoopResultBuilder]: For program point L29(lines 29 48) no Hoare annotation was computed. [2021-12-27 23:37:34,934 INFO L858 garLoopResultBuilder]: For program point L21-1(lines 21 26) no Hoare annotation was computed. [2021-12-27 23:37:34,934 INFO L854 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)) [2021-12-27 23:37:34,934 INFO L858 garLoopResultBuilder]: For program point L21-3(lines 21 26) no Hoare annotation was computed. [2021-12-27 23:37:34,934 INFO L858 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2021-12-27 23:37:34,934 INFO L858 garLoopResultBuilder]: For program point L104-2(lines 104 107) no Hoare annotation was computed. [2021-12-27 23:37:34,934 INFO L858 garLoopResultBuilder]: For program point L30(lines 30 37) no Hoare annotation was computed. [2021-12-27 23:37:34,934 INFO L858 garLoopResultBuilder]: For program point L105(line 105) no Hoare annotation was computed. [2021-12-27 23:37:34,934 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 77) no Hoare annotation was computed. [2021-12-27 23:37:34,934 INFO L858 garLoopResultBuilder]: For program point L72-1(lines 18 79) no Hoare annotation was computed. [2021-12-27 23:37:34,935 INFO L858 garLoopResultBuilder]: For program point L72-2(lines 72 77) no Hoare annotation was computed. [2021-12-27 23:37:34,935 INFO L858 garLoopResultBuilder]: For program point L64(lines 64 65) no Hoare annotation was computed. [2021-12-27 23:37:34,935 INFO L858 garLoopResultBuilder]: For program point L31(lines 31 36) no Hoare annotation was computed. [2021-12-27 23:37:34,935 INFO L858 garLoopResultBuilder]: For program point L64-2(lines 64 65) no Hoare annotation was computed. [2021-12-27 23:37:34,935 INFO L858 garLoopResultBuilder]: For program point L56(lines 56 57) no Hoare annotation was computed. [2021-12-27 23:37:34,935 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 41) no Hoare annotation was computed. [2021-12-27 23:37:34,935 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-27 23:37:34,935 INFO L854 garLoopResultBuilder]: At program point L90(lines 81 91) the Hoare annotation is: (let ((.cse1 (fp.neg (_ +zero 11 53)))) (and (exists ((|v_skolemized_q#valueAsBitvector_18| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_19| (_ BitVec 64)) (v_arrayElimCell_8 (_ BitVec 32))) (and (= (_ bv1 32) |ULTIMATE.start___signbit_double_#res#1|) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_19|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_19|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_19|)) (let ((.cse0 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_18|) v_arrayElimCell_8))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) (= (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))))) (= .cse1 |ULTIMATE.start_floor_double_#res#1|) |ULTIMATE.start_main_#t~short10#1| (= |ULTIMATE.start_floor_double_~x#1| .cse1) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= currentRoundingMode roundNearestTiesToEven))) [2021-12-27 23:37:34,935 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2021-12-27 23:37:34,935 INFO L858 garLoopResultBuilder]: For program point L49(lines 49 71) no Hoare annotation was computed. [2021-12-27 23:37:34,935 INFO L858 garLoopResultBuilder]: For program point L33(lines 33 36) no Hoare annotation was computed. [2021-12-27 23:37:34,935 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-27 23:37:34,935 INFO L858 garLoopResultBuilder]: For program point L58(lines 58 70) no Hoare annotation was computed. [2021-12-27 23:37:34,935 INFO L858 garLoopResultBuilder]: For program point L50(lines 50 53) no Hoare annotation was computed. [2021-12-27 23:37:34,935 INFO L858 garLoopResultBuilder]: For program point L42(lines 42 47) no Hoare annotation was computed. [2021-12-27 23:37:34,935 INFO L858 garLoopResultBuilder]: For program point L59(lines 59 68) no Hoare annotation was computed. [2021-12-27 23:37:34,935 INFO L858 garLoopResultBuilder]: For program point L59-1(lines 59 68) no Hoare annotation was computed. [2021-12-27 23:37:34,935 INFO L858 garLoopResultBuilder]: For program point L84-1(lines 84 88) no Hoare annotation was computed. [2021-12-27 23:37:34,936 INFO L854 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))) [2021-12-27 23:37:34,936 INFO L858 garLoopResultBuilder]: For program point L84-3(lines 84 88) no Hoare annotation was computed. [2021-12-27 23:37:34,936 INFO L861 garLoopResultBuilder]: At program point L109(lines 93 110) the Hoare annotation is: true [2021-12-27 23:37:34,936 INFO L858 garLoopResultBuilder]: For program point L43(lines 43 44) no Hoare annotation was computed. [2021-12-27 23:37:34,936 INFO L858 garLoopResultBuilder]: For program point L43-2(lines 43 44) no Hoare annotation was computed. [2021-12-27 23:37:34,938 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 23:37:34,939 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-27 23:37:34,945 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] [2021-12-27 23:37:34,945 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] [2021-12-27 23:37:34,945 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] [2021-12-27 23:37:34,946 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] [2021-12-27 23:37:34,946 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] [2021-12-27 23:37:34,946 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] [2021-12-27 23:37:34,946 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] [2021-12-27 23:37:34,946 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] [2021-12-27 23:37:34,946 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] [2021-12-27 23:37:34,946 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,947 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,947 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,947 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,949 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-27 23:37:34,951 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] [2021-12-27 23:37:34,951 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] [2021-12-27 23:37:34,951 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] [2021-12-27 23:37:34,951 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] [2021-12-27 23:37:34,952 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] [2021-12-27 23:37:34,952 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] [2021-12-27 23:37:34,952 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] [2021-12-27 23:37:34,952 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] [2021-12-27 23:37:34,952 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] [2021-12-27 23:37:34,952 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,952 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,952 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,953 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,953 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-27 23:37:34,954 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] [2021-12-27 23:37:34,954 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] [2021-12-27 23:37:34,954 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] [2021-12-27 23:37:34,954 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,954 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] [2021-12-27 23:37:34,955 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,955 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] [2021-12-27 23:37:34,955 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,955 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] [2021-12-27 23:37:34,955 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,955 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,955 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,955 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-27 23:37:34,956 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] [2021-12-27 23:37:34,956 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] [2021-12-27 23:37:34,956 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] [2021-12-27 23:37:34,956 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,956 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] [2021-12-27 23:37:34,957 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,957 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] [2021-12-27 23:37:34,957 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,957 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] [2021-12-27 23:37:34,957 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,957 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,957 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,957 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-27 23:37:34,958 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-27 23:37:34,958 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] [2021-12-27 23:37:34,958 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] [2021-12-27 23:37:34,959 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] [2021-12-27 23:37:34,959 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] [2021-12-27 23:37:34,959 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] [2021-12-27 23:37:34,959 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] [2021-12-27 23:37:34,959 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] [2021-12-27 23:37:34,959 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] [2021-12-27 23:37:34,959 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] [2021-12-27 23:37:34,959 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,960 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,960 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,960 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,960 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-27 23:37:34,960 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] [2021-12-27 23:37:34,961 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] [2021-12-27 23:37:34,961 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] [2021-12-27 23:37:34,961 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] [2021-12-27 23:37:34,961 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] [2021-12-27 23:37:34,961 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] [2021-12-27 23:37:34,961 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] [2021-12-27 23:37:34,961 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] [2021-12-27 23:37:34,961 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] [2021-12-27 23:37:34,962 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,962 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,962 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,962 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:34,962 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-27 23:37:34,963 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-27 23:37:34,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:37:34 BoogieIcfgContainer [2021-12-27 23:37:34,963 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-27 23:37:34,964 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-27 23:37:34,964 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-27 23:37:34,964 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-27 23:37:34,964 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:37:29" (3/4) ... [2021-12-27 23:37:34,966 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-27 23:37:34,973 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2021-12-27 23:37:34,974 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-12-27 23:37:34,974 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-27 23:37:34,974 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-27 23:37:34,988 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())) [2021-12-27 23:37:34,989 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 [2021-12-27 23:37:34,989 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\exists v_skolemized_q#valueAsBitvector_18 : bv64, v_skolemized_q#valueAsBitvector_19 : bv64, v_arrayElimCell_8 : bv32 :: (1bv32 == \result && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_19[63:63], v_skolemized_q#valueAsBitvector_19[62:52], v_skolemized_q#valueAsBitvector_19[51:0]) == ~fp~LONGDOUBLE((v_skolemized_q#valueAsBitvector_18[63:32] ++ v_arrayElimCell_8)[63:63], (v_skolemized_q#valueAsBitvector_18[63:32] ++ v_arrayElimCell_8)[62:52], (v_skolemized_q#valueAsBitvector_18[63:32] ++ v_arrayElimCell_8)[51:0])) && ~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())) && ~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) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2021-12-27 23:37:35,002 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-27 23:37:35,002 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-27 23:37:35,003 INFO L158 Benchmark]: Toolchain (without parser) took 6998.64ms. Allocated memory was 54.5MB in the beginning and 73.4MB in the end (delta: 18.9MB). Free memory was 31.4MB in the beginning and 53.9MB in the end (delta: -22.4MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2021-12-27 23:37:35,003 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory was 36.8MB in the beginning and 36.7MB in the end (delta: 44.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 23:37:35,003 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.47ms. Allocated memory was 54.5MB in the beginning and 73.4MB in the end (delta: 18.9MB). Free memory was 31.2MB in the beginning and 54.7MB in the end (delta: -23.4MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2021-12-27 23:37:35,003 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.28ms. Allocated memory is still 73.4MB. Free memory was 54.5MB in the beginning and 52.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-27 23:37:35,004 INFO L158 Benchmark]: Boogie Preprocessor took 48.25ms. Allocated memory is still 73.4MB. Free memory was 52.6MB in the beginning and 51.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-27 23:37:35,004 INFO L158 Benchmark]: RCFGBuilder took 1048.52ms. Allocated memory is still 73.4MB. Free memory was 51.0MB in the beginning and 54.1MB in the end (delta: -3.1MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2021-12-27 23:37:35,004 INFO L158 Benchmark]: TraceAbstraction took 5542.50ms. Allocated memory is still 73.4MB. Free memory was 53.5MB in the beginning and 28.0MB in the end (delta: 25.5MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2021-12-27 23:37:35,004 INFO L158 Benchmark]: Witness Printer took 38.45ms. Allocated memory is still 73.4MB. Free memory was 28.0MB in the beginning and 53.9MB in the end (delta: -25.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-27 23:37:35,005 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.14ms. Allocated memory is still 54.5MB. Free memory was 36.8MB in the beginning and 36.7MB in the end (delta: 44.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.47ms. Allocated memory was 54.5MB in the beginning and 73.4MB in the end (delta: 18.9MB). Free memory was 31.2MB in the beginning and 54.7MB in the end (delta: -23.4MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.28ms. Allocated memory is still 73.4MB. Free memory was 54.5MB in the beginning and 52.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.25ms. Allocated memory is still 73.4MB. Free memory was 52.6MB in the beginning and 51.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1048.52ms. Allocated memory is still 73.4MB. Free memory was 51.0MB in the beginning and 54.1MB in the end (delta: -3.1MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5542.50ms. Allocated memory is still 73.4MB. Free memory was 53.5MB in the beginning and 28.0MB in the end (delta: 25.5MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * Witness Printer took 38.45ms. Allocated memory is still 73.4MB. Free memory was 28.0MB in the beginning and 53.9MB in the end (delta: -25.8MB). Peak memory consumption was 4.2MB. 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,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_arrayElimCell_8,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_arrayElimCell_8,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_arrayElimCell_8,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_skolemized_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,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_arrayElimCell_8,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_arrayElimCell_8,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_arrayElimCell_8,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 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.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 472 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 91 IncrementalHoareTripleChecker+Unchecked, 279 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 193 mSDtfsCounter, 40 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s 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, 246 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 113 ConstructedInterpolants, 44 QuantifiedInterpolants, 1451 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 [2021-12-27 23:37:35,018 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] [2021-12-27 23:37:35,018 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] [2021-12-27 23:37:35,019 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] [2021-12-27 23:37:35,019 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] [2021-12-27 23:37:35,019 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] [2021-12-27 23:37:35,019 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] [2021-12-27 23:37:35,019 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] [2021-12-27 23:37:35,019 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] [2021-12-27 23:37:35,019 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] [2021-12-27 23:37:35,019 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,020 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,020 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,020 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-27 23:37:35,021 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] [2021-12-27 23:37:35,021 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] [2021-12-27 23:37:35,021 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] [2021-12-27 23:37:35,021 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] [2021-12-27 23:37:35,021 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] [2021-12-27 23:37:35,021 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] [2021-12-27 23:37:35,021 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] [2021-12-27 23:37:35,021 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] [2021-12-27 23:37:35,022 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] [2021-12-27 23:37:35,022 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,022 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,022 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,022 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,022 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 [2021-12-27 23:37:35,023 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] [2021-12-27 23:37:35,023 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] [2021-12-27 23:37:35,023 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] [2021-12-27 23:37:35,023 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,023 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] [2021-12-27 23:37:35,023 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,023 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] [2021-12-27 23:37:35,023 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,024 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] [2021-12-27 23:37:35,024 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,024 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,024 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,024 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-27 23:37:35,024 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] [2021-12-27 23:37:35,025 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] [2021-12-27 23:37:35,025 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_19,QUANTIFIED] [2021-12-27 23:37:35,025 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,025 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] [2021-12-27 23:37:35,025 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,025 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] [2021-12-27 23:37:35,025 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,025 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_8,QUANTIFIED] [2021-12-27 23:37:35,025 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,026 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,026 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,026 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((\exists v_skolemized_q#valueAsBitvector_18 : bv64, v_skolemized_q#valueAsBitvector_19 : bv64, v_arrayElimCell_8 : bv32 :: (1bv32 == \result && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_19[63:63], v_skolemized_q#valueAsBitvector_19[62:52], v_skolemized_q#valueAsBitvector_19[51:0]) == ~fp~LONGDOUBLE((v_skolemized_q#valueAsBitvector_18[63:32] ++ v_arrayElimCell_8)[63:63], (v_skolemized_q#valueAsBitvector_18[63:32] ++ v_arrayElimCell_8)[62:52], (v_skolemized_q#valueAsBitvector_18[63:32] ++ v_arrayElimCell_8)[51:0])) && ~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())) && ~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) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 18]: Loop Invariant [2021-12-27 23:37:35,026 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-27 23:37:35,026 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] [2021-12-27 23:37:35,027 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] [2021-12-27 23:37:35,027 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] [2021-12-27 23:37:35,027 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] [2021-12-27 23:37:35,027 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] [2021-12-27 23:37:35,027 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] [2021-12-27 23:37:35,027 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] [2021-12-27 23:37:35,027 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] [2021-12-27 23:37:35,027 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] [2021-12-27 23:37:35,028 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,028 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,028 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,028 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,028 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-27 23:37:35,028 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] [2021-12-27 23:37:35,028 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] [2021-12-27 23:37:35,029 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] [2021-12-27 23:37:35,029 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] [2021-12-27 23:37:35,029 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] [2021-12-27 23:37:35,029 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] [2021-12-27 23:37:35,029 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] [2021-12-27 23:37:35,029 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] [2021-12-27 23:37:35,029 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] [2021-12-27 23:37:35,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,030 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_18,QUANTIFIED] [2021-12-27 23:37:35,030 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 [2021-12-27 23:37:35,030 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-27 23:37:35,030 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! [2021-12-27 23:37:35,058 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