./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/inv_Newton-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/inv_Newton-1.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 7c5bb845798e00aa3572bfadf1cd4653d0b05182832339d0260ef999baa89392 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 02:32:38,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 02:32:38,979 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 02:32:39,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 02:32:39,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 02:32:39,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 02:32:39,041 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 02:32:39,043 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 02:32:39,045 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 02:32:39,049 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 02:32:39,050 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 02:32:39,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 02:32:39,052 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 02:32:39,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 02:32:39,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 02:32:39,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 02:32:39,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 02:32:39,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 02:32:39,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 02:32:39,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 02:32:39,067 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 02:32:39,068 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 02:32:39,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 02:32:39,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 02:32:39,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 02:32:39,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 02:32:39,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 02:32:39,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 02:32:39,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 02:32:39,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 02:32:39,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 02:32:39,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 02:32:39,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 02:32:39,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 02:32:39,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 02:32:39,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 02:32:39,083 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 02:32:39,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 02:32:39,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 02:32:39,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 02:32:39,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 02:32:39,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 02:32:39,089 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 02:32:39,114 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 02:32:39,115 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 02:32:39,115 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 02:32:39,116 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 02:32:39,116 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 02:32:39,117 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 02:32:39,117 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 02:32:39,117 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 02:32:39,118 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 02:32:39,119 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 02:32:39,119 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 02:32:39,119 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 02:32:39,119 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 02:32:39,119 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 02:32:39,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 02:32:39,120 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 02:32:39,120 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 02:32:39,120 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 02:32:39,120 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 02:32:39,120 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 02:32:39,121 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 02:32:39,121 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 02:32:39,121 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 02:32:39,121 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 02:32:39,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:32:39,122 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 02:32:39,122 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 02:32:39,122 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 02:32:39,122 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 02:32:39,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 02:32:39,123 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 02:32:39,123 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 02:32:39,123 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 02:32:39,123 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 -> 7c5bb845798e00aa3572bfadf1cd4653d0b05182832339d0260ef999baa89392 [2022-07-12 02:32:39,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 02:32:39,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 02:32:39,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 02:32:39,374 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 02:32:39,375 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 02:32:39,376 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_Newton-1.c [2022-07-12 02:32:39,434 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74cc288c6/3106840ef86a4683ab42e4dce48a53c2/FLAGf93c576d0 [2022-07-12 02:32:39,787 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 02:32:39,788 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton-1.c [2022-07-12 02:32:39,793 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74cc288c6/3106840ef86a4683ab42e4dce48a53c2/FLAGf93c576d0 [2022-07-12 02:32:40,194 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74cc288c6/3106840ef86a4683ab42e4dce48a53c2 [2022-07-12 02:32:40,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 02:32:40,199 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 02:32:40,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 02:32:40,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 02:32:40,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 02:32:40,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:32:40" (1/1) ... [2022-07-12 02:32:40,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7992ddb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:40, skipping insertion in model container [2022-07-12 02:32:40,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:32:40" (1/1) ... [2022-07-12 02:32:40,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 02:32:40,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 02:32:40,364 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/inv_Newton-1.c[598,611] [2022-07-12 02:32:40,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:32:40,406 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 02:32:40,421 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/inv_Newton-1.c[598,611] [2022-07-12 02:32:40,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:32:40,466 INFO L208 MainTranslator]: Completed translation [2022-07-12 02:32:40,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:40 WrapperNode [2022-07-12 02:32:40,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 02:32:40,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 02:32:40,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 02:32:40,469 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 02:32:40,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:40" (1/1) ... [2022-07-12 02:32:40,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:40" (1/1) ... [2022-07-12 02:32:40,511 INFO L137 Inliner]: procedures = 18, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 66 [2022-07-12 02:32:40,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 02:32:40,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 02:32:40,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 02:32:40,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 02:32:40,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:40" (1/1) ... [2022-07-12 02:32:40,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:40" (1/1) ... [2022-07-12 02:32:40,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:40" (1/1) ... [2022-07-12 02:32:40,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:40" (1/1) ... [2022-07-12 02:32:40,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:40" (1/1) ... [2022-07-12 02:32:40,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:40" (1/1) ... [2022-07-12 02:32:40,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:40" (1/1) ... [2022-07-12 02:32:40,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 02:32:40,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 02:32:40,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 02:32:40,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 02:32:40,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:40" (1/1) ... [2022-07-12 02:32:40,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:32:40,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 02:32:40,591 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 02:32:40,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 02:32:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 02:32:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 02:32:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 02:32:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-12 02:32:40,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 02:32:40,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-12 02:32:40,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 02:32:40,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 02:32:40,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 02:32:40,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 02:32:40,677 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 02:32:40,678 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 02:32:40,798 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 02:32:40,802 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 02:32:40,803 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 02:32:40,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:32:40 BoogieIcfgContainer [2022-07-12 02:32:40,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 02:32:40,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 02:32:40,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 02:32:40,811 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 02:32:40,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 02:32:40" (1/3) ... [2022-07-12 02:32:40,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770423f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:32:40, skipping insertion in model container [2022-07-12 02:32:40,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:40" (2/3) ... [2022-07-12 02:32:40,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770423f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:32:40, skipping insertion in model container [2022-07-12 02:32:40,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:32:40" (3/3) ... [2022-07-12 02:32:40,814 INFO L111 eAbstractionObserver]: Analyzing ICFG inv_Newton-1.c [2022-07-12 02:32:40,829 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 02:32:40,830 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 02:32:40,870 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 02:32:40,877 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1d15a7aa, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@489a4498 [2022-07-12 02:32:40,878 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 02:32:40,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:32:40,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 02:32:40,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:32:40,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:32:40,888 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:32:40,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:32:40,892 INFO L85 PathProgramCache]: Analyzing trace with hash -590190995, now seen corresponding path program 1 times [2022-07-12 02:32:40,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 02:32:40,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177075471] [2022-07-12 02:32:40,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:32:40,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 02:32:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:32:41,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:32:41,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 02:32:41,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177075471] [2022-07-12 02:32:41,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177075471] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:32:41,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:32:41,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 02:32:41,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657144259] [2022-07-12 02:32:41,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:32:41,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 02:32:41,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 02:32:41,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 02:32:41,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:32:41,090 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:32:41,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:32:41,102 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-07-12 02:32:41,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 02:32:41,104 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-07-12 02:32:41,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:32:41,110 INFO L225 Difference]: With dead ends: 25 [2022-07-12 02:32:41,110 INFO L226 Difference]: Without dead ends: 10 [2022-07-12 02:32:41,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:32:41,118 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:32:41,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 02:32:41,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-07-12 02:32:41,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-07-12 02:32:41,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:32:41,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-07-12 02:32:41,147 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 9 [2022-07-12 02:32:41,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:32:41,147 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-07-12 02:32:41,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:32:41,148 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-07-12 02:32:41,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 02:32:41,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:32:41,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:32:41,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 02:32:41,149 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:32:41,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:32:41,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1184816367, now seen corresponding path program 1 times [2022-07-12 02:32:41,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 02:32:41,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321816524] [2022-07-12 02:32:41,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:32:41,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 02:32:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:32:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:32:41,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 02:32:41,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321816524] [2022-07-12 02:32:41,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321816524] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:32:41,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:32:41,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 02:32:41,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769954087] [2022-07-12 02:32:41,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:32:41,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 02:32:41,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 02:32:41,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 02:32:41,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 02:32:41,329 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:32:41,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:32:41,343 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-07-12 02:32:41,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 02:32:41,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-07-12 02:32:41,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:32:41,348 INFO L225 Difference]: With dead ends: 16 [2022-07-12 02:32:41,348 INFO L226 Difference]: Without dead ends: 11 [2022-07-12 02:32:41,348 INFO L412 NwaCegarLoop]: 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 [2022-07-12 02:32:41,350 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 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 [2022-07-12 02:32:41,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 02:32:41,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-07-12 02:32:41,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-07-12 02:32:41,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:32:41,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-07-12 02:32:41,357 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2022-07-12 02:32:41,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:32:41,358 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-07-12 02:32:41,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:32:41,359 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-07-12 02:32:41,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 02:32:41,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:32:41,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:32:41,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 02:32:41,361 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:32:41,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:32:41,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1873743609, now seen corresponding path program 1 times [2022-07-12 02:32:41,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 02:32:41,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990875374] [2022-07-12 02:32:41,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:32:41,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 02:32:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 02:32:41,452 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 02:32:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 02:32:41,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 02:32:41,506 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 02:32:41,506 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 02:32:41,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 02:32:41,510 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-12 02:32:41,513 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 02:32:41,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 02:32:41 BoogieIcfgContainer [2022-07-12 02:32:41,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 02:32:41,536 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 02:32:41,536 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 02:32:41,536 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 02:32:41,537 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:32:40" (3/4) ... [2022-07-12 02:32:41,539 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 02:32:41,539 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 02:32:41,539 INFO L158 Benchmark]: Toolchain (without parser) took 1340.82ms. Allocated memory was 111.1MB in the beginning and 142.6MB in the end (delta: 31.5MB). Free memory was 82.3MB in the beginning and 104.4MB in the end (delta: -22.2MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2022-07-12 02:32:41,540 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 111.1MB. Free memory is still 67.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:32:41,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.12ms. Allocated memory was 111.1MB in the beginning and 142.6MB in the end (delta: 31.5MB). Free memory was 82.3MB in the beginning and 116.7MB in the end (delta: -34.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 02:32:41,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.54ms. Allocated memory is still 142.6MB. Free memory was 116.7MB in the beginning and 114.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:32:41,541 INFO L158 Benchmark]: Boogie Preprocessor took 45.14ms. Allocated memory is still 142.6MB. Free memory was 114.9MB in the beginning and 113.8MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 02:32:41,541 INFO L158 Benchmark]: RCFGBuilder took 245.53ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 102.5MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 02:32:41,542 INFO L158 Benchmark]: TraceAbstraction took 729.79ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 105.0MB in the end (delta: -3.1MB). Peak memory consumption was 507.9kB. Max. memory is 16.1GB. [2022-07-12 02:32:41,542 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 142.6MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:32:41,544 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.18ms. Allocated memory is still 111.1MB. Free memory is still 67.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.12ms. Allocated memory was 111.1MB in the beginning and 142.6MB in the end (delta: 31.5MB). Free memory was 82.3MB in the beginning and 116.7MB in the end (delta: -34.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.54ms. Allocated memory is still 142.6MB. Free memory was 116.7MB in the beginning and 114.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.14ms. Allocated memory is still 142.6MB. Free memory was 114.9MB in the beginning and 113.8MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 245.53ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 102.5MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 729.79ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 105.0MB in the end (delta: -3.1MB). Peak memory consumption was 507.9kB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 142.6MB. Free memory is still 104.4MB. 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: 16]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 30, overapproximation of someBinaryArithmeticDOUBLEoperation at line 36, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of to_real at line 31. Possible FailurePath: [L46] double a,r; [L48] a = __VERIFIER_nondet_double() [L49] CALL assume_abort_if_not(a >= 20. && a <= 30.) [L14] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L49] RET assume_abort_if_not(a >= 20. && a <= 30.) [L51] CALL, EXPR inv(a) [L26] double xi, xsi, temp; [L27] signed int cond, exp; [L28] union double_int A_u, xi_u; [L29] A_u.d = A [L30] EXPR A_u.i [L30] exp = (signed int) ((A_u.i & 0x7FF0000000000000) >> 52) - 1023 [L31] xi_u.d = 1 [L32] xi_u.i = (((long long)(1023-exp)) << 52) [L33] EXPR xi_u.d [L33] xi = xi_u.d [L34] cond = 1 VAL [\old(A)=9214364837600034821, A=9214364837600034821, A_u={4:0}, cond=1, exp=-1023, xi=9214364837600034820, xi_u={5:0}] [L35] COND TRUE \read(cond) [L36] xsi = 2*xi-A*xi*xi [L37] temp = xsi-xi [L38] cond = ((temp > 1e-10) || (temp < -1e-10)) [L39] xi = xsi VAL [\old(A)=9214364837600034821, A=9214364837600034821, A_u={4:0}, cond=0, exp=-1023, xi=9214364837600034817, xi_u={5:0}, xsi=9214364837600034817] [L35] COND FALSE !(\read(cond)) VAL [\old(A)=9214364837600034821, A=9214364837600034821, A_u={4:0}, cond=0, exp=-1023, xi=9214364837600034817, xi_u={5:0}, xsi=9214364837600034817] [L41] return xi; [L41] return xi; [L41] return xi; VAL [\old(A)=9214364837600034821, \result=9214364837600034817, A=9214364837600034821, cond=0, exp=-1023, xi=9214364837600034817, xsi=9214364837600034817] [L51] RET, EXPR inv(a) [L51] r = inv(a) [L53] CALL __VERIFIER_assert(r >= 0 && r <= 0.06) [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 23 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 18 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 [2022-07-12 02:32:41,570 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/inv_Newton-1.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 7c5bb845798e00aa3572bfadf1cd4653d0b05182832339d0260ef999baa89392 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 02:32:43,372 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 02:32:43,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 02:32:43,400 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 02:32:43,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 02:32:43,402 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 02:32:43,404 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 02:32:43,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 02:32:43,408 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 02:32:43,412 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 02:32:43,413 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 02:32:43,414 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 02:32:43,414 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 02:32:43,416 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 02:32:43,417 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 02:32:43,422 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 02:32:43,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 02:32:43,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 02:32:43,425 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 02:32:43,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 02:32:43,431 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 02:32:43,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 02:32:43,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 02:32:43,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 02:32:43,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 02:32:43,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 02:32:43,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 02:32:43,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 02:32:43,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 02:32:43,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 02:32:43,441 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 02:32:43,441 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 02:32:43,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 02:32:43,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 02:32:43,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 02:32:43,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 02:32:43,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 02:32:43,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 02:32:43,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 02:32:43,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 02:32:43,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 02:32:43,447 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 02:32:43,451 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 02:32:43,488 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 02:32:43,489 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 02:32:43,489 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 02:32:43,489 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 02:32:43,490 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 02:32:43,490 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 02:32:43,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 02:32:43,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 02:32:43,490 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 02:32:43,491 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 02:32:43,491 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 02:32:43,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 02:32:43,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 02:32:43,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 02:32:43,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 02:32:43,495 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 02:32:43,496 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 02:32:43,496 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 02:32:43,496 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 02:32:43,496 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 02:32:43,496 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 02:32:43,496 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 02:32:43,496 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 02:32:43,497 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 02:32:43,497 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 02:32:43,497 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 02:32:43,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:32:43,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 02:32:43,497 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 02:32:43,498 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 02:32:43,498 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 02:32:43,498 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 02:32:43,498 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 02:32:43,498 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 02:32:43,499 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 02:32:43,499 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 02:32:43,499 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 -> 7c5bb845798e00aa3572bfadf1cd4653d0b05182832339d0260ef999baa89392 [2022-07-12 02:32:43,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 02:32:43,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 02:32:43,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 02:32:43,783 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 02:32:43,783 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 02:32:43,784 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_Newton-1.c [2022-07-12 02:32:43,837 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4997f4e1a/4529ff13b903413db62bd4693da08454/FLAG9d02c1a2b [2022-07-12 02:32:44,186 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 02:32:44,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton-1.c [2022-07-12 02:32:44,192 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4997f4e1a/4529ff13b903413db62bd4693da08454/FLAG9d02c1a2b [2022-07-12 02:32:44,617 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4997f4e1a/4529ff13b903413db62bd4693da08454 [2022-07-12 02:32:44,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 02:32:44,621 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 02:32:44,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 02:32:44,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 02:32:44,629 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 02:32:44,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:32:44" (1/1) ... [2022-07-12 02:32:44,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@702461fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:44, skipping insertion in model container [2022-07-12 02:32:44,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:32:44" (1/1) ... [2022-07-12 02:32:44,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 02:32:44,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 02:32:44,765 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/inv_Newton-1.c[598,611] [2022-07-12 02:32:44,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:32:44,792 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 02:32:44,813 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/inv_Newton-1.c[598,611] [2022-07-12 02:32:44,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:32:44,852 INFO L208 MainTranslator]: Completed translation [2022-07-12 02:32:44,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:44 WrapperNode [2022-07-12 02:32:44,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 02:32:44,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 02:32:44,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 02:32:44,854 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 02:32:44,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:44" (1/1) ... [2022-07-12 02:32:44,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:44" (1/1) ... [2022-07-12 02:32:44,893 INFO L137 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2022-07-12 02:32:44,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 02:32:44,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 02:32:44,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 02:32:44,894 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 02:32:44,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:44" (1/1) ... [2022-07-12 02:32:44,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:44" (1/1) ... [2022-07-12 02:32:44,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:44" (1/1) ... [2022-07-12 02:32:44,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:44" (1/1) ... [2022-07-12 02:32:44,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:44" (1/1) ... [2022-07-12 02:32:44,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:44" (1/1) ... [2022-07-12 02:32:44,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:44" (1/1) ... [2022-07-12 02:32:44,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 02:32:44,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 02:32:44,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 02:32:44,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 02:32:44,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:44" (1/1) ... [2022-07-12 02:32:44,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:32:44,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 02:32:44,963 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 02:32:44,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 02:32:45,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 02:32:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-07-12 02:32:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-12 02:32:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 02:32:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 02:32:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-12 02:32:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 02:32:45,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 02:32:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-07-12 02:32:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 02:32:45,060 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 02:32:45,061 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 02:32:47,435 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 02:32:47,440 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 02:32:47,441 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 02:32:47,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:32:47 BoogieIcfgContainer [2022-07-12 02:32:47,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 02:32:47,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 02:32:47,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 02:32:47,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 02:32:47,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 02:32:44" (1/3) ... [2022-07-12 02:32:47,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7fda1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:32:47, skipping insertion in model container [2022-07-12 02:32:47,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:32:44" (2/3) ... [2022-07-12 02:32:47,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7fda1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:32:47, skipping insertion in model container [2022-07-12 02:32:47,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:32:47" (3/3) ... [2022-07-12 02:32:47,466 INFO L111 eAbstractionObserver]: Analyzing ICFG inv_Newton-1.c [2022-07-12 02:32:47,479 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 02:32:47,483 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 02:32:47,540 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 02:32:47,547 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@530ca77f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7c84dacb [2022-07-12 02:32:47,547 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 02:32:47,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:32:47,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 02:32:47,556 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:32:47,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:32:47,557 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:32:47,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:32:47,562 INFO L85 PathProgramCache]: Analyzing trace with hash -590190995, now seen corresponding path program 1 times [2022-07-12 02:32:47,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:32:47,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930512677] [2022-07-12 02:32:47,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:32:47,579 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:32:47,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:32:47,581 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:32:47,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 02:32:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:32:47,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 02:32:47,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:32:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:32:47,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:32:47,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:32:47,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930512677] [2022-07-12 02:32:47,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930512677] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:32:47,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:32:47,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 02:32:47,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417926259] [2022-07-12 02:32:47,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:32:47,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 02:32:47,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:32:47,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 02:32:47,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:32:47,775 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:32:47,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:32:47,786 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-07-12 02:32:47,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 02:32:47,788 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-07-12 02:32:47,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:32:47,793 INFO L225 Difference]: With dead ends: 25 [2022-07-12 02:32:47,794 INFO L226 Difference]: Without dead ends: 10 [2022-07-12 02:32:47,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:32:47,800 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:32:47,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 02:32:47,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-07-12 02:32:47,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-07-12 02:32:47,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:32:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-07-12 02:32:47,830 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 9 [2022-07-12 02:32:47,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:32:47,831 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-07-12 02:32:47,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:32:47,831 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-07-12 02:32:47,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 02:32:47,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:32:47,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:32:47,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 02:32:48,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:32:48,043 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:32:48,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:32:48,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1184816367, now seen corresponding path program 1 times [2022-07-12 02:32:48,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:32:48,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914161404] [2022-07-12 02:32:48,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:32:48,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:32:48,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:32:48,049 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:32:48,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 02:32:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:32:48,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 02:32:48,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:32:48,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:32:48,180 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:32:48,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:32:48,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914161404] [2022-07-12 02:32:48,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914161404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:32:48,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:32:48,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 02:32:48,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815250887] [2022-07-12 02:32:48,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:32:48,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 02:32:48,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:32:48,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 02:32:48,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 02:32:48,183 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:32:50,409 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 02:32:50,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:32:50,516 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-07-12 02:32:50,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 02:32:50,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-07-12 02:32:50,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:32:50,517 INFO L225 Difference]: With dead ends: 16 [2022-07-12 02:32:50,517 INFO L226 Difference]: Without dead ends: 11 [2022-07-12 02:32:50,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 02:32:50,518 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-12 02:32:50,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-12 02:32:50,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-07-12 02:32:50,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-07-12 02:32:50,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:32:50,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-07-12 02:32:50,521 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2022-07-12 02:32:50,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:32:50,521 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-07-12 02:32:50,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:32:50,522 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-07-12 02:32:50,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 02:32:50,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:32:50,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:32:50,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 02:32:50,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:32:50,723 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:32:50,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:32:50,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1873743609, now seen corresponding path program 1 times [2022-07-12 02:32:50,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:32:50,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276535714] [2022-07-12 02:32:50,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:32:50,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:32:50,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:32:50,726 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:32:50,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 02:32:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:32:52,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-12 02:32:52,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:34:03,736 WARN L833 $PredicateComparison]: unable to prove that (and (or (and (exists ((v_ArrVal_53 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse3)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0))) (.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (not (fp.gt .cse0 .cse1)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse3)) |c_ULTIMATE.start_inv_~xi~0#1|))))) (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv0 32))) (and (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse7 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (exists ((v_ArrVal_53 (_ BitVec 32)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse5 (let ((.cse6 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (and (fp.gt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse5) ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0))) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse5) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) .cse5) .cse5)) |c_ULTIMATE.start_inv_~xi~0#1|)))) (fp.geq .cse7 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq .cse7 ((_ to_fp 11 53) c_currentRoundingMode 30.0))))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse10 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (exists ((v_ArrVal_53 (_ BitVec 32)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse8 (let ((.cse9 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (and (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse8) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse8) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) .cse8) .cse8)) |c_ULTIMATE.start_inv_~xi~0#1|)))) (fp.geq .cse10 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq .cse10 ((_ to_fp 11 53) c_currentRoundingMode 30.0)))))) (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv1 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-12 02:34:27,502 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_53 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse3)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0))) (.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (not (fp.gt .cse0 .cse1)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse3)) |c_ULTIMATE.start_inv_~xi~0#1|))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-12 02:34:51,251 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_53 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_#res#1| .cse3)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0))) (.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse3)) |c_ULTIMATE.start_inv_#res#1|))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-12 02:36:36,017 WARN L833 $PredicateComparison]: unable to prove that (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((v_ArrVal_53 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|))) (.cse4 (let ((.cse5 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse4) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse4)))) (let ((.cse2 (fp.sub roundNearestTiesToEven .cse0 .cse4)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (and (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (not (fp.gt .cse2 .cse3)) (not (fp.lt .cse2 (fp.neg .cse3))) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)))))))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (exists ((v_ArrVal_53 (_ BitVec 32)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse10 (let ((.cse11 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse11) ((_ extract 62 52) .cse11) ((_ extract 51 0) .cse11))))) (let ((.cse9 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse10) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) .cse10) .cse10)))) (let ((.cse7 (fp.sub roundNearestTiesToEven .cse9 .cse10)) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (and (not (fp.gt .cse7 .cse8)) (not (fp.lt .cse7 (fp.neg .cse8))) (not (fp.leq .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))))))))) (fp.leq .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse12 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse12 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (exists ((v_ArrVal_53 (_ BitVec 32)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse16 (let ((.cse17 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse17) ((_ extract 62 52) .cse17) ((_ extract 51 0) .cse17))))) (let ((.cse15 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse16) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) .cse16) .cse16)))) (let ((.cse13 (fp.sub roundNearestTiesToEven .cse15 .cse16)) (.cse14 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (and (not (fp.gt .cse13 .cse14)) (not (fp.lt .cse13 (fp.neg .cse14))) (not (fp.geq .cse15 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))))))))) (fp.leq .cse12 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)))))))) is different from false [2022-07-12 02:37:07,464 WARN L833 $PredicateComparison]: unable to prove that (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (exists ((v_ArrVal_53 (_ BitVec 32)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse4 (let ((.cse5 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse4) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) .cse4) .cse4)))) (let ((.cse1 (fp.sub roundNearestTiesToEven .cse3 .cse4)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (and (not (fp.gt .cse1 .cse2)) (not (fp.lt .cse1 (fp.neg .cse2))) (not (fp.leq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))))))))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (exists ((v_ArrVal_53 (_ BitVec 32)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse8 (let ((.cse9 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (let ((.cse7 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse8) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) .cse8) .cse8)))) (and (not (fp.lt (fp.sub roundNearestTiesToEven .cse7 .cse8) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0))))) (not (fp.geq .cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) (fp.leq .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)))))) is different from false [2022-07-12 02:37:09,591 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (exists ((v_ArrVal_53 (_ BitVec 32)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse4 (let ((.cse5 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse4) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) .cse4) .cse4)))) (let ((.cse1 (fp.sub roundNearestTiesToEven .cse3 .cse4)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (and (not (fp.gt .cse1 .cse2)) (not (fp.lt .cse1 (fp.neg .cse2))) (not (fp.leq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))))))))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (exists ((v_ArrVal_53 (_ BitVec 32)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse8 (let ((.cse9 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (let ((.cse7 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse8) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) .cse8) .cse8)))) (and (not (fp.lt (fp.sub roundNearestTiesToEven .cse7 .cse8) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0))))) (not (fp.geq .cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) (fp.leq .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)))))) is different from true [2022-07-12 02:37:09,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-12 02:37:09,592 INFO L328 TraceCheckSpWp]: Computing backward predicates...