./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.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 6f9bb533a6ae968b56a3b4121531d019ea186c25a1e8156a6682080f16505ca3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 13:54:48,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 13:54:48,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 13:54:48,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 13:54:48,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 13:54:48,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 13:54:48,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 13:54:48,605 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 13:54:48,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 13:54:48,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 13:54:48,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 13:54:48,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 13:54:48,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 13:54:48,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 13:54:48,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 13:54:48,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 13:54:48,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 13:54:48,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 13:54:48,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 13:54:48,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 13:54:48,624 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 13:54:48,625 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 13:54:48,625 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 13:54:48,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 13:54:48,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 13:54:48,632 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 13:54:48,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 13:54:48,633 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 13:54:48,634 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 13:54:48,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 13:54:48,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 13:54:48,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 13:54:48,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 13:54:48,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 13:54:48,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 13:54:48,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 13:54:48,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 13:54:48,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 13:54:48,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 13:54:48,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 13:54:48,640 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 13:54:48,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 13:54:48,643 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 13:54:48,666 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 13:54:48,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 13:54:48,667 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 13:54:48,667 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 13:54:48,668 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 13:54:48,668 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 13:54:48,669 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 13:54:48,669 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 13:54:48,669 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 13:54:48,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 13:54:48,670 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 13:54:48,670 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 13:54:48,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 13:54:48,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 13:54:48,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 13:54:48,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 13:54:48,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 13:54:48,671 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 13:54:48,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 13:54:48,671 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 13:54:48,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 13:54:48,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 13:54:48,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 13:54:48,671 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 13:54:48,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 13:54:48,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 13:54:48,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 13:54:48,672 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 13:54:48,672 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 13:54:48,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 13:54:48,672 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 13:54:48,673 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 13:54:48,673 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 13:54:48,673 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 -> 6f9bb533a6ae968b56a3b4121531d019ea186c25a1e8156a6682080f16505ca3 [2022-07-19 13:54:48,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 13:54:48,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 13:54:48,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 13:54:48,895 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 13:54:48,895 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 13:54:48,896 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c [2022-07-19 13:54:48,939 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa8b56fc/670010907999471ba682dcac6e65f9cb/FLAG9474e06b4 [2022-07-19 13:54:49,286 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 13:54:49,286 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c [2022-07-19 13:54:49,290 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa8b56fc/670010907999471ba682dcac6e65f9cb/FLAG9474e06b4 [2022-07-19 13:54:49,298 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa8b56fc/670010907999471ba682dcac6e65f9cb [2022-07-19 13:54:49,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 13:54:49,301 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 13:54:49,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 13:54:49,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 13:54:49,304 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 13:54:49,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 01:54:49" (1/1) ... [2022-07-19 13:54:49,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a7e1214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:49, skipping insertion in model container [2022-07-19 13:54:49,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 01:54:49" (1/1) ... [2022-07-19 13:54:49,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 13:54:49,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 13:54:49,464 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/floats-esbmc-regression/digits_bad_while.c[321,334] [2022-07-19 13:54:49,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 13:54:49,486 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 13:54:49,496 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/floats-esbmc-regression/digits_bad_while.c[321,334] [2022-07-19 13:54:49,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 13:54:49,507 INFO L208 MainTranslator]: Completed translation [2022-07-19 13:54:49,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:49 WrapperNode [2022-07-19 13:54:49,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 13:54:49,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 13:54:49,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 13:54:49,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 13:54:49,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:49" (1/1) ... [2022-07-19 13:54:49,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:49" (1/1) ... [2022-07-19 13:54:49,529 INFO L137 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31 [2022-07-19 13:54:49,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 13:54:49,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 13:54:49,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 13:54:49,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 13:54:49,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:49" (1/1) ... [2022-07-19 13:54:49,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:49" (1/1) ... [2022-07-19 13:54:49,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:49" (1/1) ... [2022-07-19 13:54:49,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:49" (1/1) ... [2022-07-19 13:54:49,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:49" (1/1) ... [2022-07-19 13:54:49,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:49" (1/1) ... [2022-07-19 13:54:49,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:49" (1/1) ... [2022-07-19 13:54:49,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 13:54:49,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 13:54:49,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 13:54:49,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 13:54:49,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:49" (1/1) ... [2022-07-19 13:54:49,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 13:54:49,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 13:54:49,563 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 13:54:49,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 13:54:49,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 13:54:49,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 13:54:49,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 13:54:49,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 13:54:49,628 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 13:54:49,629 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 13:54:49,684 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 13:54:49,688 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 13:54:49,688 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 13:54:49,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:54:49 BoogieIcfgContainer [2022-07-19 13:54:49,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 13:54:49,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 13:54:49,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 13:54:49,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 13:54:49,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 01:54:49" (1/3) ... [2022-07-19 13:54:49,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171324ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 01:54:49, skipping insertion in model container [2022-07-19 13:54:49,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:49" (2/3) ... [2022-07-19 13:54:49,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171324ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 01:54:49, skipping insertion in model container [2022-07-19 13:54:49,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:54:49" (3/3) ... [2022-07-19 13:54:49,695 INFO L111 eAbstractionObserver]: Analyzing ICFG digits_bad_while.c [2022-07-19 13:54:49,703 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 13:54:49,703 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 13:54:49,731 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 13:54:49,735 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@720fa833, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4a88b37d [2022-07-19 13:54:49,736 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 13:54:49,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:54:49,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-19 13:54:49,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:54:49,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-19 13:54:49,743 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:54:49,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:54:49,746 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-07-19 13:54:49,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 13:54:49,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443900048] [2022-07-19 13:54:49,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:54:49,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 13:54:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 13:54:49,810 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 13:54:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 13:54:49,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 13:54:49,829 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 13:54:49,830 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 13:54:49,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 13:54:49,834 INFO L356 BasicCegarLoop]: Path program histogram: [1] [2022-07-19 13:54:49,836 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 13:54:49,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 01:54:49 BoogieIcfgContainer [2022-07-19 13:54:49,848 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 13:54:49,849 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 13:54:49,849 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 13:54:49,849 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 13:54:49,849 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:54:49" (3/4) ... [2022-07-19 13:54:49,851 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-19 13:54:49,852 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 13:54:49,852 INFO L158 Benchmark]: Toolchain (without parser) took 551.19ms. Allocated memory is still 98.6MB. Free memory was 59.6MB in the beginning and 48.8MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 13:54:49,853 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 98.6MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 13:54:49,853 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.93ms. Allocated memory is still 98.6MB. Free memory was 59.4MB in the beginning and 74.1MB in the end (delta: -14.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 13:54:49,854 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.05ms. Allocated memory is still 98.6MB. Free memory was 74.1MB in the beginning and 72.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 13:54:49,854 INFO L158 Benchmark]: Boogie Preprocessor took 12.16ms. Allocated memory is still 98.6MB. Free memory was 72.4MB in the beginning and 71.7MB in the end (delta: 767.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 13:54:49,854 INFO L158 Benchmark]: RCFGBuilder took 146.65ms. Allocated memory is still 98.6MB. Free memory was 71.4MB in the beginning and 62.3MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 13:54:49,855 INFO L158 Benchmark]: TraceAbstraction took 157.84ms. Allocated memory is still 98.6MB. Free memory was 62.0MB in the beginning and 49.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 13:54:49,855 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 98.6MB. Free memory was 49.1MB in the beginning and 48.8MB in the end (delta: 314.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 13:54:49,857 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.17ms. Allocated memory is still 98.6MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.93ms. Allocated memory is still 98.6MB. Free memory was 59.4MB in the beginning and 74.1MB in the end (delta: -14.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.05ms. Allocated memory is still 98.6MB. Free memory was 74.1MB in the beginning and 72.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.16ms. Allocated memory is still 98.6MB. Free memory was 72.4MB in the beginning and 71.7MB in the end (delta: 767.1kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 146.65ms. Allocated memory is still 98.6MB. Free memory was 71.4MB in the beginning and 62.3MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 157.84ms. Allocated memory is still 98.6MB. Free memory was 62.0MB in the beginning and 49.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 98.6MB. Free memory was 49.1MB in the beginning and 48.8MB in the end (delta: 314.1kB). 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: 4]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryLONGDOUBLEComparisonOperation at line 12, overapproximation of someBinaryArithmeticDOUBLEoperation at line 8. Possible FailurePath: [L8] long double x = 1.0/7.0; [L9] long long res = 0; [L11] int i = 1; VAL [i=1, res=0] [L12] COND FALSE !(x != 0) VAL [i=1, res=0] [L19] CALL __VERIFIER_assert(res > 67050) [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-19 13:54:49,883 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/floats-esbmc-regression/digits_bad_while.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 6f9bb533a6ae968b56a3b4121531d019ea186c25a1e8156a6682080f16505ca3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 13:54:51,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 13:54:51,530 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 13:54:51,556 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 13:54:51,559 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 13:54:51,560 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 13:54:51,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 13:54:51,568 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 13:54:51,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 13:54:51,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 13:54:51,577 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 13:54:51,579 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 13:54:51,579 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 13:54:51,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 13:54:51,582 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 13:54:51,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 13:54:51,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 13:54:51,587 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 13:54:51,588 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 13:54:51,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 13:54:51,589 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 13:54:51,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 13:54:51,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 13:54:51,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 13:54:51,592 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 13:54:51,594 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 13:54:51,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 13:54:51,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 13:54:51,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 13:54:51,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 13:54:51,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 13:54:51,596 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 13:54:51,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 13:54:51,598 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 13:54:51,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 13:54:51,600 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 13:54:51,600 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 13:54:51,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 13:54:51,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 13:54:51,601 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 13:54:51,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 13:54:51,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 13:54:51,603 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 13:54:51,629 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 13:54:51,630 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 13:54:51,630 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 13:54:51,630 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 13:54:51,631 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 13:54:51,631 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 13:54:51,631 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 13:54:51,632 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 13:54:51,632 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 13:54:51,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 13:54:51,633 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 13:54:51,633 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 13:54:51,633 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 13:54:51,633 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 13:54:51,633 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 13:54:51,633 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 13:54:51,634 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 13:54:51,634 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 13:54:51,634 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 13:54:51,634 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 13:54:51,634 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 13:54:51,634 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 13:54:51,635 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 13:54:51,635 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 13:54:51,635 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 13:54:51,635 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 13:54:51,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 13:54:51,635 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 13:54:51,636 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 13:54:51,636 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 13:54:51,636 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 13:54:51,636 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 13:54:51,636 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 13:54:51,636 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 13:54:51,637 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 13:54:51,637 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 13:54:51,637 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 -> 6f9bb533a6ae968b56a3b4121531d019ea186c25a1e8156a6682080f16505ca3 [2022-07-19 13:54:51,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 13:54:51,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 13:54:51,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 13:54:51,924 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 13:54:51,924 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 13:54:51,925 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c [2022-07-19 13:54:51,973 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed339ff4/100d0e060b05494e83a248f9a4becde9/FLAGe7b1c1d5a [2022-07-19 13:54:52,289 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 13:54:52,289 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c [2022-07-19 13:54:52,293 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed339ff4/100d0e060b05494e83a248f9a4becde9/FLAGe7b1c1d5a [2022-07-19 13:54:52,320 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ed339ff4/100d0e060b05494e83a248f9a4becde9 [2022-07-19 13:54:52,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 13:54:52,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 13:54:52,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 13:54:52,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 13:54:52,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 13:54:52,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 01:54:52" (1/1) ... [2022-07-19 13:54:52,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f1df186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:52, skipping insertion in model container [2022-07-19 13:54:52,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 01:54:52" (1/1) ... [2022-07-19 13:54:52,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 13:54:52,345 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 13:54:52,456 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/floats-esbmc-regression/digits_bad_while.c[321,334] [2022-07-19 13:54:52,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 13:54:52,483 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 13:54:52,497 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/floats-esbmc-regression/digits_bad_while.c[321,334] [2022-07-19 13:54:52,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 13:54:52,530 INFO L208 MainTranslator]: Completed translation [2022-07-19 13:54:52,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:52 WrapperNode [2022-07-19 13:54:52,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 13:54:52,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 13:54:52,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 13:54:52,538 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 13:54:52,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:52" (1/1) ... [2022-07-19 13:54:52,549 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:52" (1/1) ... [2022-07-19 13:54:52,560 INFO L137 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2022-07-19 13:54:52,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 13:54:52,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 13:54:52,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 13:54:52,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 13:54:52,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:52" (1/1) ... [2022-07-19 13:54:52,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:52" (1/1) ... [2022-07-19 13:54:52,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:52" (1/1) ... [2022-07-19 13:54:52,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:52" (1/1) ... [2022-07-19 13:54:52,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:52" (1/1) ... [2022-07-19 13:54:52,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:52" (1/1) ... [2022-07-19 13:54:52,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:52" (1/1) ... [2022-07-19 13:54:52,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 13:54:52,602 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 13:54:52,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 13:54:52,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 13:54:52,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:52" (1/1) ... [2022-07-19 13:54:52,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 13:54:52,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 13:54:52,625 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 13:54:52,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 13:54:52,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 13:54:52,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 13:54:52,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 13:54:52,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 13:54:52,693 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 13:54:52,694 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 13:54:54,903 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 13:54:54,906 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 13:54:54,907 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 13:54:54,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:54:54 BoogieIcfgContainer [2022-07-19 13:54:54,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 13:54:54,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 13:54:54,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 13:54:54,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 13:54:54,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 01:54:52" (1/3) ... [2022-07-19 13:54:54,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7705c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 01:54:54, skipping insertion in model container [2022-07-19 13:54:54,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:54:52" (2/3) ... [2022-07-19 13:54:54,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7705c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 01:54:54, skipping insertion in model container [2022-07-19 13:54:54,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:54:54" (3/3) ... [2022-07-19 13:54:54,912 INFO L111 eAbstractionObserver]: Analyzing ICFG digits_bad_while.c [2022-07-19 13:54:54,921 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 13:54:54,921 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 13:54:54,958 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 13:54:54,962 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@27a9d141, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7c1f8f1d [2022-07-19 13:54:54,963 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 13:54:54,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:54:54,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-19 13:54:54,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:54:54,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-19 13:54:54,969 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:54:54,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:54:54,972 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-07-19 13:54:54,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:54:54,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672388002] [2022-07-19 13:54:54,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:54:54,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:54:54,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:54:54,983 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:54:54,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-19 13:54:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:54:55,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 13:54:55,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:54:55,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:54:55,106 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:54:55,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:54:55,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672388002] [2022-07-19 13:54:55,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672388002] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:54:55,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:54:55,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 13:54:55,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771702914] [2022-07-19 13:54:55,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:54:55,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 13:54:55,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:54:55,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 13:54:55,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:54:55,129 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:54:57,326 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:54:57,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:54:57,406 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-07-19 13:54:57,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 13:54:57,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-19 13:54:57,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:54:57,420 INFO L225 Difference]: With dead ends: 20 [2022-07-19 13:54:57,420 INFO L226 Difference]: Without dead ends: 8 [2022-07-19 13:54:57,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:54:57,428 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 13:54:57,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 13:54:57,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-07-19 13:54:57,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-07-19 13:54:57,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:54:57,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-07-19 13:54:57,448 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-07-19 13:54:57,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:54:57,448 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-07-19 13:54:57,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:54:57,449 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-07-19 13:54:57,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-19 13:54:57,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:54:57,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:54:57,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-19 13:54:57,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:54:57,658 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:54:57,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:54:57,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2022-07-19 13:54:57,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:54:57,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563936818] [2022-07-19 13:54:57,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:54:57,664 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:54:57,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:54:57,666 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:54:57,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-19 13:54:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:54:58,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 13:54:58,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:54:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:54:59,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 13:55:05,688 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2022-07-19 13:55:07,746 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-07-19 13:55:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-19 13:55:07,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:55:07,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563936818] [2022-07-19 13:55:07,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563936818] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 13:55:07,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 13:55:07,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-19 13:55:07,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561891578] [2022-07-19 13:55:07,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 13:55:07,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 13:55:07,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:55:07,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 13:55:07,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=17, Unknown=2, NotChecked=8, Total=42 [2022-07-19 13:55:07,957 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:55:09,986 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 [] [2022-07-19 13:55:12,114 WARN L855 $PredicateComparison]: unable to prove that (and (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:55:14,298 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:55:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:55:14,396 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-07-19 13:55:14,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 13:55:14,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-19 13:55:14,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:55:14,397 INFO L225 Difference]: With dead ends: 13 [2022-07-19 13:55:14,397 INFO L226 Difference]: Without dead ends: 9 [2022-07-19 13:55:14,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=17, Invalid=18, Unknown=3, NotChecked=18, Total=56 [2022-07-19 13:55:14,398 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-19 13:55:14,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 11 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 2 Unknown, 6 Unchecked, 4.3s Time] [2022-07-19 13:55:14,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-07-19 13:55:14,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-07-19 13:55:14,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:55:14,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-07-19 13:55:14,401 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2022-07-19 13:55:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:55:14,401 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-07-19 13:55:14,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:55:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-07-19 13:55:14,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-19 13:55:14,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:55:14,402 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-19 13:55:14,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-19 13:55:14,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:55:14,602 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:55:14,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:55:14,603 INFO L85 PathProgramCache]: Analyzing trace with hash 292915403, now seen corresponding path program 2 times [2022-07-19 13:55:14,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:55:14,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521788017] [2022-07-19 13:55:14,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 13:55:14,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:55:14,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:55:14,605 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:55:14,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-19 13:55:15,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 13:55:15,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 13:55:15,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 13:55:15,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:55:23,048 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:55:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-19 13:55:23,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 13:55:29,299 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2022-07-19 13:55:31,360 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-07-19 13:55:37,773 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2022-07-19 13:55:39,914 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-07-19 13:55:46,183 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2022-07-19 13:55:48,272 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-07-19 13:55:48,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-19 13:55:48,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:55:48,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521788017] [2022-07-19 13:55:48,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1521788017] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 13:55:48,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 13:55:48,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-07-19 13:55:48,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398698030] [2022-07-19 13:55:48,273 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 13:55:48,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 13:55:48,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:55:48,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 13:55:48,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=18, Unknown=7, NotChecked=44, Total=90 [2022-07-19 13:55:48,274 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:55:50,383 WARN L855 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:55:52,539 WARN L855 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:56:04,861 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:56:07,223 WARN L855 $PredicateComparison]: unable to prove that (and (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:56:09,429 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:56:11,435 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:56:11,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:56:11,436 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-07-19 13:56:11,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 13:56:11,527 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-19 13:56:11,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:56:11,528 INFO L225 Difference]: With dead ends: 14 [2022-07-19 13:56:11,528 INFO L226 Difference]: Without dead ends: 10 [2022-07-19 13:56:11,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.1s TimeCoverageRelationStatistics Valid=32, Invalid=25, Unknown=13, NotChecked=112, Total=182 [2022-07-19 13:56:11,533 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-19 13:56:11,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 2 Unknown, 26 Unchecked, 6.5s Time] [2022-07-19 13:56:11,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-07-19 13:56:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-07-19 13:56:11,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:56:11,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-07-19 13:56:11,539 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2022-07-19 13:56:11,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:56:11,539 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-07-19 13:56:11,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:56:11,540 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-07-19 13:56:11,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-19 13:56:11,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:56:11,540 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2022-07-19 13:56:11,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-19 13:56:11,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:56:11,741 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:56:11,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:56:11,742 INFO L85 PathProgramCache]: Analyzing trace with hash 492108272, now seen corresponding path program 3 times [2022-07-19 13:56:11,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:56:11,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197157288] [2022-07-19 13:56:11,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 13:56:11,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:56:11,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:56:11,747 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:56:11,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-19 13:56:13,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 13:56:13,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 13:56:13,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 13:56:13,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:56:33,203 WARN L233 SmtUtils]: Spent 6.38s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 13:56:39,976 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:56:39,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-19 13:56:39,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 13:56:46,278 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2022-07-19 13:56:48,344 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-07-19 13:56:54,810 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2022-07-19 13:56:56,958 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-07-19 13:57:03,631 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2022-07-19 13:57:05,853 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-07-19 13:57:12,355 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2022-07-19 13:57:14,518 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-07-19 13:57:14,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-19 13:57:14,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:57:14,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197157288] [2022-07-19 13:57:14,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197157288] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 13:57:14,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 13:57:14,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2022-07-19 13:57:14,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232995971] [2022-07-19 13:57:14,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 13:57:14,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 13:57:14,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:57:14,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 13:57:14,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=24, Unknown=11, NotChecked=70, Total=132 [2022-07-19 13:57:14,520 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:57:16,729 WARN L855 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:57:18,973 WARN L855 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:57:21,150 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) (not (fp.eq (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-19 13:57:23,273 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-19 13:57:25,426 WARN L855 $PredicateComparison]: unable to prove that (and (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:57:27,435 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 [] [2022-07-19 13:57:27,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:57:27,509 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-07-19 13:57:27,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 13:57:27,510 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-19 13:57:27,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:57:27,510 INFO L225 Difference]: With dead ends: 15 [2022-07-19 13:57:27,510 INFO L226 Difference]: Without dead ends: 11 [2022-07-19 13:57:27,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 45.4s TimeCoverageRelationStatistics Valid=37, Invalid=29, Unknown=16, NotChecked=190, Total=272 [2022-07-19 13:57:27,511 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 13:57:27,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 1 Unknown, 29 Unchecked, 2.1s Time] [2022-07-19 13:57:27,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-07-19 13:57:27,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-07-19 13:57:27,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:57:27,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-07-19 13:57:27,514 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2022-07-19 13:57:27,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:57:27,514 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-07-19 13:57:27,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:57:27,514 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-07-19 13:57:27,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-19 13:57:27,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:57:27,515 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-07-19 13:57:27,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-19 13:57:27,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:57:27,720 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:57:27,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:57:27,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 4 times [2022-07-19 13:57:27,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:57:27,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353805805] [2022-07-19 13:57:27,720 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 13:57:27,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:57:27,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:57:27,722 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) [2022-07-19 13:57:27,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 13:57:29,801 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 13:57:29,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 13:57:29,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 13:57:29,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:57:37,910 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:57:44,795 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:57:52,030 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:57:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-19 13:57:52,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 13:57:58,404 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2022-07-19 13:58:05,939 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2022-07-19 13:58:08,112 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-07-19 13:58:14,862 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2022-07-19 13:58:17,109 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-07-19 13:58:24,102 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2022-07-19 13:58:26,435 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-07-19 13:58:33,273 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2022-07-19 13:58:35,565 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2022-07-19 13:58:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-19 13:58:35,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:58:35,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353805805] [2022-07-19 13:58:35,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353805805] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 13:58:35,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 13:58:35,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-07-19 13:58:35,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028050201] [2022-07-19 13:58:35,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 13:58:35,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 13:58:35,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:58:35,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 13:58:35,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=21, Unknown=12, NotChecked=120, Total=182 [2022-07-19 13:58:35,567 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:58:37,905 WARN L855 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:58:40,275 WARN L855 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:58:42,578 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) (not (fp.eq (let ((.cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-19 13:58:44,817 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-19 13:58:47,037 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-19 13:58:49,287 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:58:49,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:58:49,401 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-07-19 13:58:49,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 13:58:49,402 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-19 13:58:49,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:58:49,402 INFO L225 Difference]: With dead ends: 16 [2022-07-19 13:58:49,402 INFO L226 Difference]: Without dead ends: 12 [2022-07-19 13:58:49,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 42.9s TimeCoverageRelationStatistics Valid=41, Invalid=27, Unknown=18, NotChecked=294, Total=380 [2022-07-19 13:58:49,404 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 13:58:49,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 42 Unchecked, 0.1s Time] [2022-07-19 13:58:49,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-07-19 13:58:49,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-07-19 13:58:49,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:58:49,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-07-19 13:58:49,407 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2022-07-19 13:58:49,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:58:49,407 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-07-19 13:58:49,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:58:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-07-19 13:58:49,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 13:58:49,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:58:49,408 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2022-07-19 13:58:49,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-19 13:58:49,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:58:49,624 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:58:49,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:58:49,624 INFO L85 PathProgramCache]: Analyzing trace with hash 522938704, now seen corresponding path program 5 times [2022-07-19 13:58:49,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:58:49,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119277207] [2022-07-19 13:58:49,624 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 13:58:49,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:58:49,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:58:49,625 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:58:49,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-19 13:58:53,341 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-19 13:58:53,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 13:58:53,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 13:58:53,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:59:13,561 WARN L233 SmtUtils]: Spent 6.46s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 13:59:20,337 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:59:27,636 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:59:32,911 WARN L233 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 13:59:35,323 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-19 13:59:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 0 trivial. 12 not checked. [2022-07-19 13:59:35,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 13:59:41,746 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false