./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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-benchs/interpolation.c.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 06:33:14,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 06:33:14,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 06:33:14,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 06:33:14,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 06:33:14,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 06:33:14,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 06:33:14,719 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 06:33:14,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 06:33:14,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 06:33:14,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 06:33:14,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 06:33:14,727 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 06:33:14,729 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 06:33:14,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 06:33:14,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 06:33:14,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 06:33:14,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 06:33:14,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 06:33:14,741 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 06:33:14,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 06:33:14,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 06:33:14,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 06:33:14,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 06:33:14,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 06:33:14,753 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 06:33:14,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 06:33:14,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 06:33:14,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 06:33:14,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 06:33:14,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 06:33:14,757 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 06:33:14,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 06:33:14,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 06:33:14,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 06:33:14,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 06:33:14,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 06:33:14,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 06:33:14,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 06:33:14,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 06:33:14,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 06:33:14,764 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 06:33:14,794 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 06:33:14,794 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 06:33:14,795 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 06:33:14,795 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 06:33:14,796 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 06:33:14,796 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 06:33:14,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 06:33:14,797 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 06:33:14,797 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 06:33:14,797 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 06:33:14,798 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 06:33:14,798 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 06:33:14,798 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 06:33:14,799 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 06:33:14,799 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 06:33:14,799 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 06:33:14,799 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 06:33:14,799 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 06:33:14,799 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 06:33:14,800 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 06:33:14,800 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 06:33:14,800 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 06:33:14,800 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 06:33:14,800 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 06:33:14,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 06:33:14,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 06:33:14,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 06:33:14,801 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 06:33:14,801 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 06:33:14,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 06:33:14,801 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 06:33:14,802 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 06:33:14,802 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 06:33:14,802 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 06:33:14,802 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 -> 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 [2021-12-17 06:33:15,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 06:33:15,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 06:33:15,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 06:33:15,054 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 06:33:15,055 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 06:33:15,056 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2021-12-17 06:33:15,112 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aad80104f/4117446e0dea427d8fa2ca6f3350ec37/FLAG6e4dd8e35 [2021-12-17 06:33:15,469 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 06:33:15,470 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2021-12-17 06:33:15,474 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aad80104f/4117446e0dea427d8fa2ca6f3350ec37/FLAG6e4dd8e35 [2021-12-17 06:33:15,891 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aad80104f/4117446e0dea427d8fa2ca6f3350ec37 [2021-12-17 06:33:15,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 06:33:15,894 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 06:33:15,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 06:33:15,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 06:33:15,899 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 06:33:15,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 06:33:15" (1/1) ... [2021-12-17 06:33:15,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55187457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:15, skipping insertion in model container [2021-12-17 06:33:15,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 06:33:15" (1/1) ... [2021-12-17 06:33:15,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 06:33:15,919 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 06:33:16,064 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-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2021-12-17 06:33:16,068 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 06:33:16,074 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 06:33:16,090 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-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2021-12-17 06:33:16,091 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 06:33:16,102 INFO L208 MainTranslator]: Completed translation [2021-12-17 06:33:16,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:16 WrapperNode [2021-12-17 06:33:16,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 06:33:16,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 06:33:16,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 06:33:16,104 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 06:33:16,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:16" (1/1) ... [2021-12-17 06:33:16,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:16" (1/1) ... [2021-12-17 06:33:16,132 INFO L137 Inliner]: procedures = 18, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 99 [2021-12-17 06:33:16,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 06:33:16,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 06:33:16,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 06:33:16,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 06:33:16,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:16" (1/1) ... [2021-12-17 06:33:16,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:16" (1/1) ... [2021-12-17 06:33:16,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:16" (1/1) ... [2021-12-17 06:33:16,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:16" (1/1) ... [2021-12-17 06:33:16,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:16" (1/1) ... [2021-12-17 06:33:16,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:16" (1/1) ... [2021-12-17 06:33:16,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:16" (1/1) ... [2021-12-17 06:33:16,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 06:33:16,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 06:33:16,152 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 06:33:16,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 06:33:16,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:16" (1/1) ... [2021-12-17 06:33:16,159 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 06:33:16,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 06:33:16,176 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-17 06:33:16,178 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-17 06:33:16,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 06:33:16,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 06:33:16,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 06:33:16,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-12-17 06:33:16,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 06:33:16,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 06:33:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-12-17 06:33:16,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 06:33:16,276 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 06:33:16,277 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 06:33:16,441 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 06:33:16,459 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 06:33:16,460 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-17 06:33:16,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:33:16 BoogieIcfgContainer [2021-12-17 06:33:16,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 06:33:16,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 06:33:16,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 06:33:16,465 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 06:33:16,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 06:33:15" (1/3) ... [2021-12-17 06:33:16,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396f8635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 06:33:16, skipping insertion in model container [2021-12-17 06:33:16,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:16" (2/3) ... [2021-12-17 06:33:16,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396f8635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 06:33:16, skipping insertion in model container [2021-12-17 06:33:16,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:33:16" (3/3) ... [2021-12-17 06:33:16,468 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c.p+cfa-reducer.c [2021-12-17 06:33:16,472 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 06:33:16,487 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 06:33:16,548 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 06:33:16,554 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-17 06:33:16,554 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 06:33:16,582 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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-17 06:33:16,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 06:33:16,597 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:33:16,598 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:33:16,598 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:33:16,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:33:16,605 INFO L85 PathProgramCache]: Analyzing trace with hash 83921358, now seen corresponding path program 1 times [2021-12-17 06:33:16,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 06:33:16,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980892095] [2021-12-17 06:33:16,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:33:16,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 06:33:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:33:16,838 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-17 06:33:16,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 06:33:16,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980892095] [2021-12-17 06:33:16,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980892095] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 06:33:16,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 06:33:16,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 06:33:16,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309633411] [2021-12-17 06:33:16,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 06:33:16,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 06:33:16,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 06:33:16,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 06:33:16,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 06:33:16,876 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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 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-17 06:33:16,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:33:16,974 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2021-12-17 06:33:16,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 06:33:16,977 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-17 06:33:16,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:33:16,983 INFO L225 Difference]: With dead ends: 51 [2021-12-17 06:33:16,984 INFO L226 Difference]: Without dead ends: 27 [2021-12-17 06:33:16,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-17 06:33:16,991 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 39 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 06:33:16,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 85 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 06:33:17,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-17 06:33:17,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 16. [2021-12-17 06:33:17,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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-17 06:33:17,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2021-12-17 06:33:17,020 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 12 [2021-12-17 06:33:17,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:33:17,020 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2021-12-17 06:33:17,020 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-17 06:33:17,020 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2021-12-17 06:33:17,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 06:33:17,021 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:33:17,021 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:33:17,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 06:33:17,021 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:33:17,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:33:17,023 INFO L85 PathProgramCache]: Analyzing trace with hash 100932019, now seen corresponding path program 1 times [2021-12-17 06:33:17,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 06:33:17,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857696808] [2021-12-17 06:33:17,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:33:17,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 06:33:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:33:17,064 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-17 06:33:17,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 06:33:17,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857696808] [2021-12-17 06:33:17,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857696808] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 06:33:17,065 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 06:33:17,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 06:33:17,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865255234] [2021-12-17 06:33:17,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 06:33:17,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 06:33:17,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 06:33:17,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 06:33:17,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 06:33:17,068 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-17 06:33:17,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:33:17,079 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2021-12-17 06:33:17,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 06:33:17,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-17 06:33:17,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:33:17,080 INFO L225 Difference]: With dead ends: 34 [2021-12-17 06:33:17,080 INFO L226 Difference]: Without dead ends: 26 [2021-12-17 06:33:17,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 06:33:17,082 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 06:33:17,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 33 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 06:33:17,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-17 06:33:17,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2021-12-17 06:33:17,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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-17 06:33:17,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-12-17 06:33:17,087 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 12 [2021-12-17 06:33:17,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:33:17,087 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-12-17 06:33:17,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-17 06:33:17,088 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2021-12-17 06:33:17,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 06:33:17,088 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:33:17,088 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:33:17,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 06:33:17,089 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:33:17,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:33:17,090 INFO L85 PathProgramCache]: Analyzing trace with hash 10142420, now seen corresponding path program 1 times [2021-12-17 06:33:17,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 06:33:17,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395792510] [2021-12-17 06:33:17,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:33:17,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 06:33:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 06:33:17,123 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 06:33:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 06:33:17,168 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 06:33:17,168 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 06:33:17,170 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 06:33:17,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 06:33:17,181 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-12-17 06:33:17,186 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 06:33:17,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 06:33:17 BoogieIcfgContainer [2021-12-17 06:33:17,223 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 06:33:17,224 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 06:33:17,224 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 06:33:17,224 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 06:33:17,225 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:33:16" (3/4) ... [2021-12-17 06:33:17,227 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-17 06:33:17,227 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 06:33:17,228 INFO L158 Benchmark]: Toolchain (without parser) took 1333.88ms. Allocated memory is still 100.7MB. Free memory was 66.8MB in the beginning and 72.6MB in the end (delta: -5.8MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 06:33:17,229 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 81.8MB. Free memory was 52.3MB in the beginning and 52.3MB in the end (delta: 25.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 06:33:17,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.14ms. Allocated memory is still 100.7MB. Free memory was 66.6MB in the beginning and 76.8MB in the end (delta: -10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 06:33:17,232 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.23ms. Allocated memory is still 100.7MB. Free memory was 76.8MB in the beginning and 74.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 06:33:17,237 INFO L158 Benchmark]: Boogie Preprocessor took 18.41ms. Allocated memory is still 100.7MB. Free memory was 74.7MB in the beginning and 73.7MB in the end (delta: 987.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 06:33:17,239 INFO L158 Benchmark]: RCFGBuilder took 309.00ms. Allocated memory is still 100.7MB. Free memory was 73.7MB in the beginning and 63.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 06:33:17,239 INFO L158 Benchmark]: TraceAbstraction took 761.17ms. Allocated memory is still 100.7MB. Free memory was 62.7MB in the beginning and 73.2MB in the end (delta: -10.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 06:33:17,240 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 100.7MB. Free memory was 73.2MB in the beginning and 72.6MB in the end (delta: 609.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 06:33:17,242 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.21ms. Allocated memory is still 81.8MB. Free memory was 52.3MB in the beginning and 52.3MB in the end (delta: 25.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.14ms. Allocated memory is still 100.7MB. Free memory was 66.6MB in the beginning and 76.8MB in the end (delta: -10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.23ms. Allocated memory is still 100.7MB. Free memory was 76.8MB in the beginning and 74.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.41ms. Allocated memory is still 100.7MB. Free memory was 74.7MB in the beginning and 73.7MB in the end (delta: 987.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 309.00ms. Allocated memory is still 100.7MB. Free memory was 73.7MB in the beginning and 63.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 761.17ms. Allocated memory is still 100.7MB. Free memory was 62.7MB in the beginning and 73.2MB in the end (delta: -10.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 100.7MB. Free memory was 73.2MB in the beginning and 72.6MB in the end (delta: 609.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 51]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of to_real at line 17, overapproximation of someBinaryArithmeticFLOAToperation at line 36. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L14] int main__i; [L15] float main__z; [L16] float main__t; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] main__t = __VERIFIER_nondet_float() [L20] int main____CPAchecker_TMP_0; [L21] EXPR main__min[0] VAL [__return_main=0, main__max={4:0}, main__min={5:0}, main__min[0]=49] [L21] COND TRUE main__t >= (main__min[0]) [L23] EXPR main__max[4UL] VAL [__return_main=0, main__max={4:0}, main__max[4UL]=51, main__min={5:0}] [L23] COND TRUE main__t <= (main__max[4UL]) [L25] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__max={4:0}, main__min={5:0}] [L27] COND TRUE main____CPAchecker_TMP_0 != 0 [L29] main__i = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={4:0}, main__min={5:0}] [L31] COND TRUE main__i < 5UL [L33] EXPR main__max[main__i] VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={4:0}, main__max[main__i]=50, main__min={5:0}] [L33] COND TRUE main__t <= (main__max[main__i]) [L36] EXPR main__min[main__i] [L36] EXPR main__max[main__i] [L36] EXPR main__min[main__i] [L36] main__z = (main__t - (main__min[main__i])) / ((main__max[main__i]) - (main__min[main__i])) [L37] int main____CPAchecker_TMP_1; VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={4:0}, main__min={5:0}] [L38] COND FALSE !(main__z >= 0.0) VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={4:0}, main__min={5:0}] [L63] main____CPAchecker_TMP_1 = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={4:0}, main__min={5:0}] [L45] int __tmp_1; [L46] __tmp_1 = main____CPAchecker_TMP_1 [L47] int __VERIFIER_assert__cond; [L48] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={4:0}, main__min={5:0}] [L49] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={4:0}, main__min={5:0}] [L51] reach_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={4:0}, main__min={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 118 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 42 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 2 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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-17 06:33:17,287 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-benchs/interpolation.c.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 06:33:19,151 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 06:33:19,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 06:33:19,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 06:33:19,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 06:33:19,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 06:33:19,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 06:33:19,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 06:33:19,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 06:33:19,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 06:33:19,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 06:33:19,223 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 06:33:19,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 06:33:19,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 06:33:19,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 06:33:19,230 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 06:33:19,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 06:33:19,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 06:33:19,236 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 06:33:19,241 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 06:33:19,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 06:33:19,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 06:33:19,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 06:33:19,246 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 06:33:19,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 06:33:19,250 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 06:33:19,250 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 06:33:19,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 06:33:19,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 06:33:19,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 06:33:19,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 06:33:19,254 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 06:33:19,255 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 06:33:19,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 06:33:19,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 06:33:19,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 06:33:19,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 06:33:19,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 06:33:19,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 06:33:19,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 06:33:19,260 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 06:33:19,263 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-17 06:33:19,282 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 06:33:19,282 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 06:33:19,283 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 06:33:19,283 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 06:33:19,283 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 06:33:19,283 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 06:33:19,284 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 06:33:19,284 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 06:33:19,284 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 06:33:19,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 06:33:19,285 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 06:33:19,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 06:33:19,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 06:33:19,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 06:33:19,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 06:33:19,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 06:33:19,286 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-17 06:33:19,286 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-17 06:33:19,286 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-17 06:33:19,286 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 06:33:19,286 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 06:33:19,287 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 06:33:19,287 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 06:33:19,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 06:33:19,287 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 06:33:19,287 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 06:33:19,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 06:33:19,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 06:33:19,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 06:33:19,288 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 06:33:19,288 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-17 06:33:19,288 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-17 06:33:19,289 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 06:33:19,289 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 06:33:19,289 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 06:33:19,289 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 06:33:19,289 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-17 06:33:19,289 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 -> 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 [2021-12-17 06:33:19,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 06:33:19,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 06:33:19,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 06:33:19,606 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 06:33:19,607 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 06:33:19,608 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2021-12-17 06:33:19,665 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f75e596dc/b7050541cafd4d589a6149ed4d073b8e/FLAG316cd5637 [2021-12-17 06:33:20,002 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 06:33:20,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2021-12-17 06:33:20,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f75e596dc/b7050541cafd4d589a6149ed4d073b8e/FLAG316cd5637 [2021-12-17 06:33:20,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f75e596dc/b7050541cafd4d589a6149ed4d073b8e [2021-12-17 06:33:20,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 06:33:20,025 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 06:33:20,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 06:33:20,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 06:33:20,035 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 06:33:20,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 06:33:20" (1/1) ... [2021-12-17 06:33:20,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e94af17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:20, skipping insertion in model container [2021-12-17 06:33:20,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 06:33:20" (1/1) ... [2021-12-17 06:33:20,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 06:33:20,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 06:33:20,157 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-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2021-12-17 06:33:20,161 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 06:33:20,176 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 06:33:20,252 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-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2021-12-17 06:33:20,259 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 06:33:20,274 INFO L208 MainTranslator]: Completed translation [2021-12-17 06:33:20,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:20 WrapperNode [2021-12-17 06:33:20,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 06:33:20,277 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 06:33:20,277 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 06:33:20,277 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 06:33:20,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:20" (1/1) ... [2021-12-17 06:33:20,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:20" (1/1) ... [2021-12-17 06:33:20,319 INFO L137 Inliner]: procedures = 19, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 100 [2021-12-17 06:33:20,319 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 06:33:20,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 06:33:20,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 06:33:20,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 06:33:20,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:20" (1/1) ... [2021-12-17 06:33:20,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:20" (1/1) ... [2021-12-17 06:33:20,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:20" (1/1) ... [2021-12-17 06:33:20,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:20" (1/1) ... [2021-12-17 06:33:20,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:20" (1/1) ... [2021-12-17 06:33:20,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:20" (1/1) ... [2021-12-17 06:33:20,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:20" (1/1) ... [2021-12-17 06:33:20,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 06:33:20,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 06:33:20,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 06:33:20,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 06:33:20,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:20" (1/1) ... [2021-12-17 06:33:20,370 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 06:33:20,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 06:33:20,392 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-17 06:33:20,416 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-17 06:33:20,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 06:33:20,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-12-17 06:33:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 06:33:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 06:33:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-12-17 06:33:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 06:33:20,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 06:33:20,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 06:33:20,513 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 06:33:20,514 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 06:33:21,167 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 06:33:21,173 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 06:33:21,173 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-17 06:33:21,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:33:21 BoogieIcfgContainer [2021-12-17 06:33:21,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 06:33:21,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 06:33:21,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 06:33:21,178 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 06:33:21,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 06:33:20" (1/3) ... [2021-12-17 06:33:21,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36408c22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 06:33:21, skipping insertion in model container [2021-12-17 06:33:21,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:33:20" (2/3) ... [2021-12-17 06:33:21,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36408c22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 06:33:21, skipping insertion in model container [2021-12-17 06:33:21,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:33:21" (3/3) ... [2021-12-17 06:33:21,180 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c.p+cfa-reducer.c [2021-12-17 06:33:21,184 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 06:33:21,186 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 06:33:21,223 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 06:33:21,229 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-17 06:33:21,229 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 06:33:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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-17 06:33:21,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 06:33:21,259 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:33:21,259 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:33:21,260 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:33:21,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:33:21,268 INFO L85 PathProgramCache]: Analyzing trace with hash 83921358, now seen corresponding path program 1 times [2021-12-17 06:33:21,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:33:21,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556909180] [2021-12-17 06:33:21,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:33:21,294 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:33:21,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:33:21,299 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-17 06:33:21,309 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-17 06:33:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:33:21,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 06:33:21,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:33:21,715 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-17 06:33:21,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 06:33:21,716 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:33:21,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556909180] [2021-12-17 06:33:21,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556909180] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 06:33:21,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 06:33:21,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 06:33:21,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720454988] [2021-12-17 06:33:21,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 06:33:21,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 06:33:21,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:33:21,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 06:33:21,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 06:33:21,755 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-17 06:33:24,793 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 06:33:24,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:33:24,797 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2021-12-17 06:33:24,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 06:33:24,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-17 06:33:24,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:33:24,842 INFO L225 Difference]: With dead ends: 43 [2021-12-17 06:33:24,842 INFO L226 Difference]: Without dead ends: 26 [2021-12-17 06:33:24,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 06:33:24,846 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-12-17 06:33:24,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 43 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2021-12-17 06:33:24,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-17 06:33:24,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2021-12-17 06:33:24,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 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-17 06:33:24,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2021-12-17 06:33:24,868 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 12 [2021-12-17 06:33:24,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:33:24,869 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2021-12-17 06:33:24,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-17 06:33:24,869 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2021-12-17 06:33:24,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 06:33:24,870 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:33:24,870 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:33:24,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-17 06:33:25,075 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-17 06:33:25,075 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:33:25,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:33:25,076 INFO L85 PathProgramCache]: Analyzing trace with hash -6868241, now seen corresponding path program 1 times [2021-12-17 06:33:25,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:33:25,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736138931] [2021-12-17 06:33:25,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:33:25,077 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:33:25,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:33:25,079 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-17 06:33:25,081 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-17 06:33:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:33:25,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-17 06:33:25,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:33:25,414 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-17 06:33:25,415 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 06:33:25,415 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:33:25,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736138931] [2021-12-17 06:33:25,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736138931] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 06:33:25,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 06:33:25,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 06:33:25,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835368625] [2021-12-17 06:33:25,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 06:33:25,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 06:33:25,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:33:25,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 06:33:25,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 06:33:25,419 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-17 06:33:27,234 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 06:33:27,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:33:27,311 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2021-12-17 06:33:27,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 06:33:27,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2021-12-17 06:33:27,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:33:27,312 INFO L225 Difference]: With dead ends: 21 [2021-12-17 06:33:27,312 INFO L226 Difference]: Without dead ends: 17 [2021-12-17 06:33:27,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-17 06:33:27,314 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-17 06:33:27,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-17 06:33:27,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-12-17 06:33:27,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-12-17 06:33:27,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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-17 06:33:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-12-17 06:33:27,318 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 13 [2021-12-17 06:33:27,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:33:27,318 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-12-17 06:33:27,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-17 06:33:27,319 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2021-12-17 06:33:27,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 06:33:27,319 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:33:27,319 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:33:27,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-17 06:33:27,527 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-17 06:33:27,528 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:33:27,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:33:27,528 INFO L85 PathProgramCache]: Analyzing trace with hash 10142420, now seen corresponding path program 1 times [2021-12-17 06:33:27,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:33:27,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339005964] [2021-12-17 06:33:27,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:33:27,529 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:33:27,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:33:27,530 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-17 06:33:27,539 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-17 06:33:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:33:27,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-17 06:33:27,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:33:29,767 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 06:33:29,768 INFO L388 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 178 treesize of output 86 [2021-12-17 06:34:15,878 WARN L227 SmtUtils]: Spent 15.32s on a formula simplification. DAG size of input: 39 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 06:35:05,972 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53)))))) is different from false [2021-12-17 06:35:07,999 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53)))))) is different from true [2021-12-17 06:35:54,422 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53)))))) is different from false [2021-12-17 06:35:56,450 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53)))))) is different from true [2021-12-17 06:37:31,527 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-17 06:37:31,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 06:37:31,527 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:37:31,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1339005964] [2021-12-17 06:37:31,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1339005964] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 06:37:31,528 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 06:37:31,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-17 06:37:31,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25095448] [2021-12-17 06:37:31,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 06:37:31,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 06:37:31,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:37:31,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 06:37:31,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=60, Unknown=5, NotChecked=34, Total=132 [2021-12-17 06:37:31,530 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-17 06:37:33,827 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 06:37:33,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:37:33,949 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2021-12-17 06:37:33,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 06:37:33,954 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 13 [2021-12-17 06:37:33,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:37:33,955 INFO L225 Difference]: With dead ends: 30 [2021-12-17 06:37:33,955 INFO L226 Difference]: Without dead ends: 25 [2021-12-17 06:37:33,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 39.5s TimeCoverageRelationStatistics Valid=33, Invalid=60, Unknown=5, NotChecked=34, Total=132 [2021-12-17 06:37:33,957 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 14 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-12-17 06:37:33,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 20 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 47 Invalid, 1 Unknown, 46 Unchecked, 2.4s Time] [2021-12-17 06:37:33,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-17 06:37:33,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2021-12-17 06:37:33,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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-17 06:37:33,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-12-17 06:37:33,963 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2021-12-17 06:37:33,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:37:33,964 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-12-17 06:37:33,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-17 06:37:33,964 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2021-12-17 06:37:33,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 06:37:33,965 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:37:33,965 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:37:33,979 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-17 06:37:34,171 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-17 06:37:34,172 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:37:34,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:37:34,172 INFO L85 PathProgramCache]: Analyzing trace with hash 2097179417, now seen corresponding path program 1 times [2021-12-17 06:37:34,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:37:34,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650077698] [2021-12-17 06:37:34,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:37:34,173 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:37:34,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:37:34,174 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-17 06:37:34,175 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-17 06:37:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:37:34,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 06:37:34,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:37:34,429 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-17 06:37:34,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 06:37:34,430 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:37:34,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650077698] [2021-12-17 06:37:34,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650077698] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 06:37:34,430 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 06:37:34,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 06:37:34,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534586615] [2021-12-17 06:37:34,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 06:37:34,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 06:37:34,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:37:34,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 06:37:34,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 06:37:34,433 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-17 06:37:34,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:37:34,467 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2021-12-17 06:37:34,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 06:37:34,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2021-12-17 06:37:34,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:37:34,468 INFO L225 Difference]: With dead ends: 32 [2021-12-17 06:37:34,468 INFO L226 Difference]: Without dead ends: 19 [2021-12-17 06:37:34,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 06:37:34,469 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 06:37:34,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 06:37:34,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-12-17 06:37:34,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-12-17 06:37:34,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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-17 06:37:34,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2021-12-17 06:37:34,473 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2021-12-17 06:37:34,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:37:34,473 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2021-12-17 06:37:34,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-17 06:37:34,474 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2021-12-17 06:37:34,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-17 06:37:34,474 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:37:34,474 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:37:34,495 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-17 06:37:34,691 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-17 06:37:34,691 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:37:34,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:37:34,692 INFO L85 PathProgramCache]: Analyzing trace with hash -202431920, now seen corresponding path program 1 times [2021-12-17 06:37:34,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:37:34,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706137484] [2021-12-17 06:37:34,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:37:34,693 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:37:34,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:37:34,694 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-17 06:37:34,696 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-17 06:37:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:37:35,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-17 06:37:35,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:37:37,314 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 06:37:37,314 INFO L388 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 178 treesize of output 86 [2021-12-17 06:38:24,317 WARN L227 SmtUtils]: Spent 14.79s on a formula simplification. DAG size of input: 39 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 06:39:21,343 WARN L227 SmtUtils]: Spent 12.72s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 06:40:40,677 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))))) (and (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.geq .cse2 (_ +zero 11 53)) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.leq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))))))) is different from false [2021-12-17 06:40:42,707 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))))) (and (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.geq .cse2 (_ +zero 11 53)) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.leq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))))))) is different from true [2021-12-17 06:44:25,240 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-17 06:44:25,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 06:44:25,240 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:44:25,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706137484] [2021-12-17 06:44:25,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706137484] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 06:44:25,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 06:44:25,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-17 06:44:25,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171971349] [2021-12-17 06:44:25,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 06:44:25,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 06:44:25,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:44:25,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 06:44:25,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=70, Unknown=9, NotChecked=18, Total=132 [2021-12-17 06:44:25,242 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-17 06:44:26,882 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 06:44:29,113 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= (_ bv0 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1)))))) (= (_ bv0 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|) (= (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= (let ((.cse5 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse6 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)))) is different from false [2021-12-17 06:44:31,259 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 06:44:33,266 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 06:44:33,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:44:33,673 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2021-12-17 06:44:33,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 06:44:33,682 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 14 [2021-12-17 06:44:33,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:44:33,682 INFO L225 Difference]: With dead ends: 25 [2021-12-17 06:44:33,682 INFO L226 Difference]: Without dead ends: 17 [2021-12-17 06:44:33,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 59.4s TimeCoverageRelationStatistics Valid=37, Invalid=71, Unknown=10, NotChecked=38, Total=156 [2021-12-17 06:44:33,684 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 18 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2021-12-17 06:44:33,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 33 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 2 Unknown, 41 Unchecked, 6.3s Time] [2021-12-17 06:44:33,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-12-17 06:44:33,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-12-17 06:44:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-17 06:44:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-12-17 06:44:33,692 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2021-12-17 06:44:33,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:44:33,692 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-12-17 06:44:33,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-17 06:44:33,692 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-12-17 06:44:33,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-17 06:44:33,693 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:44:33,693 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:44:33,708 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-17 06:44:33,895 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-17 06:44:33,896 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:44:33,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:44:33,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1048715671, now seen corresponding path program 1 times [2021-12-17 06:44:33,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:44:33,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303918573] [2021-12-17 06:44:33,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:44:33,898 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:44:33,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:44:33,899 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-17 06:44:33,901 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-17 06:44:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:44:34,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 06:44:34,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:44:34,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:44:34,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 06:44:34,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:44:34,304 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:44:34,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303918573] [2021-12-17 06:44:34,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303918573] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 06:44:34,304 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 06:44:34,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-17 06:44:34,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413250052] [2021-12-17 06:44:34,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 06:44:34,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 06:44:34,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:44:34,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 06:44:34,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-17 06:44:34,306 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-17 06:44:36,513 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 06:44:36,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:44:36,598 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2021-12-17 06:44:36,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 06:44:36,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 14 [2021-12-17 06:44:36,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:44:36,600 INFO L225 Difference]: With dead ends: 33 [2021-12-17 06:44:36,600 INFO L226 Difference]: Without dead ends: 25 [2021-12-17 06:44:36,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-12-17 06:44:36,602 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-17 06:44:36,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 37 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-12-17 06:44:36,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-17 06:44:36,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2021-12-17 06:44:36,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-17 06:44:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2021-12-17 06:44:36,609 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2021-12-17 06:44:36,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:44:36,609 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-12-17 06:44:36,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-17 06:44:36,611 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2021-12-17 06:44:36,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-17 06:44:36,612 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:44:36,612 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:44:36,630 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-17 06:44:36,825 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-17 06:44:36,825 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:44:36,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:44:36,826 INFO L85 PathProgramCache]: Analyzing trace with hash -673335440, now seen corresponding path program 1 times [2021-12-17 06:44:36,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:44:36,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655558235] [2021-12-17 06:44:36,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:44:36,826 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:44:36,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:44:36,827 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-17 06:44:36,828 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-17 06:44:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:44:37,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-17 06:44:37,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:44:39,382 INFO L354 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2021-12-17 06:44:39,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 225 treesize of output 109 [2021-12-17 06:45:21,538 WARN L227 SmtUtils]: Spent 14.28s on a formula simplification. DAG size of input: 55 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 06:46:16,463 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (and (= .cse0 .cse1) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse3 .cse2))) (_ +zero 11 53))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (= .cse2 .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32)))))) is different from false [2021-12-17 06:46:18,482 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (and (= .cse0 .cse1) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse3 .cse2))) (_ +zero 11 53))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (= .cse2 .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32)))))) is different from true [2021-12-17 06:46:23,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:46:23,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 06:46:32,987 WARN L838 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) is different from false [2021-12-17 06:46:35,046 WARN L860 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) is different from true [2021-12-17 06:46:46,646 WARN L860 $PredicateComparison]: unable to prove that (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|))) is different from true [2021-12-17 06:46:57,023 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1))))) is different from false [2021-12-17 06:46:59,081 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1))))) is different from true [2021-12-17 06:47:10,705 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse3 (_ bv4 32))))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse3 (_ bv4 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|)))) is different from false [2021-12-17 06:47:12,766 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse3 (_ bv4 32))))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse3 (_ bv4 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|)))) is different from true [2021-12-17 06:47:26,468 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|)) (.cse3 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse6 (select .cse5 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse3 (_ bv4 32))))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse3 (_ bv4 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse4 (select .cse5 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1))))) is different from false [2021-12-17 06:47:28,528 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|)) (.cse3 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse6 (select .cse5 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse3 (_ bv4 32))))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse3 (_ bv4 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse4 (select .cse5 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1))))) is different from true [2021-12-17 06:47:43,094 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse1 (let ((.cse5 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1))))) is different from false [2021-12-17 06:47:45,158 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse1 (let ((.cse5 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1))))) is different from true Killed by 15