./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound10.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 386c3e7d1ea789c9c3d2e7e38148627ea5f6d60be4bd0eecc87000a545db7275 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 12:21:23,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 12:21:23,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 12:21:23,459 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 12:21:23,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 12:21:23,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 12:21:23,463 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 12:21:23,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 12:21:23,467 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 12:21:23,470 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 12:21:23,471 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 12:21:23,472 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 12:21:23,472 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 12:21:23,474 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 12:21:23,475 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 12:21:23,476 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 12:21:23,488 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 12:21:23,488 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 12:21:23,489 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 12:21:23,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 12:21:23,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 12:21:23,502 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 12:21:23,503 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 12:21:23,504 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 12:21:23,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 12:21:23,512 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 12:21:23,512 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 12:21:23,513 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 12:21:23,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 12:21:23,514 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 12:21:23,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 12:21:23,515 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 12:21:23,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 12:21:23,517 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 12:21:23,518 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 12:21:23,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 12:21:23,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 12:21:23,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 12:21:23,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 12:21:23,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 12:21:23,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 12:21:23,521 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 12:21:23,550 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 12:21:23,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 12:21:23,551 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 12:21:23,551 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 12:21:23,552 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 12:21:23,552 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 12:21:23,552 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 12:21:23,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 12:21:23,552 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 12:21:23,553 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 12:21:23,553 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 12:21:23,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 12:21:23,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 12:21:23,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 12:21:23,554 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 12:21:23,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 12:21:23,554 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 12:21:23,554 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 12:21:23,555 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 12:21:23,555 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 12:21:23,555 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 12:21:23,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 12:21:23,555 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 12:21:23,555 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 12:21:23,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 12:21:23,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 12:21:23,556 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 12:21:23,556 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 12:21:23,556 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 12:21:23,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 12:21:23,557 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 12:21:23,557 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 12:21:23,557 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 12:21:23,557 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 12:21:23,557 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 -> 386c3e7d1ea789c9c3d2e7e38148627ea5f6d60be4bd0eecc87000a545db7275 [2021-12-17 12:21:23,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 12:21:23,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 12:21:23,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 12:21:23,777 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 12:21:23,778 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 12:21:23,779 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound10.c [2021-12-17 12:21:23,844 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29721a05a/77678121312e46268f447a630d267dd4/FLAGa23d55160 [2021-12-17 12:21:24,193 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 12:21:24,194 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound10.c [2021-12-17 12:21:24,201 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29721a05a/77678121312e46268f447a630d267dd4/FLAGa23d55160 [2021-12-17 12:21:24,213 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29721a05a/77678121312e46268f447a630d267dd4 [2021-12-17 12:21:24,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 12:21:24,217 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 12:21:24,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 12:21:24,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 12:21:24,220 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 12:21:24,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 12:21:24" (1/1) ... [2021-12-17 12:21:24,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142a765e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:24, skipping insertion in model container [2021-12-17 12:21:24,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 12:21:24" (1/1) ... [2021-12-17 12:21:24,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 12:21:24,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 12:21:24,372 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/nla-digbench-scaling/freire1_valuebound10.c[712,725] [2021-12-17 12:21:24,387 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 12:21:24,393 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 12:21:24,403 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/nla-digbench-scaling/freire1_valuebound10.c[712,725] [2021-12-17 12:21:24,409 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 12:21:24,418 INFO L208 MainTranslator]: Completed translation [2021-12-17 12:21:24,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:24 WrapperNode [2021-12-17 12:21:24,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 12:21:24,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 12:21:24,422 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 12:21:24,422 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 12:21:24,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:24" (1/1) ... [2021-12-17 12:21:24,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:24" (1/1) ... [2021-12-17 12:21:24,444 INFO L137 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2021-12-17 12:21:24,444 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 12:21:24,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 12:21:24,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 12:21:24,445 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 12:21:24,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:24" (1/1) ... [2021-12-17 12:21:24,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:24" (1/1) ... [2021-12-17 12:21:24,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:24" (1/1) ... [2021-12-17 12:21:24,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:24" (1/1) ... [2021-12-17 12:21:24,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:24" (1/1) ... [2021-12-17 12:21:24,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:24" (1/1) ... [2021-12-17 12:21:24,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:24" (1/1) ... [2021-12-17 12:21:24,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 12:21:24,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 12:21:24,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 12:21:24,478 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 12:21:24,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:24" (1/1) ... [2021-12-17 12:21:24,484 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 12:21:24,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 12:21:24,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 12:21:24,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 12:21:24,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 12:21:24,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 12:21:24,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 12:21:24,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 12:21:24,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-17 12:21:24,574 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-17 12:21:24,616 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 12:21:24,617 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 12:21:24,722 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 12:21:24,726 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 12:21:24,729 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 12:21:24,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 12:21:24 BoogieIcfgContainer [2021-12-17 12:21:24,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 12:21:24,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 12:21:24,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 12:21:24,734 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 12:21:24,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 12:21:24" (1/3) ... [2021-12-17 12:21:24,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79498b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 12:21:24, skipping insertion in model container [2021-12-17 12:21:24,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:24" (2/3) ... [2021-12-17 12:21:24,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79498b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 12:21:24, skipping insertion in model container [2021-12-17 12:21:24,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 12:21:24" (3/3) ... [2021-12-17 12:21:24,737 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound10.c [2021-12-17 12:21:24,740 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 12:21:24,741 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 12:21:24,786 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 12:21:24,794 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 12:21:24,795 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 12:21:24,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 12:21:24,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-17 12:21:24,815 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:21:24,815 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:21:24,816 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:21:24,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:21:24,820 INFO L85 PathProgramCache]: Analyzing trace with hash -589467074, now seen corresponding path program 1 times [2021-12-17 12:21:24,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 12:21:24,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991690332] [2021-12-17 12:21:24,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:21:24,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 12:21:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 12:21:24,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 12:21:24,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 12:21:24,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991690332] [2021-12-17 12:21:24,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991690332] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 12:21:24,935 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 12:21:24,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 12:21:24,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614733578] [2021-12-17 12:21:24,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 12:21:24,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 12:21:24,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 12:21:24,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 12:21:24,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 12:21:24,959 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 12:21:24,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:21:24,985 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2021-12-17 12:21:24,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 12:21:24,987 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-17 12:21:24,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:21:24,995 INFO L225 Difference]: With dead ends: 33 [2021-12-17 12:21:24,995 INFO L226 Difference]: Without dead ends: 14 [2021-12-17 12:21:24,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 12:21:25,000 INFO L933 BasicCegarLoop]: 19 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, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 12:21:25,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 12:21:25,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-12-17 12:21:25,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-17 12:21:25,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 12:21:25,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-12-17 12:21:25,026 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2021-12-17 12:21:25,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:21:25,027 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-12-17 12:21:25,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 12:21:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-12-17 12:21:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-17 12:21:25,028 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:21:25,028 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:21:25,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 12:21:25,029 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:21:25,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:21:25,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1187327748, now seen corresponding path program 1 times [2021-12-17 12:21:25,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 12:21:25,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443009061] [2021-12-17 12:21:25,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:21:25,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 12:21:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 12:21:25,063 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 12:21:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 12:21:25,087 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 12:21:25,087 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 12:21:25,088 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 12:21:25,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 12:21:25,096 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-12-17 12:21:25,098 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 12:21:25,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 12:21:25 BoogieIcfgContainer [2021-12-17 12:21:25,117 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 12:21:25,117 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 12:21:25,117 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 12:21:25,118 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 12:21:25,118 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 12:21:24" (3/4) ... [2021-12-17 12:21:25,120 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-17 12:21:25,120 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 12:21:25,122 INFO L158 Benchmark]: Toolchain (without parser) took 904.16ms. Allocated memory was 92.3MB in the beginning and 117.4MB in the end (delta: 25.2MB). Free memory was 61.0MB in the beginning and 59.1MB in the end (delta: 1.9MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2021-12-17 12:21:25,122 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 92.3MB. Free memory is still 49.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 12:21:25,125 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.70ms. Allocated memory was 92.3MB in the beginning and 117.4MB in the end (delta: 25.2MB). Free memory was 61.0MB in the beginning and 93.9MB in the end (delta: -32.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 12:21:25,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.96ms. Allocated memory is still 117.4MB. Free memory was 93.9MB in the beginning and 92.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 12:21:25,127 INFO L158 Benchmark]: Boogie Preprocessor took 32.77ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 91.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 12:21:25,127 INFO L158 Benchmark]: RCFGBuilder took 252.33ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 82.2MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 12:21:25,128 INFO L158 Benchmark]: TraceAbstraction took 385.20ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 59.1MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-17 12:21:25,128 INFO L158 Benchmark]: Witness Printer took 3.18ms. Allocated memory is still 117.4MB. Free memory is still 59.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 12:21:25,131 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 92.3MB. Free memory is still 49.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.70ms. Allocated memory was 92.3MB in the beginning and 117.4MB in the end (delta: 25.2MB). Free memory was 61.0MB in the beginning and 93.9MB in the end (delta: -32.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.96ms. Allocated memory is still 117.4MB. Free memory was 93.9MB in the beginning and 92.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.77ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 91.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 252.33ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 82.2MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 385.20ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 59.1MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Witness Printer took 3.18ms. Allocated memory is still 117.4MB. Free memory is still 59.1MB. 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: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_int at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 29. Possible FailurePath: [L25] int r; [L26] double a, x; [L27] a = __VERIFIER_nondet_double() [L28] CALL assume_abort_if_not(a>=0 && a<=10) [L14] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L28] RET assume_abort_if_not(a>=0 && a<=10) [L29] x = a / 2.0 [L30] r = 0 VAL [r=0] [L32] COND TRUE 1 VAL [r=0] [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L19] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 19 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 8 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-17 12:21:25,164 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/nla-digbench-scaling/freire1_valuebound10.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 386c3e7d1ea789c9c3d2e7e38148627ea5f6d60be4bd0eecc87000a545db7275 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 12:21:27,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 12:21:27,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 12:21:27,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 12:21:27,205 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 12:21:27,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 12:21:27,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 12:21:27,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 12:21:27,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 12:21:27,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 12:21:27,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 12:21:27,230 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 12:21:27,230 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 12:21:27,232 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 12:21:27,233 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 12:21:27,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 12:21:27,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 12:21:27,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 12:21:27,241 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 12:21:27,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 12:21:27,247 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 12:21:27,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 12:21:27,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 12:21:27,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 12:21:27,254 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 12:21:27,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 12:21:27,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 12:21:27,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 12:21:27,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 12:21:27,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 12:21:27,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 12:21:27,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 12:21:27,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 12:21:27,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 12:21:27,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 12:21:27,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 12:21:27,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 12:21:27,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 12:21:27,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 12:21:27,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 12:21:27,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 12:21:27,267 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-17 12:21:27,296 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 12:21:27,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 12:21:27,297 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 12:21:27,297 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 12:21:27,298 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 12:21:27,298 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 12:21:27,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 12:21:27,299 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 12:21:27,299 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 12:21:27,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 12:21:27,300 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 12:21:27,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 12:21:27,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 12:21:27,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 12:21:27,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 12:21:27,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 12:21:27,301 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-17 12:21:27,302 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-17 12:21:27,302 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-17 12:21:27,302 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 12:21:27,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 12:21:27,302 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 12:21:27,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 12:21:27,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 12:21:27,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 12:21:27,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 12:21:27,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 12:21:27,303 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 12:21:27,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 12:21:27,304 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 12:21:27,304 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-17 12:21:27,304 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-17 12:21:27,304 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 12:21:27,305 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 12:21:27,305 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 12:21:27,305 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 12:21:27,305 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-17 12:21:27,305 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 -> 386c3e7d1ea789c9c3d2e7e38148627ea5f6d60be4bd0eecc87000a545db7275 [2021-12-17 12:21:27,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 12:21:27,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 12:21:27,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 12:21:27,668 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 12:21:27,669 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 12:21:27,670 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound10.c [2021-12-17 12:21:27,724 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/699233004/9ab5b2b6a85e4e759082ac3bf11c6bbb/FLAG6cc8805aa [2021-12-17 12:21:28,133 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 12:21:28,133 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound10.c [2021-12-17 12:21:28,138 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/699233004/9ab5b2b6a85e4e759082ac3bf11c6bbb/FLAG6cc8805aa [2021-12-17 12:21:28,558 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/699233004/9ab5b2b6a85e4e759082ac3bf11c6bbb [2021-12-17 12:21:28,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 12:21:28,561 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 12:21:28,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 12:21:28,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 12:21:28,567 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 12:21:28,568 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 12:21:28" (1/1) ... [2021-12-17 12:21:28,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d0c1bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:28, skipping insertion in model container [2021-12-17 12:21:28,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 12:21:28" (1/1) ... [2021-12-17 12:21:28,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 12:21:28,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 12:21:28,687 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/nla-digbench-scaling/freire1_valuebound10.c[712,725] [2021-12-17 12:21:28,704 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 12:21:28,712 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 12:21:28,751 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/nla-digbench-scaling/freire1_valuebound10.c[712,725] [2021-12-17 12:21:28,755 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 12:21:28,764 INFO L208 MainTranslator]: Completed translation [2021-12-17 12:21:28,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:28 WrapperNode [2021-12-17 12:21:28,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 12:21:28,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 12:21:28,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 12:21:28,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 12:21:28,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:28" (1/1) ... [2021-12-17 12:21:28,777 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:28" (1/1) ... [2021-12-17 12:21:28,789 INFO L137 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2021-12-17 12:21:28,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 12:21:28,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 12:21:28,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 12:21:28,790 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 12:21:28,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:28" (1/1) ... [2021-12-17 12:21:28,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:28" (1/1) ... [2021-12-17 12:21:28,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:28" (1/1) ... [2021-12-17 12:21:28,799 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:28" (1/1) ... [2021-12-17 12:21:28,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:28" (1/1) ... [2021-12-17 12:21:28,806 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:28" (1/1) ... [2021-12-17 12:21:28,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:28" (1/1) ... [2021-12-17 12:21:28,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 12:21:28,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 12:21:28,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 12:21:28,810 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 12:21:28,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:28" (1/1) ... [2021-12-17 12:21:28,823 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 12:21:28,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 12:21:28,843 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 12:21:28,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 12:21:28,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 12:21:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 12:21:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 12:21:28,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 12:21:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-17 12:21:28,875 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-17 12:21:28,939 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 12:21:28,941 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 12:21:29,974 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 12:21:29,978 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 12:21:29,978 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 12:21:29,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 12:21:29 BoogieIcfgContainer [2021-12-17 12:21:29,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 12:21:29,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 12:21:29,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 12:21:29,983 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 12:21:29,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 12:21:28" (1/3) ... [2021-12-17 12:21:29,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d8d2409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 12:21:29, skipping insertion in model container [2021-12-17 12:21:29,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:21:28" (2/3) ... [2021-12-17 12:21:29,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d8d2409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 12:21:29, skipping insertion in model container [2021-12-17 12:21:29,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 12:21:29" (3/3) ... [2021-12-17 12:21:29,985 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound10.c [2021-12-17 12:21:29,988 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 12:21:29,989 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 12:21:30,020 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 12:21:30,025 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 12:21:30,025 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 12:21:30,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 12:21:30,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-17 12:21:30,038 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:21:30,039 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:21:30,039 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:21:30,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:21:30,043 INFO L85 PathProgramCache]: Analyzing trace with hash -589467074, now seen corresponding path program 1 times [2021-12-17 12:21:30,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 12:21:30,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319317004] [2021-12-17 12:21:30,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:21:30,052 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 12:21:30,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 12:21:30,065 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 12:21:30,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-17 12:21:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 12:21:30,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-17 12:21:30,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:21:30,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 12:21:30,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 12:21:30,439 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 12:21:30,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319317004] [2021-12-17 12:21:30,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319317004] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 12:21:30,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 12:21:30,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 12:21:30,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380545082] [2021-12-17 12:21:30,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 12:21:30,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 12:21:30,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 12:21:30,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 12:21:30,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 12:21:30,476 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 12:21:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:21:30,494 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2021-12-17 12:21:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 12:21:30,496 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-17 12:21:30,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:21:30,500 INFO L225 Difference]: With dead ends: 33 [2021-12-17 12:21:30,500 INFO L226 Difference]: Without dead ends: 14 [2021-12-17 12:21:30,502 INFO L932 BasicCegarLoop]: 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 [2021-12-17 12:21:30,504 INFO L933 BasicCegarLoop]: 19 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, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 12:21:30,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 12:21:30,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-12-17 12:21:30,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-17 12:21:30,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 12:21:30,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-12-17 12:21:30,526 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2021-12-17 12:21:30,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:21:30,527 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-12-17 12:21:30,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 12:21:30,527 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-12-17 12:21:30,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-17 12:21:30,528 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:21:30,528 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:21:30,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-17 12:21:30,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 12:21:30,747 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:21:30,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:21:30,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1187327748, now seen corresponding path program 1 times [2021-12-17 12:21:30,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 12:21:30,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477233609] [2021-12-17 12:21:30,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:21:30,753 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 12:21:30,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 12:21:30,755 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 12:21:30,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-17 12:21:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 12:21:32,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-17 12:21:32,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:22:33,275 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv10 32))) (let ((.cse1 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)))))))) (or (and .cse1 (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (not .cse1))))))) is different from false [2021-12-17 12:22:35,312 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv10 32))) (let ((.cse1 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)))))))) (or (and .cse1 (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (not .cse1))))))) is different from true [2021-12-17 12:23:25,480 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (let ((.cse0 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)))))))) (or (and .cse0 (= c___VERIFIER_assert_~cond (_ bv1 32))) (and (not .cse0) (= c___VERIFIER_assert_~cond (_ bv0 32))))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv10 32)))))) is different from true [2021-12-17 12:23:42,065 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (not (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv10 32)))))) is different from false [2021-12-17 12:23:44,107 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (not (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv10 32)))))) is different from true [2021-12-17 12:23:44,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 12:23:44,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 12:23:44,108 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 12:23:44,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477233609] [2021-12-17 12:23:44,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477233609] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 12:23:44,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 12:23:44,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 12:23:44,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121253002] [2021-12-17 12:23:44,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 12:23:44,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 12:23:44,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 12:23:44,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 12:23:44,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=18, Unknown=5, NotChecked=30, Total=72 [2021-12-17 12:23:44,111 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 12:23:58,766 WARN L227 SmtUtils]: Spent 13.37s on a formula simplification. DAG size of input: 28 DAG size of output: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 12:24:01,911 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv10 32))) (let ((.cse1 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)))))))) (or (and .cse1 (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (not .cse1)))))))) is different from false [2021-12-17 12:24:04,286 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 12:24:06,413 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 12:24:06,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:24:06,415 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2021-12-17 12:24:06,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 12:24:06,459 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-17 12:24:06,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:24:06,460 INFO L225 Difference]: With dead ends: 21 [2021-12-17 12:24:06,460 INFO L226 Difference]: Without dead ends: 19 [2021-12-17 12:24:06,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.6s TimeCoverageRelationStatistics Valid=33, Invalid=33, Unknown=6, NotChecked=60, Total=132 [2021-12-17 12:24:06,461 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2021-12-17 12:24:06,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 14 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 2 Unknown, 41 Unchecked, 6.2s Time] [2021-12-17 12:24:06,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-12-17 12:24:06,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2021-12-17 12:24:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 12:24:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2021-12-17 12:24:06,465 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2021-12-17 12:24:06,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:24:06,466 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-12-17 12:24:06,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 12:24:06,466 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2021-12-17 12:24:06,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-17 12:24:06,466 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:24:06,467 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:24:06,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-17 12:24:06,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 12:24:06,669 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:24:06,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:24:06,669 INFO L85 PathProgramCache]: Analyzing trace with hash -713464030, now seen corresponding path program 1 times [2021-12-17 12:24:06,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 12:24:06,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400822353] [2021-12-17 12:24:06,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:24:06,672 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 12:24:06,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 12:24:06,689 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 12:24:06,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-17 12:24:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 12:24:06,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 12:24:06,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:24:13,268 WARN L838 $PredicateComparison]: unable to prove that (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|)))) is different from false [2021-12-17 12:24:15,336 WARN L860 $PredicateComparison]: unable to prove that (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|)))) is different from true [2021-12-17 12:24:27,835 WARN L838 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| (_ bv1 32)) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|)))))) is different from false [2021-12-17 12:24:36,150 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))))) (= c___VERIFIER_assert_~cond (_ bv1 32))) is different from false [2021-12-17 12:24:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-17 12:24:36,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 12:25:01,077 WARN L227 SmtUtils]: Spent 16.52s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-17 12:25:17,600 WARN L227 SmtUtils]: Spent 16.52s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 271] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-17 12:25:25,957 WARN L860 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|)))))) is different from true [2021-12-17 12:25:40,544 WARN L860 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|)))))) is different from true [2021-12-17 12:25:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-17 12:25:40,551 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 12:25:40,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400822353] [2021-12-17 12:25:40,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1400822353] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 12:25:40,552 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 12:25:40,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-12-17 12:25:40,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267711282] [2021-12-17 12:25:40,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 12:25:40,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 12:25:40,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 12:25:40,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 12:25:40,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=17, Unknown=6, NotChecked=50, Total=90 [2021-12-17 12:25:40,553 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 12:25:42,695 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 12:25:44,703 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 12:25:46,862 WARN L860 $PredicateComparison]: unable to prove that (and (= c___VERIFIER_assert_~cond |c___VERIFIER_assert_#in~cond|) (or (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))))))) is different from true [2021-12-17 12:25:48,938 WARN L860 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)) (or (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))))))) is different from true [2021-12-17 12:25:51,013 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32)) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|)))))) is different from false [2021-12-17 12:25:53,093 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (= c___VERIFIER_assert_~cond |c___VERIFIER_assert_#in~cond|) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))))) (not .cse0) (or (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) .cse0 (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|)))))) (= c___VERIFIER_assert_~cond (_ bv1 32)))) is different from false [2021-12-17 12:25:55,165 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (= c___VERIFIER_assert_~cond |c___VERIFIER_assert_#in~cond|) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))))) (not .cse0) (or (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) .cse0 (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|)))))) (= c___VERIFIER_assert_~cond (_ bv1 32)))) is different from true [2021-12-17 12:25:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:25:55,167 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2021-12-17 12:25:55,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 12:25:55,167 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2021-12-17 12:25:55,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:25:55,168 INFO L225 Difference]: With dead ends: 22 [2021-12-17 12:25:55,168 INFO L226 Difference]: Without dead ends: 17 [2021-12-17 12:25:55,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=25, Invalid=20, Unknown=11, NotChecked=126, Total=182 [2021-12-17 12:25:55,170 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-17 12:25:55,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 2 Unknown, 41 Unchecked, 4.2s Time] [2021-12-17 12:25:55,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-12-17 12:25:55,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-12-17 12:25:55,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 12:25:55,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-12-17 12:25:55,174 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2021-12-17 12:25:55,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:25:55,175 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-12-17 12:25:55,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 12:25:55,175 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-12-17 12:25:55,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-17 12:25:55,175 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:25:55,176 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:25:55,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-17 12:25:55,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 12:25:55,387 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:25:55,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:25:55,387 INFO L85 PathProgramCache]: Analyzing trace with hash -610823942, now seen corresponding path program 1 times [2021-12-17 12:25:55,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 12:25:55,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471772370] [2021-12-17 12:25:55,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:25:55,388 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 12:25:55,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 12:25:55,389 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 12:25:55,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-17 12:25:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 12:25:58,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 12:25:58,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:26:35,239 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv4294967295 32))))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (= |c_ULTIMATE.start_main_~x~0#1| (fp.sub c_currentRoundingMode .cse0 .cse1)) (fp.gt .cse0 .cse1) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv10 32))))) is different from true [2021-12-17 12:27:43,216 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv10 32))) (let ((.cse0 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse1)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse2 .cse3))))))) (or (and .cse0 (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (not .cse0)))) (fp.gt .cse2 .cse3)))) is different from false [2021-12-17 12:27:45,276 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv10 32))) (let ((.cse0 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse1)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse2 .cse3))))))) (or (and .cse0 (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (not .cse0)))) (fp.gt .cse2 .cse3)))) is different from true [2021-12-17 12:28:42,320 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv10 32))) (fp.gt .cse0 .cse1) (let ((.cse2 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse3 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse3)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse0 .cse1))))))) (or (and (= c___VERIFIER_assert_~cond (_ bv0 32)) (not .cse2)) (and .cse2 (= c___VERIFIER_assert_~cond (_ bv1 32)))))))) is different from false [2021-12-17 12:28:44,383 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv10 32))) (fp.gt .cse0 .cse1) (let ((.cse2 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse3 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse3)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse0 .cse1))))))) (or (and (= c___VERIFIER_assert_~cond (_ bv0 32)) (not .cse2)) (and .cse2 (= c___VERIFIER_assert_~cond (_ bv1 32)))))))) is different from true [2021-12-17 12:29:01,292 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv10 32))) (fp.gt .cse0 .cse1) (not (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse2 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse2)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse0 .cse1))))))))) is different from false [2021-12-17 12:29:03,355 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv10 32))) (fp.gt .cse0 .cse1) (not (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse2 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse2)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse0 .cse1))))))))) is different from true [2021-12-17 12:29:03,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-17 12:29:03,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 12:29:10,437 WARN L838 $PredicateComparison]: unable to prove that (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|)))) is different from false [2021-12-17 12:29:12,510 WARN L860 $PredicateComparison]: unable to prove that (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|)))) is different from true [2021-12-17 12:29:27,346 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse1 .cse1)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0))))))) is different from false [2021-12-17 12:29:29,445 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse1 .cse1)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0))))))) is different from true [2021-12-17 12:29:56,560 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~a~0#1|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2))))) (not (fp.gt .cse1 .cse2)))) is different from false [2021-12-17 12:29:58,646 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~a~0#1|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2))))) (not (fp.gt .cse1 .cse2)))) is different from true [2021-12-17 12:30:11,477 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (= (_ bv0 32) |c_ULTIMATE.start_assume_abort_if_not_~cond#1|) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~a~0#1|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2))))) (not (fp.gt .cse1 .cse2)))) is different from false [2021-12-17 12:30:13,562 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (= (_ bv0 32) |c_ULTIMATE.start_assume_abort_if_not_~cond#1|) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~a~0#1|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2))))) (not (fp.gt .cse1 .cse2)))) is different from true [2021-12-17 12:30:30,702 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_10| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_10| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_10| ((_ to_fp 11 53) c_currentRoundingMode (_ bv10 32)))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_10|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2))))) (not (fp.gt .cse1 .cse2))))) is different from false [2021-12-17 12:30:32,785 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_10| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_10| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_10| ((_ to_fp 11 53) c_currentRoundingMode (_ bv10 32)))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_10|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2))))) (not (fp.gt .cse1 .cse2))))) is different from true [2021-12-17 12:30:32,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-17 12:30:32,786 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 12:30:32,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471772370] [2021-12-17 12:30:32,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1471772370] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 12:30:32,786 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 12:30:32,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 17 [2021-12-17 12:30:32,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494124971] [2021-12-17 12:30:32,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 12:30:32,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-17 12:30:32,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 12:30:32,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-17 12:30:32,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=40, Unknown=17, NotChecked=180, Total=272 [2021-12-17 12:30:32,787 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 15 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 12:30:34,872 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~a~0#1_10| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_10| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_10| ((_ to_fp 11 53) c_currentRoundingMode (_ bv10 32)))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_10|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2))))) (not (fp.gt .cse1 .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-12-17 12:30:36,968 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~a~0#1_10| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_10| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_10| ((_ to_fp 11 53) c_currentRoundingMode (_ bv10 32)))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_10|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2))))) (not (fp.gt .cse1 .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-12-17 12:30:39,063 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (= (_ bv0 32) |c_ULTIMATE.start_assume_abort_if_not_~cond#1|) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~a~0#1|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2))))) (not (fp.gt .cse1 .cse2)))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse4 (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv10 32)))) (.cse3 (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse2))) (or (and (or (not .cse3) (not .cse4)) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (and .cse4 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse3))))) is different from false [2021-12-17 12:30:41,150 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (= (_ bv0 32) |c_ULTIMATE.start_assume_abort_if_not_~cond#1|) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~a~0#1|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2))))) (not (fp.gt .cse1 .cse2)))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse4 (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv10 32)))) (.cse3 (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse2))) (or (and (or (not .cse3) (not .cse4)) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (and .cse4 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse3))))) is different from true [2021-12-17 12:30:43,241 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv10 32))) (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse0) (let ((.cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~a~0#1|) .cse1)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse2 .cse0))))) (not (fp.gt .cse2 .cse0)))))) is different from false [2021-12-17 12:30:45,323 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv10 32))) (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse0) (let ((.cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~a~0#1|) .cse1)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse2 .cse0))))) (not (fp.gt .cse2 .cse0)))))) is different from true [2021-12-17 12:30:47,408 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (= |c_ULTIMATE.start_main_~r~0#1| (_ bv0 32)) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse1 .cse1)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0))))))) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv10 32))) (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-12-17 12:30:49,510 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (= |c_ULTIMATE.start_main_~r~0#1| (_ bv0 32)) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse1 .cse1)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0))))))) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv10 32))) (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-12-17 12:30:51,648 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv4294967295 32))))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (= |c_ULTIMATE.start_main_~x~0#1| (fp.sub c_currentRoundingMode .cse0 .cse1)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|)))) (fp.gt .cse0 .cse1) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv10 32))))) is different from false [2021-12-17 12:30:53,760 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv4294967295 32))))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (= |c_ULTIMATE.start_main_~x~0#1| (fp.sub c_currentRoundingMode .cse0 .cse1)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|)))) (fp.gt .cse0 .cse1) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv10 32))))) is different from true [2021-12-17 12:30:55,845 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv10 32))) (let ((.cse0 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse1)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse2 .cse3))))))) (or (and .cse0 (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (not .cse0)))) (fp.gt .cse2 .cse3)))) (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|))) is different from false [2021-12-17 12:30:57,938 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv10 32))) (fp.gt .cse0 .cse1) (let ((.cse2 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse3 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse3)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse0 .cse1))))))) (or (and (= c___VERIFIER_assert_~cond (_ bv0 32)) (not .cse2)) (and .cse2 (= c___VERIFIER_assert_~cond (_ bv1 32)))))))) (not (= (_ bv0 32) c___VERIFIER_assert_~cond))) is different from false [2021-12-17 12:30:57,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:30:57,953 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2021-12-17 12:30:57,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 12:30:57,954 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 15 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2021-12-17 12:30:57,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:30:57,954 INFO L225 Difference]: With dead ends: 28 [2021-12-17 12:30:57,954 INFO L226 Difference]: Without dead ends: 26 [2021-12-17 12:30:57,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 66.7s TimeCoverageRelationStatistics Valid=53, Invalid=54, Unknown=29, NotChecked=464, Total=600 [2021-12-17 12:30:57,955 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 12:30:57,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 36 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 107 Unchecked, 0.0s Time] [2021-12-17 12:30:57,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-17 12:30:57,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-12-17 12:30:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 20 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 12:30:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2021-12-17 12:30:57,959 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 16 [2021-12-17 12:30:57,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:30:57,960 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2021-12-17 12:30:57,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 15 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 12:30:57,960 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2021-12-17 12:30:57,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-17 12:30:57,960 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:30:57,960 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-17 12:30:57,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-17 12:30:58,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 12:30:58,161 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:30:58,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:30:58,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1159254460, now seen corresponding path program 2 times [2021-12-17 12:30:58,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 12:30:58,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383567484] [2021-12-17 12:30:58,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 12:30:58,162 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 12:30:58,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 12:30:58,165 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 12:30:58,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-17 12:31:03,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 12:31:03,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 12:31:03,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-17 12:31:03,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:31:15,110 WARN L227 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 12:31:40,710 WARN L227 SmtUtils]: Spent 6.48s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 12:32:42,888 WARN L227 SmtUtils]: Spent 16.25s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 12:33:54,675 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (let ((.cse0 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv4 32)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse2 .cse3)))))))) (or (and .cse0 (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (not .cse0)))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv10 32))) (fp.gt .cse2 .cse3)))) is different from false [2021-12-17 12:33:56,742 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (let ((.cse0 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv4 32)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse2 .cse3)))))))) (or (and .cse0 (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (not .cse0)))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv10 32))) (fp.gt .cse2 .cse3)))) is different from true [2021-12-17 12:34:54,128 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv10 32))) (fp.gt .cse0 .cse1) (let ((.cse2 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv4 32)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven .cse0 .cse1)))))))) (or (and (not .cse2) (= c___VERIFIER_assert_~cond (_ bv0 32))) (and .cse2 (= c___VERIFIER_assert_~cond (_ bv1 32)))))))) is different from false [2021-12-17 12:34:56,194 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv10 32))) (fp.gt .cse0 .cse1) (let ((.cse2 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv4 32)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven .cse0 .cse1)))))))) (or (and (not .cse2) (= c___VERIFIER_assert_~cond (_ bv0 32))) (and .cse2 (= c___VERIFIER_assert_~cond (_ bv1 32)))))))) is different from true [2021-12-17 12:35:12,977 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv10 32))) (not (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv4 32)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse0) (fp.mul roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven .cse1 .cse2))))))) (fp.gt .cse1 .cse2)))) is different from false [2021-12-17 12:35:15,037 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv10 32))) (not (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv4 32)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse0) (fp.mul roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven .cse1 .cse2))))))) (fp.gt .cse1 .cse2)))) is different from true [2021-12-17 12:35:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 2 times theorem prover too weak. 4 trivial. 4 not checked. [2021-12-17 12:35:15,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 12:35:27,621 WARN L838 $PredicateComparison]: unable to prove that (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|)))) is different from false [2021-12-17 12:35:29,689 WARN L860 $PredicateComparison]: unable to prove that (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|)))) is different from true [2021-12-17 12:35:44,382 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse1 .cse1)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0))))))) is different from false [2021-12-17 12:35:46,470 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse1 .cse1)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0))))))) is different from true Killed by 15