./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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.c.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 13:42:03,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 13:42:03,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 13:42:03,167 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 13:42:03,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 13:42:03,169 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 13:42:03,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 13:42:03,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 13:42:03,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 13:42:03,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 13:42:03,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 13:42:03,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 13:42:03,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 13:42:03,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 13:42:03,185 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 13:42:03,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 13:42:03,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 13:42:03,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 13:42:03,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 13:42:03,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 13:42:03,198 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 13:42:03,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 13:42:03,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 13:42:03,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 13:42:03,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 13:42:03,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 13:42:03,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 13:42:03,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 13:42:03,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 13:42:03,211 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 13:42:03,212 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 13:42:03,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 13:42:03,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 13:42:03,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 13:42:03,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 13:42:03,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 13:42:03,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 13:42:03,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 13:42:03,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 13:42:03,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 13:42:03,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 13:42:03,220 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 13:42:03,221 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 13:42:03,250 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 13:42:03,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 13:42:03,251 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 13:42:03,252 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 13:42:03,252 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 13:42:03,252 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 13:42:03,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 13:42:03,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 13:42:03,253 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 13:42:03,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 13:42:03,254 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 13:42:03,255 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 13:42:03,255 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 13:42:03,255 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 13:42:03,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 13:42:03,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 13:42:03,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 13:42:03,256 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 13:42:03,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 13:42:03,256 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 13:42:03,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 13:42:03,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 13:42:03,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 13:42:03,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 13:42:03,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 13:42:03,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 13:42:03,258 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 13:42:03,258 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 13:42:03,258 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 13:42:03,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 13:42:03,259 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 13:42:03,259 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 13:42:03,259 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 13:42:03,259 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 -> f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 [2022-07-19 13:42:03,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 13:42:03,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 13:42:03,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 13:42:03,539 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 13:42:03,539 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 13:42:03,540 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2022-07-19 13:42:03,603 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ae197fbc/69534668505f4657a1b40a5b545b40b3/FLAG8dae197b2 [2022-07-19 13:42:04,062 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 13:42:04,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2022-07-19 13:42:04,068 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ae197fbc/69534668505f4657a1b40a5b545b40b3/FLAG8dae197b2 [2022-07-19 13:42:04,455 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ae197fbc/69534668505f4657a1b40a5b545b40b3 [2022-07-19 13:42:04,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 13:42:04,458 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 13:42:04,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 13:42:04,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 13:42:04,462 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 13:42:04,463 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 01:42:04" (1/1) ... [2022-07-19 13:42:04,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f2cbc36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:04, skipping insertion in model container [2022-07-19 13:42:04,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 01:42:04" (1/1) ... [2022-07-19 13:42:04,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 13:42:04,484 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 13:42:04,629 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.c.p+cfa-reducer.c[2006,2019] [2022-07-19 13:42:04,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 13:42:04,640 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 13:42:04,659 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.c.p+cfa-reducer.c[2006,2019] [2022-07-19 13:42:04,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 13:42:04,672 INFO L208 MainTranslator]: Completed translation [2022-07-19 13:42:04,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:04 WrapperNode [2022-07-19 13:42:04,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 13:42:04,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 13:42:04,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 13:42:04,674 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 13:42:04,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:04" (1/1) ... [2022-07-19 13:42:04,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:04" (1/1) ... [2022-07-19 13:42:04,702 INFO L137 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 98 [2022-07-19 13:42:04,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 13:42:04,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 13:42:04,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 13:42:04,704 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 13:42:04,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:04" (1/1) ... [2022-07-19 13:42:04,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:04" (1/1) ... [2022-07-19 13:42:04,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:04" (1/1) ... [2022-07-19 13:42:04,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:04" (1/1) ... [2022-07-19 13:42:04,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:04" (1/1) ... [2022-07-19 13:42:04,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:04" (1/1) ... [2022-07-19 13:42:04,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:04" (1/1) ... [2022-07-19 13:42:04,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 13:42:04,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 13:42:04,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 13:42:04,724 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 13:42:04,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:04" (1/1) ... [2022-07-19 13:42:04,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 13:42:04,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 13:42:04,753 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-19 13:42:04,759 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-19 13:42:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 13:42:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 13:42:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 13:42:04,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-19 13:42:04,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 13:42:04,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-19 13:42:04,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 13:42:04,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 13:42:04,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 13:42:04,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 13:42:04,846 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 13:42:04,847 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 13:42:05,015 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 13:42:05,020 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 13:42:05,020 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 13:42:05,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:42:05 BoogieIcfgContainer [2022-07-19 13:42:05,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 13:42:05,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 13:42:05,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 13:42:05,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 13:42:05,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 01:42:04" (1/3) ... [2022-07-19 13:42:05,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16372938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 01:42:05, skipping insertion in model container [2022-07-19 13:42:05,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:04" (2/3) ... [2022-07-19 13:42:05,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16372938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 01:42:05, skipping insertion in model container [2022-07-19 13:42:05,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:42:05" (3/3) ... [2022-07-19 13:42:05,029 INFO L111 eAbstractionObserver]: Analyzing ICFG inv_Newton.c.p+cfa-reducer.c [2022-07-19 13:42:05,042 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 13:42:05,042 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 13:42:05,115 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 13:42:05,124 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@453bf99f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6c42ffe6 [2022-07-19 13:42:05,125 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 13:42:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 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-19 13:42:05,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 13:42:05,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:42:05,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:42:05,144 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:42:05,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:42:05,151 INFO L85 PathProgramCache]: Analyzing trace with hash -938930996, now seen corresponding path program 1 times [2022-07-19 13:42:05,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 13:42:05,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013665186] [2022-07-19 13:42:05,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:42:05,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 13:42:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:42:05,404 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-19 13:42:05,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 13:42:05,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013665186] [2022-07-19 13:42:05,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013665186] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:42:05,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:42:05,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 13:42:05,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75662553] [2022-07-19 13:42:05,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:42:05,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 13:42:05,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 13:42:05,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 13:42:05,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 13:42:05,444 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 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 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-19 13:42:05,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:42:05,495 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2022-07-19 13:42:05,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 13:42:05,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-19 13:42:05,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:42:05,504 INFO L225 Difference]: With dead ends: 49 [2022-07-19 13:42:05,505 INFO L226 Difference]: Without dead ends: 33 [2022-07-19 13:42:05,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 13:42:05,515 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 33 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:42:05,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 70 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 13:42:05,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-19 13:42:05,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 19. [2022-07-19 13:42:05,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:42:05,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-07-19 13:42:05,565 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2022-07-19 13:42:05,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:42:05,565 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-07-19 13:42:05,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-19 13:42:05,566 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-07-19 13:42:05,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-19 13:42:05,567 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:42:05,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:42:05,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 13:42:05,568 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:42:05,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:42:05,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1250925041, now seen corresponding path program 1 times [2022-07-19 13:42:05,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 13:42:05,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335795934] [2022-07-19 13:42:05,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:42:05,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 13:42:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:42:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:42:05,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 13:42:05,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335795934] [2022-07-19 13:42:05,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335795934] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:42:05,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:42:05,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 13:42:05,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343966707] [2022-07-19 13:42:05,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:42:05,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 13:42:05,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 13:42:05,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 13:42:05,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 13:42:05,664 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:42:05,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:42:05,712 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2022-07-19 13:42:05,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 13:42:05,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-19 13:42:05,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:42:05,714 INFO L225 Difference]: With dead ends: 44 [2022-07-19 13:42:05,714 INFO L226 Difference]: Without dead ends: 37 [2022-07-19 13:42:05,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-19 13:42:05,716 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 30 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:42:05,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 71 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 13:42:05,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-19 13:42:05,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2022-07-19 13:42:05,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:42:05,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-07-19 13:42:05,721 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 15 [2022-07-19 13:42:05,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:42:05,722 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-19 13:42:05,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:42:05,722 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-07-19 13:42:05,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-19 13:42:05,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:42:05,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:42:05,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 13:42:05,724 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:42:05,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:42:05,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1796523982, now seen corresponding path program 1 times [2022-07-19 13:42:05,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 13:42:05,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512079] [2022-07-19 13:42:05,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:42:05,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 13:42:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:42:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 13:42:05,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 13:42:05,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512079] [2022-07-19 13:42:05,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512079] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:42:05,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:42:05,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 13:42:05,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147468583] [2022-07-19 13:42:05,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:42:05,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 13:42:05,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 13:42:05,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 13:42:05,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 13:42:05,773 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:42:05,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:42:05,810 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-07-19 13:42:05,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 13:42:05,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-19 13:42:05,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:42:05,812 INFO L225 Difference]: With dead ends: 41 [2022-07-19 13:42:05,812 INFO L226 Difference]: Without dead ends: 35 [2022-07-19 13:42:05,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-19 13:42:05,814 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 20 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:42:05,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 79 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 13:42:05,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-19 13:42:05,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2022-07-19 13:42:05,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:42:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-07-19 13:42:05,820 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2022-07-19 13:42:05,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:42:05,820 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-07-19 13:42:05,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:42:05,820 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-07-19 13:42:05,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-19 13:42:05,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:42:05,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:42:05,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 13:42:05,822 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:42:05,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:42:05,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1813534643, now seen corresponding path program 1 times [2022-07-19 13:42:05,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 13:42:05,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552766008] [2022-07-19 13:42:05,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:42:05,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 13:42:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 13:42:05,844 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 13:42:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 13:42:05,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 13:42:05,876 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 13:42:05,877 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 13:42:05,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 13:42:05,882 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-07-19 13:42:05,885 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 13:42:05,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 01:42:05 BoogieIcfgContainer [2022-07-19 13:42:05,915 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 13:42:05,916 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 13:42:05,916 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 13:42:05,916 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 13:42:05,917 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:42:05" (3/4) ... [2022-07-19 13:42:05,919 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-19 13:42:05,920 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 13:42:05,920 INFO L158 Benchmark]: Toolchain (without parser) took 1462.05ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 89.6MB in the beginning and 97.2MB in the end (delta: -7.6MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2022-07-19 13:42:05,921 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 81.8MB. Free memory was 41.0MB in the beginning and 40.9MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 13:42:05,921 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.56ms. Allocated memory is still 119.5MB. Free memory was 89.6MB in the beginning and 93.0MB in the end (delta: -3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 13:42:05,922 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.46ms. Allocated memory is still 119.5MB. Free memory was 93.0MB in the beginning and 91.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 13:42:05,922 INFO L158 Benchmark]: Boogie Preprocessor took 19.32ms. Allocated memory is still 119.5MB. Free memory was 91.6MB in the beginning and 90.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 13:42:05,923 INFO L158 Benchmark]: RCFGBuilder took 298.36ms. Allocated memory is still 119.5MB. Free memory was 90.2MB in the beginning and 79.0MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 13:42:05,923 INFO L158 Benchmark]: TraceAbstraction took 892.07ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 78.3MB in the beginning and 98.0MB in the end (delta: -19.7MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2022-07-19 13:42:05,924 INFO L158 Benchmark]: Witness Printer took 3.68ms. Allocated memory is still 144.7MB. Free memory was 98.0MB in the beginning and 97.2MB in the end (delta: 767.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 13:42:05,926 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.19ms. Allocated memory is still 81.8MB. Free memory was 41.0MB in the beginning and 40.9MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.56ms. Allocated memory is still 119.5MB. Free memory was 89.6MB in the beginning and 93.0MB in the end (delta: -3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.46ms. Allocated memory is still 119.5MB. Free memory was 93.0MB in the beginning and 91.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.32ms. Allocated memory is still 119.5MB. Free memory was 91.6MB in the beginning and 90.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 298.36ms. Allocated memory is still 119.5MB. Free memory was 90.2MB in the beginning and 79.0MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 892.07ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 78.3MB in the beginning and 98.0MB in the end (delta: -19.7MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Witness Printer took 3.68ms. Allocated memory is still 144.7MB. Free memory was 98.0MB in the beginning and 97.2MB in the end (delta: 767.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 96]: 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 45, overapproximation of someBinaryArithmeticDOUBLEoperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of to_real at line 46. Possible FailurePath: [L1] int __return_main; [L17] double __return_104; VAL [__return_104=0, __return_main=0] [L20] double main__a; [L21] double main__r; [L22] main__a = __VERIFIER_nondet_double() [L23] int main____CPAchecker_TMP_0; VAL [__return_104=0, __return_main=0] [L24] COND TRUE main__a >= 20.0 VAL [__return_104=0, __return_main=0] [L26] COND TRUE main__a <= 30.0 [L28] main____CPAchecker_TMP_0 = 1 VAL [__return_104=0, __return_main=0, main____CPAchecker_TMP_0=1] [L30] COND TRUE main____CPAchecker_TMP_0 != 0 [L33] double __tmp_1; [L34] __tmp_1 = main__a [L35] double inv__A; [L36] inv__A = __tmp_1 [L37] double inv__xi; [L38] double inv__xsi; [L39] double inv__temp; [L40] signed int inv__cond; [L41] signed int inv__exp; [L42] union double_int inv__A_u; [L43] union double_int inv__xi_u; [L44] inv__A_u.d = inv__A [L45] EXPR inv__A_u.i [L45] inv__exp = ((signed int)(((inv__A_u.i) & 2146435072) >> 20)) - 1023 [L46] inv__xi_u.d = 1 [L47] inv__xi_u.i = (1023 - inv__exp) << 20 [L48] EXPR inv__xi_u.d [L48] inv__xi = inv__xi_u.d [L49] inv__cond = 1 VAL [__return_104=0, __return_main=0, __tmp_1=2145386497, inv__A=2145386497, inv__A_u={4:0}, inv__cond=1, inv__exp=-1023, inv__xi=2145386500, inv__xi_u={5:0}, main____CPAchecker_TMP_0=1, main__a=2145386497] [L51] COND TRUE !(inv__cond == 0) [L53] inv__xsi = (2 * inv__xi) - ((inv__A * inv__xi) * inv__xi) [L54] inv__temp = inv__xsi - inv__xi [L55] int inv____CPAchecker_TMP_0; VAL [__return_104=0, __return_main=0, __tmp_1=2145386497, inv__A=2145386497, inv__A_u={4:0}, inv__cond=1, inv__exp=-1023, inv__xi=2145386500, inv__xi_u={5:0}, main____CPAchecker_TMP_0=1, main__a=2145386497] [L56] COND FALSE !(inv__temp > 1.0E-10) VAL [__return_104=0, __return_main=0, __tmp_1=2145386497, inv__A=2145386497, inv__A_u={4:0}, inv__cond=1, inv__exp=-1023, inv__xi=2145386500, inv__xi_u={5:0}, main____CPAchecker_TMP_0=1, main__a=2145386497] [L67] COND FALSE !(inv__temp < -1.0E-10) [L73] inv____CPAchecker_TMP_0 = 0 VAL [__return_104=0, __return_main=0, __tmp_1=2145386497, inv____CPAchecker_TMP_0=0, inv__A=2145386497, inv__A_u={4:0}, inv__cond=1, inv__exp=-1023, inv__xi=2145386500, inv__xi_u={5:0}, main____CPAchecker_TMP_0=1, main__a=2145386497] [L61] inv__cond = inv____CPAchecker_TMP_0 [L62] inv__xi = inv__xsi VAL [__return_104=0, __return_main=0, __tmp_1=2145386497, inv____CPAchecker_TMP_0=0, inv__A=2145386497, inv__A_u={4:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386499, inv__xi_u={5:0}, inv__xsi=2145386499, main____CPAchecker_TMP_0=1, main__a=2145386497] [L51] COND FALSE !(!(inv__cond == 0)) [L80] __return_104 = inv__xi [L81] main__r = __return_104 [L82] int main____CPAchecker_TMP_1; VAL [__return_104=2145386499, __return_main=0, __tmp_1=2145386497, inv____CPAchecker_TMP_0=0, inv__A=2145386497, inv__A_u={4:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386499, inv__xi_u={5:0}, inv__xsi=2145386499, main____CPAchecker_TMP_0=1, main__a=2145386497, main__r=2145386499] [L83] COND FALSE !(main__r >= 0) VAL [__return_104=2145386499, __return_main=0, __tmp_1=2145386497, inv____CPAchecker_TMP_0=0, inv__A=2145386497, inv__A_u={4:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386499, inv__xi_u={5:0}, inv__xsi=2145386499, main____CPAchecker_TMP_0=1, main__a=2145386497, main__r=2145386499] [L108] main____CPAchecker_TMP_1 = 0 VAL [__return_104=2145386499, __return_main=0, __tmp_1=2145386497, inv____CPAchecker_TMP_0=0, inv__A=2145386497, inv__A_u={4:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386499, inv__xi_u={5:0}, inv__xsi=2145386499, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=2145386497, main__r=2145386499] [L90] int __tmp_2; [L91] __tmp_2 = main____CPAchecker_TMP_1 [L92] int __VERIFIER_assert__cond; [L93] __VERIFIER_assert__cond = __tmp_2 VAL [__return_104=2145386499, __return_main=0, __tmp_1=2145386497, __tmp_2=0, __VERIFIER_assert__cond=0, inv____CPAchecker_TMP_0=0, inv__A=2145386497, inv__A_u={4:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386499, inv__xi_u={5:0}, inv__xsi=2145386499, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=2145386497, main__r=2145386499] [L94] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_104=2145386499, __return_main=0, __tmp_1=2145386497, __tmp_2=0, __VERIFIER_assert__cond=0, inv____CPAchecker_TMP_0=0, inv__A=2145386497, inv__A_u={4:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386499, inv__xi_u={5:0}, inv__xsi=2145386499, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=2145386497, main__r=2145386499] [L96] reach_error() VAL [__return_104=2145386499, __return_main=0, __tmp_1=2145386497, __tmp_2=0, __VERIFIER_assert__cond=0, inv____CPAchecker_TMP_0=0, inv__A=2145386497, inv__A_u={4:0}, inv__cond=0, inv__exp=-1023, inv__xi=2145386499, inv__xi_u={5:0}, inv__xsi=2145386499, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=2145386497, main__r=2145386499] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 83 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 220 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 149 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 71 mSDtfsCounter, 44 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 19, 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, 3 MinimizatonAttempts, 46 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 59 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 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-19 13:42:05,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 13:42:07,922 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 13:42:07,925 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 13:42:07,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 13:42:07,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 13:42:07,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 13:42:07,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 13:42:07,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 13:42:07,975 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 13:42:07,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 13:42:07,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 13:42:07,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 13:42:07,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 13:42:07,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 13:42:07,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 13:42:07,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 13:42:07,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 13:42:07,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 13:42:07,990 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 13:42:07,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 13:42:07,996 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 13:42:07,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 13:42:07,999 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 13:42:07,999 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 13:42:08,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 13:42:08,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 13:42:08,010 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 13:42:08,010 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 13:42:08,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 13:42:08,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 13:42:08,012 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 13:42:08,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 13:42:08,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 13:42:08,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 13:42:08,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 13:42:08,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 13:42:08,017 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 13:42:08,017 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 13:42:08,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 13:42:08,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 13:42:08,018 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 13:42:08,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 13:42:08,025 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 13:42:08,062 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 13:42:08,063 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 13:42:08,063 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 13:42:08,063 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 13:42:08,064 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 13:42:08,064 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 13:42:08,065 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 13:42:08,065 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 13:42:08,065 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 13:42:08,066 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 13:42:08,066 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 13:42:08,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 13:42:08,067 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 13:42:08,067 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 13:42:08,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 13:42:08,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 13:42:08,068 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 13:42:08,068 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 13:42:08,068 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 13:42:08,068 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 13:42:08,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 13:42:08,069 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 13:42:08,069 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 13:42:08,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 13:42:08,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 13:42:08,070 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 13:42:08,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 13:42:08,070 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 13:42:08,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 13:42:08,070 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 13:42:08,071 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 13:42:08,071 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 13:42:08,071 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 13:42:08,071 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 13:42:08,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 13:42:08,072 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 13:42:08,072 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 -> f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 [2022-07-19 13:42:08,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 13:42:08,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 13:42:08,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 13:42:08,402 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 13:42:08,402 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 13:42:08,404 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2022-07-19 13:42:08,460 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/155fd35d9/5e013e189b6240b08c73bca28314a90d/FLAG06339ea70 [2022-07-19 13:42:08,904 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 13:42:08,904 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2022-07-19 13:42:08,911 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/155fd35d9/5e013e189b6240b08c73bca28314a90d/FLAG06339ea70 [2022-07-19 13:42:08,928 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/155fd35d9/5e013e189b6240b08c73bca28314a90d [2022-07-19 13:42:08,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 13:42:08,932 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 13:42:08,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 13:42:08,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 13:42:08,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 13:42:08,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 01:42:08" (1/1) ... [2022-07-19 13:42:08,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aab069d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:08, skipping insertion in model container [2022-07-19 13:42:08,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 01:42:08" (1/1) ... [2022-07-19 13:42:08,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 13:42:08,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 13:42:09,133 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.c.p+cfa-reducer.c[2006,2019] [2022-07-19 13:42:09,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 13:42:09,192 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 13:42:09,229 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.c.p+cfa-reducer.c[2006,2019] [2022-07-19 13:42:09,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 13:42:09,255 INFO L208 MainTranslator]: Completed translation [2022-07-19 13:42:09,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:09 WrapperNode [2022-07-19 13:42:09,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 13:42:09,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 13:42:09,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 13:42:09,260 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 13:42:09,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:09" (1/1) ... [2022-07-19 13:42:09,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:09" (1/1) ... [2022-07-19 13:42:09,307 INFO L137 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 99 [2022-07-19 13:42:09,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 13:42:09,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 13:42:09,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 13:42:09,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 13:42:09,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:09" (1/1) ... [2022-07-19 13:42:09,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:09" (1/1) ... [2022-07-19 13:42:09,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:09" (1/1) ... [2022-07-19 13:42:09,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:09" (1/1) ... [2022-07-19 13:42:09,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:09" (1/1) ... [2022-07-19 13:42:09,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:09" (1/1) ... [2022-07-19 13:42:09,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:09" (1/1) ... [2022-07-19 13:42:09,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 13:42:09,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 13:42:09,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 13:42:09,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 13:42:09,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:09" (1/1) ... [2022-07-19 13:42:09,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 13:42:09,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 13:42:09,385 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-19 13:42:09,397 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-19 13:42:09,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 13:42:09,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-07-19 13:42:09,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-19 13:42:09,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 13:42:09,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 13:42:09,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 13:42:09,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 13:42:09,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 13:42:09,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 13:42:09,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-19 13:42:09,514 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 13:42:09,516 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 13:42:11,927 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 13:42:11,932 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 13:42:11,932 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 13:42:11,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:42:11 BoogieIcfgContainer [2022-07-19 13:42:11,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 13:42:11,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 13:42:11,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 13:42:11,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 13:42:11,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 01:42:08" (1/3) ... [2022-07-19 13:42:11,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dadde00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 01:42:11, skipping insertion in model container [2022-07-19 13:42:11,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:42:09" (2/3) ... [2022-07-19 13:42:11,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dadde00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 01:42:11, skipping insertion in model container [2022-07-19 13:42:11,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:42:11" (3/3) ... [2022-07-19 13:42:11,945 INFO L111 eAbstractionObserver]: Analyzing ICFG inv_Newton.c.p+cfa-reducer.c [2022-07-19 13:42:11,957 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 13:42:11,958 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 13:42:11,998 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 13:42:12,003 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@4acc055c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@66635ec5 [2022-07-19 13:42:12,004 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 13:42:12,007 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 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-19 13:42:12,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 13:42:12,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:42:12,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:42:12,014 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:42:12,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:42:12,019 INFO L85 PathProgramCache]: Analyzing trace with hash -938930996, now seen corresponding path program 1 times [2022-07-19 13:42:12,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:42:12,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399739347] [2022-07-19 13:42:12,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:42:12,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:42:12,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:42:12,055 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-19 13:42:12,057 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-19 13:42:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:42:12,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 13:42:12,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:42:12,256 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-19 13:42:12,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:42:12,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:42:12,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399739347] [2022-07-19 13:42:12,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399739347] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:42:12,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:42:12,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 13:42:12,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588357849] [2022-07-19 13:42:12,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:42:12,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 13:42:12,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:42:12,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 13:42:12,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:42:12,298 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-19 13:42:14,608 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:42:14,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:42:14,734 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-07-19 13:42:14,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 13:42:14,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-19 13:42:14,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:42:14,742 INFO L225 Difference]: With dead ends: 32 [2022-07-19 13:42:14,742 INFO L226 Difference]: Without dead ends: 19 [2022-07-19 13:42:14,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-19 13:42:14,747 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-19 13:42:14,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-19 13:42:14,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-19 13:42:14,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-19 13:42:14,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:42:14,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-07-19 13:42:14,774 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2022-07-19 13:42:14,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:42:14,775 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-07-19 13:42:14,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-19 13:42:14,775 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-07-19 13:42:14,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-19 13:42:14,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:42:14,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:42:14,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-19 13:42:14,987 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-19 13:42:14,987 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:42:14,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:42:14,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1250925041, now seen corresponding path program 1 times [2022-07-19 13:42:14,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:42:14,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411341683] [2022-07-19 13:42:14,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:42:14,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:42:14,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:42:14,993 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-19 13:42:14,994 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-19 13:42:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:42:15,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 13:42:15,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:42:15,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:42:15,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:42:15,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:42:15,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411341683] [2022-07-19 13:42:15,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411341683] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:42:15,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:42:15,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 13:42:15,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608962881] [2022-07-19 13:42:15,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:42:15,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 13:42:15,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:42:15,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 13:42:15,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 13:42:15,667 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:42:17,890 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:42:18,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:42:18,247 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-07-19 13:42:18,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 13:42:18,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-19 13:42:18,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:42:18,249 INFO L225 Difference]: With dead ends: 28 [2022-07-19 13:42:18,249 INFO L226 Difference]: Without dead ends: 21 [2022-07-19 13:42:18,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 13:42:18,251 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-19 13:42:18,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-07-19 13:42:18,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-19 13:42:18,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-07-19 13:42:18,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:42:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-07-19 13:42:18,256 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 15 [2022-07-19 13:42:18,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:42:18,256 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-19 13:42:18,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:42:18,257 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-07-19 13:42:18,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-19 13:42:18,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:42:18,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:42:18,280 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-19 13:42:18,462 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-19 13:42:18,462 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:42:18,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:42:18,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1796523982, now seen corresponding path program 1 times [2022-07-19 13:42:18,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:42:18,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568666638] [2022-07-19 13:42:18,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:42:18,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:42:18,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:42:18,466 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-19 13:42:18,468 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-19 13:42:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:42:19,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 13:42:19,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:42:19,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 13:42:19,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:42:19,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:42:19,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568666638] [2022-07-19 13:42:19,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568666638] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:42:19,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:42:19,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 13:42:19,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081369031] [2022-07-19 13:42:19,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:42:19,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 13:42:19,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:42:19,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 13:42:19,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 13:42:19,117 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:42:19,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:42:19,229 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-07-19 13:42:19,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 13:42:19,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-19 13:42:19,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:42:19,230 INFO L225 Difference]: With dead ends: 24 [2022-07-19 13:42:19,230 INFO L226 Difference]: Without dead ends: 20 [2022-07-19 13:42:19,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 13:42:19,232 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 13:42:19,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 63 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 13:42:19,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-19 13:42:19,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-19 13:42:19,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:42:19,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-07-19 13:42:19,237 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2022-07-19 13:42:19,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:42:19,237 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-07-19 13:42:19,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:42:19,238 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-07-19 13:42:19,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-19 13:42:19,239 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:42:19,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:42:19,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-19 13:42:19,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:42:19,452 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:42:19,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:42:19,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1813534643, now seen corresponding path program 1 times [2022-07-19 13:42:19,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:42:19,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127850627] [2022-07-19 13:42:19,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:42:19,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:42:19,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:42:19,455 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:42:19,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-19 13:42:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:42:20,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-19 13:42:20,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:42:44,859 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse1 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse0) .cse0)) |c_ULTIMATE.start_main_~inv__xsi~0#1|) (= |c_ULTIMATE.start_main_~inv__temp~0#1| (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-19 13:43:08,361 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse1 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse0) .cse0)) |c_ULTIMATE.start_main_~inv__xsi~0#1|) (= |c_ULTIMATE.start_main_~inv__temp~0#1| (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse0))))) (not (fp.gt |c_ULTIMATE.start_main_~inv__temp~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-19 13:43:36,197 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 (let ((.cse3 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (let ((.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse2)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (not (fp.lt .cse0 (fp.neg .cse1))) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse2) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse2) .cse2)) |c_ULTIMATE.start_main_~inv__xsi~0#1|) (not (fp.gt .cse0 .cse1)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-19 13:44:04,221 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse0 (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 |ULTIMATE.start_main_~inv__A~0#1| .cse3) .cse3)))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse0 .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (= .cse0 |c_ULTIMATE.start_main_~inv__xi~0#1|) (not (fp.gt .cse1 .cse2)) (not (fp.lt .cse1 (fp.neg .cse2))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-19 13:44:32,142 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse2 (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 |ULTIMATE.start_main_~inv__A~0#1| .cse3) .cse3)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 .cse3)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))) (= .cse2 |c_ULTIMATE.start_main_~main__r~0#1|) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-19 13:45:00,910 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~inv__A~0#1| .cse1) .cse1)))) (and (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (fp.lt (fp.sub roundNearestTiesToEven .cse0 .cse1) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0))))) (not (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 20.0)))))) is different from false [2022-07-19 13:45:02,973 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~inv__A~0#1| .cse1) .cse1)))) (and (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (fp.lt (fp.sub roundNearestTiesToEven .cse0 .cse1) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0))))) (not (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 20.0)))))) is different from true [2022-07-19 13:46:14,569 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-19 13:46:14,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 13:46:30,550 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~inv__xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~inv__A~0#1| |c_ULTIMATE.start_main_~inv__xi~0#1|) |c_ULTIMATE.start_main_~inv__xi~0#1|)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~inv__xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse0 .cse1)))) is different from false [2022-07-19 13:46:32,681 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~inv__xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~inv__A~0#1| |c_ULTIMATE.start_main_~inv__xi~0#1|) |c_ULTIMATE.start_main_~inv__xi~0#1|)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~inv__xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse0 .cse1)))) is different from true