./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.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_valuebound50.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 2fdde3d352865d24f00edfb02cdd5994421923a5ea92d15a0168523776b8ab34 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 12:24:03,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 12:24:03,665 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 12:24:03,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 12:24:03,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 12:24:03,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 12:24:03,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 12:24:03,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 12:24:03,702 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 12:24:03,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 12:24:03,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 12:24:03,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 12:24:03,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 12:24:03,705 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 12:24:03,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 12:24:03,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 12:24:03,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 12:24:03,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 12:24:03,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 12:24:03,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 12:24:03,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 12:24:03,711 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 12:24:03,712 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 12:24:03,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 12:24:03,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 12:24:03,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 12:24:03,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 12:24:03,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 12:24:03,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 12:24:03,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 12:24:03,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 12:24:03,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 12:24:03,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 12:24:03,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 12:24:03,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 12:24:03,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 12:24:03,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 12:24:03,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 12:24:03,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 12:24:03,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 12:24:03,727 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 12:24:03,728 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:24:03,748 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 12:24:03,749 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 12:24:03,750 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 12:24:03,750 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 12:24:03,751 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 12:24:03,751 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 12:24:03,751 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 12:24:03,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 12:24:03,752 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 12:24:03,752 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 12:24:03,753 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 12:24:03,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 12:24:03,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 12:24:03,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 12:24:03,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 12:24:03,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 12:24:03,753 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 12:24:03,754 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 12:24:03,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 12:24:03,754 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 12:24:03,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 12:24:03,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 12:24:03,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 12:24:03,755 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 12:24:03,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 12:24:03,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 12:24:03,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 12:24:03,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 12:24:03,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 12:24:03,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 12:24:03,756 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 12:24:03,756 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 12:24:03,756 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 12:24:03,756 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 12:24:03,756 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 -> 2fdde3d352865d24f00edfb02cdd5994421923a5ea92d15a0168523776b8ab34 [2021-12-17 12:24:03,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 12:24:03,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 12:24:03,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 12:24:03,959 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 12:24:03,959 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 12:24:03,960 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2021-12-17 12:24:04,010 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45434b6ba/512515626338482bb45991c4bc239b03/FLAG2859d8dd2 [2021-12-17 12:24:04,386 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 12:24:04,387 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2021-12-17 12:24:04,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45434b6ba/512515626338482bb45991c4bc239b03/FLAG2859d8dd2 [2021-12-17 12:24:04,399 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45434b6ba/512515626338482bb45991c4bc239b03 [2021-12-17 12:24:04,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 12:24:04,401 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 12:24:04,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 12:24:04,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 12:24:04,405 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 12:24:04,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 12:24:04" (1/1) ... [2021-12-17 12:24:04,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a00db72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:24:04, skipping insertion in model container [2021-12-17 12:24:04,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 12:24:04" (1/1) ... [2021-12-17 12:24:04,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 12:24:04,421 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 12:24:04,528 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_valuebound50.c[712,725] [2021-12-17 12:24:04,541 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 12:24:04,546 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 12:24:04,557 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_valuebound50.c[712,725] [2021-12-17 12:24:04,563 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 12:24:04,572 INFO L208 MainTranslator]: Completed translation [2021-12-17 12:24:04,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:24:04 WrapperNode [2021-12-17 12:24:04,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 12:24:04,575 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 12:24:04,575 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 12:24:04,576 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 12:24:04,580 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:24:04" (1/1) ... [2021-12-17 12:24:04,586 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:24:04" (1/1) ... [2021-12-17 12:24:04,598 INFO L137 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2021-12-17 12:24:04,598 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 12:24:04,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 12:24:04,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 12:24:04,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 12:24:04,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:24:04" (1/1) ... [2021-12-17 12:24:04,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:24:04" (1/1) ... [2021-12-17 12:24:04,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:24:04" (1/1) ... [2021-12-17 12:24:04,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:24:04" (1/1) ... [2021-12-17 12:24:04,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:24:04" (1/1) ... [2021-12-17 12:24:04,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:24:04" (1/1) ... [2021-12-17 12:24:04,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:24:04" (1/1) ... [2021-12-17 12:24:04,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 12:24:04,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 12:24:04,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 12:24:04,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 12:24:04,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:24:04" (1/1) ... [2021-12-17 12:24:04,637 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 12:24:04,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 12:24:04,656 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:24:04,662 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:24:04,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 12:24:04,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 12:24:04,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 12:24:04,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 12:24:04,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-17 12:24:04,687 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-17 12:24:04,727 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 12:24:04,728 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 12:24:04,789 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 12:24:04,793 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 12:24:04,793 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 12:24:04,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 12:24:04 BoogieIcfgContainer [2021-12-17 12:24:04,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 12:24:04,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 12:24:04,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 12:24:04,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 12:24:04,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 12:24:04" (1/3) ... [2021-12-17 12:24:04,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4aeb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 12:24:04, skipping insertion in model container [2021-12-17 12:24:04,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:24:04" (2/3) ... [2021-12-17 12:24:04,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4aeb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 12:24:04, skipping insertion in model container [2021-12-17 12:24:04,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 12:24:04" (3/3) ... [2021-12-17 12:24:04,801 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound50.c [2021-12-17 12:24:04,805 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 12:24:04,805 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 12:24:04,833 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 12:24:04,838 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:24:04,838 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 12:24:04,856 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:24:04,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-17 12:24:04,862 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:24:04,862 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:24:04,862 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:24:04,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:24:04,866 INFO L85 PathProgramCache]: Analyzing trace with hash -589467074, now seen corresponding path program 1 times [2021-12-17 12:24:04,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 12:24:04,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280152005] [2021-12-17 12:24:04,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:24:04,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 12:24:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 12:24:04,965 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:24:04,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 12:24:04,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280152005] [2021-12-17 12:24:04,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280152005] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 12:24:04,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 12:24:04,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 12:24:04,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664067735] [2021-12-17 12:24:04,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 12:24:04,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 12:24:04,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 12:24:04,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 12:24:05,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 12:24:05,001 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:24:05,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:24:05,038 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2021-12-17 12:24:05,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 12:24:05,042 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:24:05,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:24:05,047 INFO L225 Difference]: With dead ends: 33 [2021-12-17 12:24:05,047 INFO L226 Difference]: Without dead ends: 14 [2021-12-17 12:24:05,051 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:24:05,055 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:24:05,055 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:24:05,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-12-17 12:24:05,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-17 12:24:05,077 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:24:05,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-12-17 12:24:05,079 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2021-12-17 12:24:05,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:24:05,079 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-12-17 12:24:05,079 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:24:05,080 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-12-17 12:24:05,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-17 12:24:05,080 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:24:05,080 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:24:05,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 12:24:05,080 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:24:05,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:24:05,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1187327748, now seen corresponding path program 1 times [2021-12-17 12:24:05,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 12:24:05,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126799250] [2021-12-17 12:24:05,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:24:05,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 12:24:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 12:24:05,094 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 12:24:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 12:24:05,112 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 12:24:05,112 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 12:24:05,113 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 12:24:05,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 12:24:05,116 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-12-17 12:24:05,118 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 12:24:05,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 12:24:05 BoogieIcfgContainer [2021-12-17 12:24:05,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 12:24:05,138 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 12:24:05,138 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 12:24:05,139 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 12:24:05,139 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 12:24:04" (3/4) ... [2021-12-17 12:24:05,142 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-17 12:24:05,142 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 12:24:05,143 INFO L158 Benchmark]: Toolchain (without parser) took 741.04ms. Allocated memory was 81.8MB in the beginning and 104.9MB in the end (delta: 23.1MB). Free memory was 46.8MB in the beginning and 74.0MB in the end (delta: -27.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 12:24:05,143 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 81.8MB. Free memory was 62.9MB in the beginning and 62.8MB in the end (delta: 41.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 12:24:05,146 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.96ms. Allocated memory was 81.8MB in the beginning and 104.9MB in the end (delta: 23.1MB). Free memory was 46.6MB in the beginning and 81.8MB in the end (delta: -35.2MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2021-12-17 12:24:05,147 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.20ms. Allocated memory is still 104.9MB. Free memory was 81.6MB in the beginning and 80.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 12:24:05,149 INFO L158 Benchmark]: Boogie Preprocessor took 31.82ms. Allocated memory is still 104.9MB. Free memory was 80.2MB in the beginning and 79.3MB in the end (delta: 952.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 12:24:05,149 INFO L158 Benchmark]: RCFGBuilder took 163.55ms. Allocated memory is still 104.9MB. Free memory was 79.2MB in the beginning and 70.4MB in the end (delta: 8.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 12:24:05,149 INFO L158 Benchmark]: TraceAbstraction took 341.97ms. Allocated memory is still 104.9MB. Free memory was 70.0MB in the beginning and 74.4MB in the end (delta: -4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 12:24:05,149 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 104.9MB. Free memory was 74.4MB in the beginning and 74.0MB in the end (delta: 391.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 12:24:05,154 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.16ms. Allocated memory is still 81.8MB. Free memory was 62.9MB in the beginning and 62.8MB in the end (delta: 41.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 169.96ms. Allocated memory was 81.8MB in the beginning and 104.9MB in the end (delta: 23.1MB). Free memory was 46.6MB in the beginning and 81.8MB in the end (delta: -35.2MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.20ms. Allocated memory is still 104.9MB. Free memory was 81.6MB in the beginning and 80.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.82ms. Allocated memory is still 104.9MB. Free memory was 80.2MB in the beginning and 79.3MB in the end (delta: 952.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 163.55ms. Allocated memory is still 104.9MB. Free memory was 79.2MB in the beginning and 70.4MB in the end (delta: 8.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 341.97ms. Allocated memory is still 104.9MB. Free memory was 70.0MB in the beginning and 74.4MB in the end (delta: -4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 104.9MB. Free memory was 74.4MB in the beginning and 74.0MB in the end (delta: 391.4kB). 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<=50) [L14] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L28] RET assume_abort_if_not(a>=0 && a<=50) [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:24:05,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.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 2fdde3d352865d24f00edfb02cdd5994421923a5ea92d15a0168523776b8ab34 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 12:24:06,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 12:24:06,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 12:24:06,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 12:24:06,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 12:24:06,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 12:24:06,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 12:24:06,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 12:24:06,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 12:24:06,852 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 12:24:06,853 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 12:24:06,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 12:24:06,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 12:24:06,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 12:24:06,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 12:24:06,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 12:24:06,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 12:24:06,864 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 12:24:06,865 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 12:24:06,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 12:24:06,872 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 12:24:06,872 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 12:24:06,873 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 12:24:06,874 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 12:24:06,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 12:24:06,876 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 12:24:06,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 12:24:06,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 12:24:06,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 12:24:06,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 12:24:06,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 12:24:06,879 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 12:24:06,880 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 12:24:06,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 12:24:06,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 12:24:06,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 12:24:06,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 12:24:06,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 12:24:06,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 12:24:06,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 12:24:06,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 12:24:06,884 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:24:06,918 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 12:24:06,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 12:24:06,919 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 12:24:06,919 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 12:24:06,920 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 12:24:06,920 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 12:24:06,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 12:24:06,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 12:24:06,921 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 12:24:06,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 12:24:06,922 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 12:24:06,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 12:24:06,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 12:24:06,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 12:24:06,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 12:24:06,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 12:24:06,923 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-17 12:24:06,923 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-17 12:24:06,923 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-17 12:24:06,923 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 12:24:06,923 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 12:24:06,923 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 12:24:06,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 12:24:06,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 12:24:06,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 12:24:06,924 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 12:24:06,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 12:24:06,924 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 12:24:06,924 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 12:24:06,924 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 12:24:06,924 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-17 12:24:06,925 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-17 12:24:06,925 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 12:24:06,925 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 12:24:06,925 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 12:24:06,925 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 12:24:06,925 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-17 12:24:06,926 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 -> 2fdde3d352865d24f00edfb02cdd5994421923a5ea92d15a0168523776b8ab34 [2021-12-17 12:24:07,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 12:24:07,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 12:24:07,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 12:24:07,165 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 12:24:07,166 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 12:24:07,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2021-12-17 12:24:07,225 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b51c05dd0/1bc356cf4d874041abff7f4666586ae2/FLAG701c98ce0 [2021-12-17 12:24:07,561 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 12:24:07,562 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2021-12-17 12:24:07,567 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b51c05dd0/1bc356cf4d874041abff7f4666586ae2/FLAG701c98ce0 [2021-12-17 12:24:07,578 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b51c05dd0/1bc356cf4d874041abff7f4666586ae2 [2021-12-17 12:24:07,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 12:24:07,582 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 12:24:07,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 12:24:07,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 12:24:07,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 12:24:07,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 12:24:07" (1/1) ... [2021-12-17 12:24:07,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f9e9fe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:24:07, skipping insertion in model container [2021-12-17 12:24:07,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 12:24:07" (1/1) ... [2021-12-17 12:24:07,593 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 12:24:07,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 12:24:07,734 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_valuebound50.c[712,725] [2021-12-17 12:24:07,749 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 12:24:07,767 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 12:24:07,803 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_valuebound50.c[712,725] [2021-12-17 12:24:07,814 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 12:24:07,825 INFO L208 MainTranslator]: Completed translation [2021-12-17 12:24:07,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:24:07 WrapperNode [2021-12-17 12:24:07,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 12:24:07,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 12:24:07,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 12:24:07,828 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 12:24:07,832 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:24:07" (1/1) ... [2021-12-17 12:24:07,844 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:24:07" (1/1) ... [2021-12-17 12:24:07,856 INFO L137 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2021-12-17 12:24:07,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 12:24:07,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 12:24:07,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 12:24:07,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 12:24:07,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:24:07" (1/1) ... [2021-12-17 12:24:07,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:24:07" (1/1) ... [2021-12-17 12:24:07,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:24:07" (1/1) ... [2021-12-17 12:24:07,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:24:07" (1/1) ... [2021-12-17 12:24:07,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:24:07" (1/1) ... [2021-12-17 12:24:07,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:24:07" (1/1) ... [2021-12-17 12:24:07,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:24:07" (1/1) ... [2021-12-17 12:24:07,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 12:24:07,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 12:24:07,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 12:24:07,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 12:24:07,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:24:07" (1/1) ... [2021-12-17 12:24:07,901 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 12:24:07,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 12:24:07,917 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:24:07,929 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:24:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 12:24:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 12:24:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 12:24:07,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 12:24:07,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-17 12:24:07,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-17 12:24:08,006 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 12:24:08,008 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 12:24:08,976 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 12:24:08,984 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 12:24:08,984 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 12:24:08,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 12:24:08 BoogieIcfgContainer [2021-12-17 12:24:08,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 12:24:08,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 12:24:08,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 12:24:08,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 12:24:08,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 12:24:07" (1/3) ... [2021-12-17 12:24:08,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266fc604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 12:24:08, skipping insertion in model container [2021-12-17 12:24:08,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:24:07" (2/3) ... [2021-12-17 12:24:08,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266fc604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 12:24:08, skipping insertion in model container [2021-12-17 12:24:08,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 12:24:08" (3/3) ... [2021-12-17 12:24:08,992 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound50.c [2021-12-17 12:24:08,996 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 12:24:08,996 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 12:24:09,037 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 12:24:09,041 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:24:09,042 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 12:24:09,052 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:24:09,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-17 12:24:09,055 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:24:09,055 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:24:09,056 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:24:09,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:24:09,059 INFO L85 PathProgramCache]: Analyzing trace with hash -589467074, now seen corresponding path program 1 times [2021-12-17 12:24:09,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 12:24:09,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080927693] [2021-12-17 12:24:09,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:24:09,068 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 12:24:09,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 12:24:09,072 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:24:09,100 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:24:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 12:24:09,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-17 12:24:09,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:24:09,435 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:24:09,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 12:24:09,436 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 12:24:09,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080927693] [2021-12-17 12:24:09,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080927693] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 12:24:09,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 12:24:09,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 12:24:09,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428029203] [2021-12-17 12:24:09,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 12:24:09,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 12:24:09,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 12:24:09,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 12:24:09,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 12:24:09,471 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:24:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:24:09,484 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2021-12-17 12:24:09,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 12:24:09,487 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:24:09,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:24:09,491 INFO L225 Difference]: With dead ends: 33 [2021-12-17 12:24:09,491 INFO L226 Difference]: Without dead ends: 14 [2021-12-17 12:24:09,493 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:24:09,496 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:24:09,496 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:24:09,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-12-17 12:24:09,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-17 12:24:09,516 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:24:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-12-17 12:24:09,517 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2021-12-17 12:24:09,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:24:09,517 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-12-17 12:24:09,517 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:24:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-12-17 12:24:09,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-17 12:24:09,518 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:24:09,518 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:24:09,533 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:24:09,724 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:24:09,724 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:24:09,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:24:09,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1187327748, now seen corresponding path program 1 times [2021-12-17 12:24:09,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 12:24:09,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872993657] [2021-12-17 12:24:09,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:24:09,726 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 12:24:09,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 12:24:09,729 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:24:09,730 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:24:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 12:24:10,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-17 12:24:10,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:25:01,827 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) (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)))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32)))))) is different from true [2021-12-17 12:25:58,281 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 (_ bv50 32)))))) is different from true [2021-12-17 12:26:14,829 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 (_ bv50 32)))))) is different from false [2021-12-17 12:26:16,868 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 (_ bv50 32)))))) is different from true [2021-12-17 12:26:16,868 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:26:16,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 12:26:16,869 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 12:26:16,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872993657] [2021-12-17 12:26:16,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872993657] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 12:26:16,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 12:26:16,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 12:26:16,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085122318] [2021-12-17 12:26:16,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 12:26:16,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-17 12:26:16,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 12:26:16,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-17 12:26:16,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=19, Unknown=4, NotChecked=30, Total=72 [2021-12-17 12:26:16,871 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:26:32,184 WARN L227 SmtUtils]: Spent 12.04s 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:26:34,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 12:26:36,415 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 12:26:38,562 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) (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)))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))))))) is different from false [2021-12-17 12:26:39,984 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 12:26:42,116 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:26:44,345 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 12:26:46,352 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 12:26:46,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:26:46,668 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2021-12-17 12:26:46,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 12:26:46,680 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:26:46,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:26:46,681 INFO L225 Difference]: With dead ends: 28 [2021-12-17 12:26:46,681 INFO L226 Difference]: Without dead ends: 24 [2021-12-17 12:26:46,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=33, Invalid=34, Unknown=5, NotChecked=60, Total=132 [2021-12-17 12:26:46,682 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2021-12-17 12:26:46,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 31 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 5 Unknown, 74 Unchecked, 13.0s Time] [2021-12-17 12:26:46,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-12-17 12:26:46,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2021-12-17 12:26:46,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 12:26:46,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2021-12-17 12:26:46,687 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 9 [2021-12-17 12:26:46,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:26:46,687 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-12-17 12:26:46,687 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:26:46,688 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2021-12-17 12:26:46,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-17 12:26:46,688 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:26:46,689 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:26:46,705 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:26:46,889 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:26:46,890 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:26:46,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:26:46,891 INFO L85 PathProgramCache]: Analyzing trace with hash -713464030, now seen corresponding path program 1 times [2021-12-17 12:26:46,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 12:26:46,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556653546] [2021-12-17 12:26:46,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:26:46,892 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 12:26:46,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 12:26:46,893 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:26:46,895 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:26:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 12:26:47,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 12:26:47,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:26:53,456 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:26:55,520 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:27:07,959 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:27:16,295 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:27:16,310 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:27:16,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 12:27:41,284 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:27:57,803 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:28:06,135 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:28:20,787 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:28:20,805 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:28:20,806 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 12:28:20,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556653546] [2021-12-17 12:28:20,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556653546] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 12:28:20,806 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 12:28:20,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-12-17 12:28:20,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054399871] [2021-12-17 12:28:20,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 12:28:20,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 12:28:20,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 12:28:20,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 12:28:20,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=17, Unknown=6, NotChecked=50, Total=90 [2021-12-17 12:28:20,807 INFO L87 Difference]: Start difference. First operand 22 states and 25 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:28:22,973 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 12:28:24,977 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 12:28:27,158 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:28:29,239 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:28:31,307 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:28:33,385 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) (= c___VERIFIER_assert_~cond (_ bv1 32)) (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|)))))))) is different from false [2021-12-17 12:28:35,451 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) (= c___VERIFIER_assert_~cond (_ bv1 32)) (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|)))))))) is different from true [2021-12-17 12:28:35,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:28:35,453 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2021-12-17 12:28:35,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 12:28:35,453 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:28:35,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:28:35,454 INFO L225 Difference]: With dead ends: 26 [2021-12-17 12:28:35,454 INFO L226 Difference]: Without dead ends: 18 [2021-12-17 12:28:35,454 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:28:35,455 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2021-12-17 12:28:35,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 2 Unknown, 43 Unchecked, 4.3s Time] [2021-12-17 12:28:35,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-12-17 12:28:35,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2021-12-17 12:28:35,458 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:28:35,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-12-17 12:28:35,458 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2021-12-17 12:28:35,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:28:35,459 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-12-17 12:28:35,459 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:28:35,459 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-12-17 12:28:35,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-17 12:28:35,462 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:28:35,462 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:28:35,479 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:28:35,664 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:28:35,665 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:28:35,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:28:35,665 INFO L85 PathProgramCache]: Analyzing trace with hash -610823942, now seen corresponding path program 1 times [2021-12-17 12:28:35,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 12:28:35,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923978067] [2021-12-17 12:28:35,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:28:35,666 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 12:28:35,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 12:28:35,667 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:28:35,668 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:28:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 12:28:37,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 12:28:37,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:28:50,025 WARN L227 SmtUtils]: Spent 5.26s 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:29:32,129 WARN L227 SmtUtils]: Spent 10.81s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 12:30:32,701 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 (_ bv50 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:30:34,772 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 (_ bv50 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:31:31,518 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 (_ bv50 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:31:33,576 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 (_ bv50 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:31:50,299 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 (_ bv50 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:31:52,348 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 (_ bv50 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:31:52,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-17 12:31:52,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 12:32:00,683 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:32:02,745 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:32:17,439 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:32:19,531 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:32:46,920 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:32:49,020 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:33:03,750 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:33:05,830 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:33:22,832 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 (_ bv50 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:33:24,910 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 (_ bv50 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:33:24,911 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:33:24,911 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 12:33:24,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923978067] [2021-12-17 12:33:24,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923978067] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 12:33:24,911 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 12:33:24,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 17 [2021-12-17 12:33:24,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031382990] [2021-12-17 12:33:24,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 12:33:24,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-17 12:33:24,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 12:33:24,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-17 12:33:24,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=49, Unknown=18, NotChecked=168, Total=272 [2021-12-17 12:33:24,913 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:33:26,984 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (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 (_ bv50 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:33:29,068 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (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 (_ bv50 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:33:31,144 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 (_ bv50 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:33:33,229 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 (_ bv50 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:33:35,310 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ 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 (_ bv50 32))) (let ((.cse1 (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 ((.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)))) (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse2))) is different from false [2021-12-17 12:33:37,388 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ 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 (_ bv50 32))) (let ((.cse1 (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 ((.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)))) (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse2))) is different from true [2021-12-17 12:33:39,464 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))) (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))))))) (= |c_ULTIMATE.start_main_~r~0#1| (_ bv0 32)) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 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:33:41,554 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))) (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))))))) (= |c_ULTIMATE.start_main_~r~0#1| (_ bv0 32)) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 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:33:43,680 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.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32))) (fp.gt .cse0 .cse1))) is different from false [2021-12-17 12:33:45,779 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.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32))) (fp.gt .cse0 .cse1))) is different from true [2021-12-17 12:33:47,855 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 (_ bv50 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:33:49,942 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 (_ bv50 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:33:49,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:33:49,958 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2021-12-17 12:33:49,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 12:33:49,958 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:33:49,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:33:49,960 INFO L225 Difference]: With dead ends: 26 [2021-12-17 12:33:49,960 INFO L226 Difference]: Without dead ends: 24 [2021-12-17 12:33:49,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 89.1s TimeCoverageRelationStatistics Valid=55, Invalid=65, Unknown=30, NotChecked=450, Total=600 [2021-12-17 12:33:49,961 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 12:33:49,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 30 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 76 Unchecked, 0.0s Time] [2021-12-17 12:33:49,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-12-17 12:33:49,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-12-17 12:33:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 12:33:49,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2021-12-17 12:33:49,967 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 16 [2021-12-17 12:33:49,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:33:49,967 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2021-12-17 12:33:49,967 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:33:49,968 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2021-12-17 12:33:49,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-17 12:33:49,968 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:33:49,969 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-17 12:33:49,996 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:33:50,169 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:33:50,169 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:33:50,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:33:50,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1159254460, now seen corresponding path program 2 times [2021-12-17 12:33:50,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 12:33:50,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045053527] [2021-12-17 12:33:50,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 12:33:50,170 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 12:33:50,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 12:33:50,171 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:33:50,173 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:33:54,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 12:33:54,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 12:33:54,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-17 12:33:54,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:34:04,821 WARN L227 SmtUtils]: Spent 5.67s 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:34:31,240 WARN L227 SmtUtils]: Spent 9.62s 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:35:08,177 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (and (= |c_ULTIMATE.start_main_~r~0#1| (_ bv2 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.gt .cse0 .cse1) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32))) (= |c_ULTIMATE.start_main_~x~0#1| (fp.sub c_currentRoundingMode .cse0 .cse1)))) is different from false [2021-12-17 12:36:18,191 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 (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (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.gt .cse2 .cse3)))) is different from false [2021-12-17 12:36:20,253 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 (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (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.gt .cse2 .cse3)))) is different from true [2021-12-17 12:37:16,107 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 (_ bv50 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:37:18,169 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 (_ bv50 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:37:34,350 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 (_ bv50 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:37:36,408 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 (_ bv50 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:37:36,408 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 8 not checked. [2021-12-17 12:37:36,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 12:37:44,703 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:37:46,771 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:38:01,442 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:38:03,530 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:38:35,366 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (let ((.cse1 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32))))) (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse0)) (not (fp.gt .cse1 .cse2)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv2 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse3 .cse3)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse3))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2)))))))) is different from false [2021-12-17 12:38:37,473 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (let ((.cse1 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32))))) (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse0)) (not (fp.gt .cse1 .cse2)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv2 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse3 .cse3)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse3))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2)))))))) is different from true Killed by 15