./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/inv_Newton-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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-2.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 67155ca1e686450fca2a6f4b9f638c838555b88a3546adff9656d040c859ca12 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 13:54:10,425 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 13:54:10,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 13:54:10,473 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 13:54:10,474 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 13:54:10,476 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 13:54:10,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 13:54:10,479 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 13:54:10,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 13:54:10,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 13:54:10,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 13:54:10,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 13:54:10,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 13:54:10,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 13:54:10,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 13:54:10,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 13:54:10,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 13:54:10,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 13:54:10,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 13:54:10,505 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 13:54:10,508 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 13:54:10,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 13:54:10,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 13:54:10,510 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 13:54:10,512 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 13:54:10,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 13:54:10,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 13:54:10,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 13:54:10,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 13:54:10,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 13:54:10,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 13:54:10,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 13:54:10,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 13:54:10,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 13:54:10,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 13:54:10,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 13:54:10,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 13:54:10,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 13:54:10,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 13:54:10,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 13:54:10,529 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 13:54:10,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 13:54:10,531 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 13:54:10,562 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 13:54:10,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 13:54:10,563 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 13:54:10,564 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 13:54:10,564 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 13:54:10,565 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 13:54:10,565 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 13:54:10,565 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 13:54:10,566 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 13:54:10,566 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 13:54:10,567 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 13:54:10,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 13:54:10,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 13:54:10,567 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 13:54:10,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 13:54:10,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 13:54:10,568 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 13:54:10,568 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 13:54:10,568 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 13:54:10,568 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 13:54:10,569 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 13:54:10,569 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 13:54:10,569 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 13:54:10,569 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 13:54:10,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 13:54:10,570 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 13:54:10,570 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 13:54:10,570 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 13:54:10,570 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 13:54:10,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 13:54:10,571 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 13:54:10,571 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 13:54:10,571 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 13:54:10,571 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 -> 67155ca1e686450fca2a6f4b9f638c838555b88a3546adff9656d040c859ca12 [2022-07-22 13:54:10,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 13:54:10,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 13:54:10,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 13:54:10,855 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 13:54:10,855 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 13:54:10,856 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_Newton-2.c [2022-07-22 13:54:10,917 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/442137855/3f918e2334644247a54aeed7e5883518/FLAGa0d29a128 [2022-07-22 13:54:11,273 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 13:54:11,273 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton-2.c [2022-07-22 13:54:11,278 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/442137855/3f918e2334644247a54aeed7e5883518/FLAGa0d29a128 [2022-07-22 13:54:11,699 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/442137855/3f918e2334644247a54aeed7e5883518 [2022-07-22 13:54:11,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 13:54:11,702 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 13:54:11,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 13:54:11,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 13:54:11,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 13:54:11,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:54:11" (1/1) ... [2022-07-22 13:54:11,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e07f6fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11, skipping insertion in model container [2022-07-22 13:54:11,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:54:11" (1/1) ... [2022-07-22 13:54:11,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 13:54:11,728 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 13:54:11,893 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-2.c[847,860] [2022-07-22 13:54:11,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 13:54:11,925 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 13:54:11,938 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-2.c[847,860] [2022-07-22 13:54:11,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 13:54:11,973 INFO L208 MainTranslator]: Completed translation [2022-07-22 13:54:11,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11 WrapperNode [2022-07-22 13:54:11,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 13:54:11,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 13:54:11,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 13:54:11,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 13:54:11,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11" (1/1) ... [2022-07-22 13:54:11,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11" (1/1) ... [2022-07-22 13:54:12,017 INFO L137 Inliner]: procedures = 18, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 66 [2022-07-22 13:54:12,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 13:54:12,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 13:54:12,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 13:54:12,020 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 13:54:12,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11" (1/1) ... [2022-07-22 13:54:12,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11" (1/1) ... [2022-07-22 13:54:12,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11" (1/1) ... [2022-07-22 13:54:12,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11" (1/1) ... [2022-07-22 13:54:12,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11" (1/1) ... [2022-07-22 13:54:12,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11" (1/1) ... [2022-07-22 13:54:12,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11" (1/1) ... [2022-07-22 13:54:12,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 13:54:12,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 13:54:12,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 13:54:12,063 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 13:54:12,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11" (1/1) ... [2022-07-22 13:54:12,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 13:54:12,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 13:54:12,092 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-22 13:54:12,108 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-22 13:54:12,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 13:54:12,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 13:54:12,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 13:54:12,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-22 13:54:12,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 13:54:12,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-22 13:54:12,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 13:54:12,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 13:54:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 13:54:12,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 13:54:12,221 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 13:54:12,222 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 13:54:12,381 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 13:54:12,387 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 13:54:12,403 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 13:54:12,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:54:12 BoogieIcfgContainer [2022-07-22 13:54:12,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 13:54:12,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 13:54:12,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 13:54:12,410 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 13:54:12,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 01:54:11" (1/3) ... [2022-07-22 13:54:12,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278c88ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:54:12, skipping insertion in model container [2022-07-22 13:54:12,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11" (2/3) ... [2022-07-22 13:54:12,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278c88ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:54:12, skipping insertion in model container [2022-07-22 13:54:12,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:54:12" (3/3) ... [2022-07-22 13:54:12,413 INFO L111 eAbstractionObserver]: Analyzing ICFG inv_Newton-2.c [2022-07-22 13:54:12,425 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 13:54:12,425 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 13:54:12,461 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 13:54:12,467 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@5362e72a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3a145077 [2022-07-22 13:54:12,468 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 13:54:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:54:12,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 13:54:12,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:54:12,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:54:12,480 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:54:12,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:54:12,485 INFO L85 PathProgramCache]: Analyzing trace with hash -590190995, now seen corresponding path program 1 times [2022-07-22 13:54:12,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 13:54:12,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828929630] [2022-07-22 13:54:12,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:54:12,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 13:54:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:54:12,620 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-22 13:54:12,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 13:54:12,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828929630] [2022-07-22 13:54:12,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828929630] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 13:54:12,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 13:54:12,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 13:54:12,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459303747] [2022-07-22 13:54:12,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 13:54:12,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 13:54:12,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 13:54:12,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 13:54:12,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 13:54:12,668 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:54:12,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:54:12,681 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-07-22 13:54:12,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 13:54:12,683 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-22 13:54:12,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:54:12,689 INFO L225 Difference]: With dead ends: 25 [2022-07-22 13:54:12,690 INFO L226 Difference]: Without dead ends: 10 [2022-07-22 13:54:12,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 13:54:12,698 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 13:54:12,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 13:54:12,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-07-22 13:54:12,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-07-22 13:54:12,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:54:12,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-07-22 13:54:12,723 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 9 [2022-07-22 13:54:12,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:54:12,723 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-07-22 13:54:12,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:54:12,724 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-07-22 13:54:12,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 13:54:12,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:54:12,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:54:12,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 13:54:12,725 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:54:12,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:54:12,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1184816367, now seen corresponding path program 1 times [2022-07-22 13:54:12,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 13:54:12,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789502939] [2022-07-22 13:54:12,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:54:12,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 13:54:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:54:12,795 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-22 13:54:12,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 13:54:12,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789502939] [2022-07-22 13:54:12,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789502939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 13:54:12,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 13:54:12,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 13:54:12,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262692460] [2022-07-22 13:54:12,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 13:54:12,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 13:54:12,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 13:54:12,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 13:54:12,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 13:54:12,799 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:54:12,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:54:12,806 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-07-22 13:54:12,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 13:54:12,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-22 13:54:12,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:54:12,807 INFO L225 Difference]: With dead ends: 16 [2022-07-22 13:54:12,808 INFO L226 Difference]: Without dead ends: 11 [2022-07-22 13:54:12,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 13:54:12,809 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 13:54:12,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 13:54:12,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-07-22 13:54:12,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-07-22 13:54:12,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:54:12,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-07-22 13:54:12,813 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2022-07-22 13:54:12,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:54:12,813 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-07-22 13:54:12,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:54:12,814 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-07-22 13:54:12,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-22 13:54:12,814 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:54:12,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:54:12,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 13:54:12,815 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:54:12,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:54:12,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1873743609, now seen corresponding path program 1 times [2022-07-22 13:54:12,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 13:54:12,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375193114] [2022-07-22 13:54:12,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:54:12,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 13:54:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 13:54:12,882 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 13:54:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 13:54:12,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 13:54:12,942 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 13:54:12,943 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 13:54:12,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 13:54:12,948 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-22 13:54:12,952 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 13:54:12,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 01:54:12 BoogieIcfgContainer [2022-07-22 13:54:12,975 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 13:54:12,977 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 13:54:12,977 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 13:54:12,977 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 13:54:12,977 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:54:12" (3/4) ... [2022-07-22 13:54:12,980 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 13:54:12,980 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 13:54:12,981 INFO L158 Benchmark]: Toolchain (without parser) took 1278.21ms. Allocated memory is still 123.7MB. Free memory was 88.2MB in the beginning and 96.1MB in the end (delta: -7.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 13:54:12,982 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 123.7MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 13:54:12,983 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.33ms. Allocated memory is still 123.7MB. Free memory was 88.0MB in the beginning and 99.8MB in the end (delta: -11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 13:54:12,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.98ms. Allocated memory is still 123.7MB. Free memory was 99.8MB in the beginning and 98.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 13:54:12,990 INFO L158 Benchmark]: Boogie Preprocessor took 41.70ms. Allocated memory is still 123.7MB. Free memory was 98.1MB in the beginning and 97.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 13:54:12,991 INFO L158 Benchmark]: RCFGBuilder took 343.80ms. Allocated memory is still 123.7MB. Free memory was 97.0MB in the beginning and 85.8MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 13:54:12,991 INFO L158 Benchmark]: TraceAbstraction took 568.45ms. Allocated memory is still 123.7MB. Free memory was 85.5MB in the beginning and 96.8MB in the end (delta: -11.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 13:54:12,991 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 123.7MB. Free memory was 96.8MB in the beginning and 96.1MB in the end (delta: 699.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 13:54:12,993 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.20ms. Allocated memory is still 123.7MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.33ms. Allocated memory is still 123.7MB. Free memory was 88.0MB in the beginning and 99.8MB in the end (delta: -11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.98ms. Allocated memory is still 123.7MB. Free memory was 99.8MB in the beginning and 98.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.70ms. Allocated memory is still 123.7MB. Free memory was 98.1MB in the beginning and 97.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 343.80ms. Allocated memory is still 123.7MB. Free memory was 97.0MB in the beginning and 85.8MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 568.45ms. Allocated memory is still 123.7MB. Free memory was 85.5MB in the beginning and 96.8MB in the end (delta: -11.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 123.7MB. Free memory was 96.8MB in the beginning and 96.1MB in the end (delta: 699.2kB). 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: 23]: 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 37, overapproximation of someBinaryArithmeticDOUBLEoperation at line 43, overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of to_real at line 38. Possible FailurePath: [L53] double a,r; [L55] a = __VERIFIER_nondet_double() [L56] CALL assume_abort_if_not(a >= 20. && a <= 30.) [L21] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L56] RET assume_abort_if_not(a >= 20. && a <= 30.) [L58] CALL, EXPR inv(a) [L33] double xi, xsi, temp; [L34] signed int cond, exp; [L35] union double_int A_u, xi_u; [L36] A_u.d = A [L37] EXPR A_u.i [L37] exp = (signed int) ((A_u.i & 0x7FF00000) >> 20) - 1023 [L38] xi_u.d = 1 [L39] xi_u.i = ((1023-exp) << 20) [L40] EXPR xi_u.d [L40] xi = xi_u.d [L41] cond = 1 VAL [\old(A)=2145386501, A=2145386501, A_u={4:0}, cond=1, exp=-1023, xi=2145386500, xi_u={5:0}] [L42] COND TRUE \read(cond) [L43] xsi = 2*xi-A*xi*xi [L44] temp = xsi-xi [L45] cond = ((temp > 1e-10) || (temp < -1e-10)) [L46] xi = xsi VAL [\old(A)=2145386501, A=2145386501, A_u={4:0}, cond=0, exp=-1023, xi=2145386497, xi_u={5:0}, xsi=2145386497] [L42] COND FALSE !(\read(cond)) VAL [\old(A)=2145386501, A=2145386501, A_u={4:0}, cond=0, exp=-1023, xi=2145386497, xi_u={5:0}, xsi=2145386497] [L48] return xi; [L48] return xi; [L48] return xi; VAL [\old(A)=2145386501, \result=2145386497, A=2145386501, cond=0, exp=-1023, xi=2145386497, xsi=2145386497] [L58] RET, EXPR inv(a) [L58] r = inv(a) [L60] CALL __VERIFIER_assert(r >= 0 && r <= 0.06) [L23] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L23] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 23 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 18 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-22 13:54:13,031 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-2.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 67155ca1e686450fca2a6f4b9f638c838555b88a3546adff9656d040c859ca12 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 13:54:14,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 13:54:14,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 13:54:15,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 13:54:15,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 13:54:15,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 13:54:15,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 13:54:15,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 13:54:15,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 13:54:15,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 13:54:15,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 13:54:15,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 13:54:15,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 13:54:15,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 13:54:15,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 13:54:15,044 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 13:54:15,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 13:54:15,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 13:54:15,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 13:54:15,054 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 13:54:15,055 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 13:54:15,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 13:54:15,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 13:54:15,059 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 13:54:15,060 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 13:54:15,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 13:54:15,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 13:54:15,067 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 13:54:15,068 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 13:54:15,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 13:54:15,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 13:54:15,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 13:54:15,072 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 13:54:15,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 13:54:15,073 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 13:54:15,074 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 13:54:15,074 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 13:54:15,075 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 13:54:15,075 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 13:54:15,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 13:54:15,076 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 13:54:15,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 13:54:15,081 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 13:54:15,108 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 13:54:15,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 13:54:15,109 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 13:54:15,109 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 13:54:15,110 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 13:54:15,110 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 13:54:15,111 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 13:54:15,111 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 13:54:15,111 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 13:54:15,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 13:54:15,112 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 13:54:15,113 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 13:54:15,113 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 13:54:15,113 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 13:54:15,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 13:54:15,113 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 13:54:15,113 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 13:54:15,114 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 13:54:15,114 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 13:54:15,114 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 13:54:15,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 13:54:15,115 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 13:54:15,115 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 13:54:15,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 13:54:15,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 13:54:15,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 13:54:15,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 13:54:15,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 13:54:15,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 13:54:15,116 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 13:54:15,116 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 13:54:15,117 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 13:54:15,117 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 13:54:15,117 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 13:54:15,117 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 13:54:15,117 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 13:54:15,118 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 -> 67155ca1e686450fca2a6f4b9f638c838555b88a3546adff9656d040c859ca12 [2022-07-22 13:54:15,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 13:54:15,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 13:54:15,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 13:54:15,463 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 13:54:15,464 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 13:54:15,466 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_Newton-2.c [2022-07-22 13:54:15,531 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5949dc425/7e1d8865c4e4410f916f3c1dcf8bf47f/FLAG9500a6f0e [2022-07-22 13:54:15,997 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 13:54:15,997 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton-2.c [2022-07-22 13:54:16,003 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5949dc425/7e1d8865c4e4410f916f3c1dcf8bf47f/FLAG9500a6f0e [2022-07-22 13:54:16,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5949dc425/7e1d8865c4e4410f916f3c1dcf8bf47f [2022-07-22 13:54:16,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 13:54:16,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 13:54:16,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 13:54:16,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 13:54:16,398 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 13:54:16,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:54:16" (1/1) ... [2022-07-22 13:54:16,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d2e232d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16, skipping insertion in model container [2022-07-22 13:54:16,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:54:16" (1/1) ... [2022-07-22 13:54:16,407 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 13:54:16,418 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 13:54:16,544 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-2.c[847,860] [2022-07-22 13:54:16,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 13:54:16,607 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 13:54:16,633 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-2.c[847,860] [2022-07-22 13:54:16,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 13:54:16,676 INFO L208 MainTranslator]: Completed translation [2022-07-22 13:54:16,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16 WrapperNode [2022-07-22 13:54:16,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 13:54:16,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 13:54:16,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 13:54:16,678 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 13:54:16,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16" (1/1) ... [2022-07-22 13:54:16,701 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16" (1/1) ... [2022-07-22 13:54:16,724 INFO L137 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2022-07-22 13:54:16,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 13:54:16,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 13:54:16,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 13:54:16,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 13:54:16,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16" (1/1) ... [2022-07-22 13:54:16,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16" (1/1) ... [2022-07-22 13:54:16,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16" (1/1) ... [2022-07-22 13:54:16,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16" (1/1) ... [2022-07-22 13:54:16,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16" (1/1) ... [2022-07-22 13:54:16,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16" (1/1) ... [2022-07-22 13:54:16,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16" (1/1) ... [2022-07-22 13:54:16,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 13:54:16,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 13:54:16,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 13:54:16,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 13:54:16,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16" (1/1) ... [2022-07-22 13:54:16,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 13:54:16,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 13:54:16,813 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-22 13:54:16,839 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-22 13:54:16,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 13:54:16,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-07-22 13:54:16,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-22 13:54:16,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 13:54:16,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 13:54:16,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-22 13:54:16,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 13:54:16,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 13:54:16,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 13:54:16,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-22 13:54:16,949 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 13:54:16,950 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 13:54:19,255 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 13:54:19,260 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 13:54:19,260 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 13:54:19,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:54:19 BoogieIcfgContainer [2022-07-22 13:54:19,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 13:54:19,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 13:54:19,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 13:54:19,266 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 13:54:19,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 01:54:16" (1/3) ... [2022-07-22 13:54:19,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65cf5387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:54:19, skipping insertion in model container [2022-07-22 13:54:19,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16" (2/3) ... [2022-07-22 13:54:19,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65cf5387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:54:19, skipping insertion in model container [2022-07-22 13:54:19,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:54:19" (3/3) ... [2022-07-22 13:54:19,269 INFO L111 eAbstractionObserver]: Analyzing ICFG inv_Newton-2.c [2022-07-22 13:54:19,282 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 13:54:19,283 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 13:54:19,347 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 13:54:19,353 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@263eedf5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6ff85f97 [2022-07-22 13:54:19,353 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 13:54:19,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:54:19,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 13:54:19,363 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:54:19,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:54:19,364 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:54:19,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:54:19,368 INFO L85 PathProgramCache]: Analyzing trace with hash -590190995, now seen corresponding path program 1 times [2022-07-22 13:54:19,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 13:54:19,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833360942] [2022-07-22 13:54:19,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:54:19,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 13:54:19,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 13:54:19,383 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-22 13:54:19,385 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-22 13:54:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:54:19,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-22 13:54:19,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 13:54:19,502 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-22 13:54:19,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 13:54:19,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 13:54:19,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833360942] [2022-07-22 13:54:19,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833360942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 13:54:19,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 13:54:19,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 13:54:19,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272554889] [2022-07-22 13:54:19,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 13:54:19,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 13:54:19,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 13:54:19,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 13:54:19,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 13:54:19,535 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:54:19,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:54:19,547 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-07-22 13:54:19,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 13:54:19,549 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-22 13:54:19,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:54:19,554 INFO L225 Difference]: With dead ends: 25 [2022-07-22 13:54:19,554 INFO L226 Difference]: Without dead ends: 10 [2022-07-22 13:54:19,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 13:54:19,559 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 13:54:19,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 13:54:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-07-22 13:54:19,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-07-22 13:54:19,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:54:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-07-22 13:54:19,580 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 9 [2022-07-22 13:54:19,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:54:19,580 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-07-22 13:54:19,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:54:19,581 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-07-22 13:54:19,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 13:54:19,581 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:54:19,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:54:19,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-22 13:54:19,782 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-22 13:54:19,783 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:54:19,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:54:19,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1184816367, now seen corresponding path program 1 times [2022-07-22 13:54:19,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 13:54:19,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900900003] [2022-07-22 13:54:19,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:54:19,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 13:54:19,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 13:54:19,786 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-22 13:54:19,804 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-22 13:54:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:54:19,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 13:54:19,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 13:54:19,926 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-22 13:54:19,927 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 13:54:19,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 13:54:19,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [900900003] [2022-07-22 13:54:19,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [900900003] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 13:54:19,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 13:54:19,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 13:54:19,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644116577] [2022-07-22 13:54:19,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 13:54:19,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 13:54:19,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 13:54:19,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 13:54:19,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 13:54:19,931 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:54:22,146 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 13:54:22,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:54:22,247 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-07-22 13:54:22,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 13:54:22,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-22 13:54:22,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:54:22,248 INFO L225 Difference]: With dead ends: 16 [2022-07-22 13:54:22,249 INFO L226 Difference]: Without dead ends: 11 [2022-07-22 13:54:22,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 13:54:22,250 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 13:54:22,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 13:54:22,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-07-22 13:54:22,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-07-22 13:54:22,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:54:22,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-07-22 13:54:22,254 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2022-07-22 13:54:22,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:54:22,254 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-07-22 13:54:22,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:54:22,255 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-07-22 13:54:22,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-22 13:54:22,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:54:22,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:54:22,265 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-22 13:54:22,463 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-22 13:54:22,464 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:54:22,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:54:22,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1873743609, now seen corresponding path program 1 times [2022-07-22 13:54:22,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 13:54:22,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732951706] [2022-07-22 13:54:22,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:54:22,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 13:54:22,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 13:54:22,467 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-22 13:54:22,469 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-22 13:54:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:54:23,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-22 13:54:23,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 13:55:43,883 WARN L833 $PredicateComparison]: unable to prove that (or (and (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv0 32)) (exists ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse3) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse3) .cse3)) .cse3))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (not (fp.gt .cse1 .cse2)) (not (fp.lt .cse1 (fp.neg .cse2)))))))) (and (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse5 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse5 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (exists ((v_skolemized_v_prenex_1_6 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.lt (let ((.cse6 (let ((.cse7 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse6) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) .cse6) .cse6)) .cse6)) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0))))))))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse8 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse8 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (exists ((v_skolemized_v_prenex_1_6 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.gt (let ((.cse9 (let ((.cse10 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse9) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) .cse9) .cse9)) .cse9)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0))))))))) (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv1 32)))) is different from false [2022-07-22 13:56:09,782 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse3) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse3) .cse3)) .cse3))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (not (fp.gt .cse1 .cse2)) (not (fp.lt .cse1 (fp.neg .cse2))))))) is different from false [2022-07-22 13:56:11,859 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse3) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse3) .cse3)) .cse3))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (not (fp.gt .cse1 .cse2)) (not (fp.lt .cse1 (fp.neg .cse2))))))) is different from true [2022-07-22 13:57:23,394 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-22 13:57:23,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 13:57:34,508 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_inv_~A#1| |c_ULTIMATE.start_inv_~xi~0#1|) |c_ULTIMATE.start_inv_~xi~0#1|)) |c_ULTIMATE.start_inv_~xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.gt .cse0 .cse1))) is different from false [2022-07-22 13:57:36,642 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_inv_~A#1| |c_ULTIMATE.start_inv_~xi~0#1|) |c_ULTIMATE.start_inv_~xi~0#1|)) |c_ULTIMATE.start_inv_~xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.gt .cse0 .cse1))) is different from true [2022-07-22 13:57:56,858 WARN L855 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse3)) .cse3))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (not (= |c_ULTIMATE.start_main_~a~0#1| .cse2)) (fp.gt .cse0 .cse1) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))))))) is different from true [2022-07-22 13:58:16,685 WARN L855 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (forall ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse3)) .cse3))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (not (= |c_ULTIMATE.start_main_~a~0#1| .cse2)) (fp.gt .cse0 .cse1) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))))))))) is different from true [2022-07-22 13:58:40,909 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse3)) .cse3))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (not (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 30.0))) (not (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0))) (fp.gt .cse0 .cse1) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))))))) is different from false [2022-07-22 13:58:43,047 WARN L855 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse3)) .cse3))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (not (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 30.0))) (not (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0))) (fp.gt .cse0 .cse1) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))))))) is different from true [2022-07-22 13:58:43,048 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-22 13:58:43,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 13:58:43,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732951706] [2022-07-22 13:58:43,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732951706] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 13:58:43,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 13:58:43,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2022-07-22 13:58:43,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794339896] [2022-07-22 13:58:43,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 13:58:43,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 13:58:43,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 13:58:43,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 13:58:43,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=31, Unknown=9, NotChecked=90, Total=156 [2022-07-22 13:58:43,051 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:58:45,182 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse3)) .cse3))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (not (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 30.0))) (not (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0))) (fp.gt .cse0 .cse1) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-22 13:58:47,347 WARN L855 $PredicateComparison]: unable to prove that (and (forall ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse3)) .cse3))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (not (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 30.0))) (not (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0))) (fp.gt .cse0 .cse1) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-22 13:58:49,547 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (and (or .cse0 (forall ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse1 (let ((.cse4 (let ((.cse5 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse4) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse4) .cse4)) .cse4))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse1 (fp.neg .cse2)) (not (= |c_ULTIMATE.start_main_~a~0#1| .cse3)) (fp.gt .cse1 .cse2) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))))))))) (let ((.cse7 (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0))) (.cse6 (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)))) (or (and .cse6 .cse7 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and (or (not .cse7) (not .cse6)) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-22 13:58:51,617 WARN L833 $PredicateComparison]: unable to prove that (and (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse3)) .cse3))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (not (= |c_ULTIMATE.start_main_~a~0#1| .cse2)) (fp.gt .cse0 .cse1) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))))))))) is different from false [2022-07-22 13:58:53,785 WARN L855 $PredicateComparison]: unable to prove that (and (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse3)) .cse3))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (not (= |c_ULTIMATE.start_main_~a~0#1| .cse2)) (fp.gt .cse0 .cse1) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))))))))) is different from true [2022-07-22 13:58:55,908 WARN L833 $PredicateComparison]: unable to prove that (and (fp.leq |c_ULTIMATE.start_inv_~A#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_inv_~A#1| |c_ULTIMATE.start_inv_~xi~0#1|) |c_ULTIMATE.start_inv_~xi~0#1|)) |c_ULTIMATE.start_inv_~xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.gt .cse0 .cse1))) (exists ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) |c_ULTIMATE.start_inv_~A#1|) (= |c_ULTIMATE.start_inv_~xi~0#1| (let ((.cse2 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))))) (fp.geq |c_ULTIMATE.start_inv_~A#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-22 13:58:58,072 WARN L855 $PredicateComparison]: unable to prove that (and (fp.leq |c_ULTIMATE.start_inv_~A#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_inv_~A#1| |c_ULTIMATE.start_inv_~xi~0#1|) |c_ULTIMATE.start_inv_~xi~0#1|)) |c_ULTIMATE.start_inv_~xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.gt .cse0 .cse1))) (exists ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) |c_ULTIMATE.start_inv_~A#1|) (= |c_ULTIMATE.start_inv_~xi~0#1| (let ((.cse2 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))))) (fp.geq |c_ULTIMATE.start_inv_~A#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true