./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/Double_div_bad.i -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 aa004690edfde808b1aefac96308d2a9e2df62056aeddc89c51bd2015ab29125 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:28:08,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:28:08,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:28:08,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:28:08,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:28:08,525 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:28:08,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:28:08,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:28:08,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:28:08,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:28:08,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:28:08,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:28:08,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:28:08,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:28:08,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:28:08,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:28:08,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:28:08,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:28:08,549 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:28:08,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:28:08,553 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:28:08,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:28:08,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:28:08,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:28:08,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:28:08,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:28:08,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:28:08,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:28:08,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:28:08,560 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:28:08,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:28:08,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:28:08,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:28:08,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:28:08,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:28:08,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:28:08,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:28:08,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:28:08,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:28:08,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:28:08,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:28:08,569 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:28:08,570 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 01:28:08,594 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:28:08,595 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:28:08,595 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:28:08,595 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:28:08,596 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:28:08,596 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:28:08,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:28:08,596 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:28:08,597 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:28:08,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:28:08,597 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:28:08,597 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 01:28:08,597 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:28:08,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:28:08,598 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:28:08,598 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:28:08,598 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:28:08,598 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:28:08,598 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:28:08,598 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:28:08,598 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:28:08,599 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:28:08,599 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:28:08,599 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:28:08,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:28:08,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:28:08,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:28:08,600 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:28:08,600 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 01:28:08,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 01:28:08,600 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:28:08,600 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:28:08,600 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:28:08,601 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 -> aa004690edfde808b1aefac96308d2a9e2df62056aeddc89c51bd2015ab29125 [2022-07-21 01:28:08,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:28:08,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:28:08,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:28:08,892 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:28:08,893 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:28:08,894 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i [2022-07-21 01:28:08,938 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e616519c1/007ffd8fc542467680247668f31e9adc/FLAG8e2df3832 [2022-07-21 01:28:09,277 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:28:09,278 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i [2022-07-21 01:28:09,289 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e616519c1/007ffd8fc542467680247668f31e9adc/FLAG8e2df3832 [2022-07-21 01:28:09,722 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e616519c1/007ffd8fc542467680247668f31e9adc [2022-07-21 01:28:09,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:28:09,725 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:28:09,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:28:09,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:28:09,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:28:09,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:28:09" (1/1) ... [2022-07-21 01:28:09,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@650e62be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:09, skipping insertion in model container [2022-07-21 01:28:09,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:28:09" (1/1) ... [2022-07-21 01:28:09,735 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:28:09,744 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:28:09,836 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/Double_div_bad.i[808,821] [2022-07-21 01:28:09,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:28:09,847 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:28:09,855 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/Double_div_bad.i[808,821] [2022-07-21 01:28:09,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:28:09,888 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:28:09,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:09 WrapperNode [2022-07-21 01:28:09,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:28:09,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:28:09,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:28:09,892 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:28:09,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:09" (1/1) ... [2022-07-21 01:28:09,901 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:09" (1/1) ... [2022-07-21 01:28:09,911 INFO L137 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 26 [2022-07-21 01:28:09,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:28:09,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:28:09,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:28:09,912 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:28:09,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:09" (1/1) ... [2022-07-21 01:28:09,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:09" (1/1) ... [2022-07-21 01:28:09,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:09" (1/1) ... [2022-07-21 01:28:09,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:09" (1/1) ... [2022-07-21 01:28:09,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:09" (1/1) ... [2022-07-21 01:28:09,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:09" (1/1) ... [2022-07-21 01:28:09,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:09" (1/1) ... [2022-07-21 01:28:09,930 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:28:09,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:28:09,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:28:09,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:28:09,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:09" (1/1) ... [2022-07-21 01:28:09,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:28:09,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:28:09,952 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-21 01:28:09,957 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-21 01:28:09,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:28:09,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 01:28:09,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:28:09,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:28:10,035 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:28:10,037 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:28:10,117 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:28:10,121 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:28:10,121 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 01:28:10,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:28:10 BoogieIcfgContainer [2022-07-21 01:28:10,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:28:10,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:28:10,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:28:10,127 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:28:10,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:28:09" (1/3) ... [2022-07-21 01:28:10,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73136e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:28:10, skipping insertion in model container [2022-07-21 01:28:10,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:09" (2/3) ... [2022-07-21 01:28:10,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73136e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:28:10, skipping insertion in model container [2022-07-21 01:28:10,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:28:10" (3/3) ... [2022-07-21 01:28:10,129 INFO L111 eAbstractionObserver]: Analyzing ICFG Double_div_bad.i [2022-07-21 01:28:10,138 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:28:10,138 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:28:10,183 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:28:10,190 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@25ffe6de, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@587ab323 [2022-07-21 01:28:10,191 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:28:10,194 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-21 01:28:10,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 01:28:10,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:28:10,199 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 01:28:10,200 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:28:10,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:28:10,204 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-07-21 01:28:10,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:28:10,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588871113] [2022-07-21 01:28:10,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:28:10,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:28:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 01:28:10,287 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 01:28:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 01:28:10,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 01:28:10,317 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 01:28:10,319 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 01:28:10,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 01:28:10,323 INFO L356 BasicCegarLoop]: Path program histogram: [1] [2022-07-21 01:28:10,326 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 01:28:10,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 01:28:10 BoogieIcfgContainer [2022-07-21 01:28:10,340 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 01:28:10,341 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 01:28:10,341 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 01:28:10,342 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 01:28:10,342 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:28:10" (3/4) ... [2022-07-21 01:28:10,344 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-21 01:28:10,344 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 01:28:10,345 INFO L158 Benchmark]: Toolchain (without parser) took 619.38ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 38.2MB in the beginning and 52.4MB in the end (delta: -14.2MB). Peak memory consumption was 260.9kB. Max. memory is 16.1GB. [2022-07-21 01:28:10,346 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 58.7MB. Free memory was 40.7MB in the beginning and 40.7MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:28:10,347 INFO L158 Benchmark]: CACSL2BoogieTranslator took 164.09ms. Allocated memory is still 58.7MB. Free memory was 38.0MB in the beginning and 43.5MB in the end (delta: -5.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 01:28:10,348 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.47ms. Allocated memory is still 58.7MB. Free memory was 43.3MB in the beginning and 42.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:28:10,348 INFO L158 Benchmark]: Boogie Preprocessor took 17.73ms. Allocated memory is still 58.7MB. Free memory was 42.1MB in the beginning and 41.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:28:10,351 INFO L158 Benchmark]: RCFGBuilder took 191.38ms. Allocated memory is still 58.7MB. Free memory was 41.0MB in the beginning and 32.8MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 01:28:10,352 INFO L158 Benchmark]: TraceAbstraction took 215.38ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 32.1MB in the beginning and 52.8MB in the end (delta: -20.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:28:10,352 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 73.4MB. Free memory was 52.8MB in the beginning and 52.4MB in the end (delta: 318.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:28:10,357 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.49ms. Allocated memory is still 58.7MB. Free memory was 40.7MB in the beginning and 40.7MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 164.09ms. Allocated memory is still 58.7MB. Free memory was 38.0MB in the beginning and 43.5MB in the end (delta: -5.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.47ms. Allocated memory is still 58.7MB. Free memory was 43.3MB in the beginning and 42.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.73ms. Allocated memory is still 58.7MB. Free memory was 42.1MB in the beginning and 41.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 191.38ms. Allocated memory is still 58.7MB. Free memory was 41.0MB in the beginning and 32.8MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 215.38ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 32.1MB in the beginning and 52.8MB in the end (delta: -20.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 73.4MB. Free memory was 52.8MB in the beginning and 52.4MB in the end (delta: 318.5kB). 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: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 29, overapproximation of someBinaryArithmeticDOUBLEoperation at line 21. Possible FailurePath: [L20] double x = 1.0; [L21] double x1 = x/1.6; VAL [x=1] [L23] COND FALSE !(x1 != x) VAL [x=1] [L29] CALL __VERIFIER_assert(x == 0) [L13] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L13] 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.2s, 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-21 01:28:10,388 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/Double_div_bad.i -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 aa004690edfde808b1aefac96308d2a9e2df62056aeddc89c51bd2015ab29125 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:28:11,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:28:11,877 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:28:11,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:28:11,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:28:11,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:28:11,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:28:11,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:28:11,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:28:11,909 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:28:11,910 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:28:11,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:28:11,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:28:11,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:28:11,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:28:11,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:28:11,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:28:11,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:28:11,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:28:11,917 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:28:11,918 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:28:11,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:28:11,921 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:28:11,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:28:11,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:28:11,926 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:28:11,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:28:11,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:28:11,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:28:11,931 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:28:11,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:28:11,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:28:11,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:28:11,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:28:11,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:28:11,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:28:11,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:28:11,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:28:11,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:28:11,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:28:11,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:28:11,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:28:11,945 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-21 01:28:11,963 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:28:11,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:28:11,963 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:28:11,963 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:28:11,964 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:28:11,966 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:28:11,967 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:28:11,967 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:28:11,967 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:28:11,967 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:28:11,968 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:28:11,968 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:28:11,968 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:28:11,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:28:11,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:28:11,968 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:28:11,969 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 01:28:11,969 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 01:28:11,969 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 01:28:11,970 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:28:11,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:28:11,970 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:28:11,970 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:28:11,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:28:11,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:28:11,971 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:28:11,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:28:11,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:28:11,971 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:28:11,971 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:28:11,972 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 01:28:11,972 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 01:28:11,972 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:28:11,972 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:28:11,972 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:28:11,973 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 01:28:11,973 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 -> aa004690edfde808b1aefac96308d2a9e2df62056aeddc89c51bd2015ab29125 [2022-07-21 01:28:12,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:28:12,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:28:12,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:28:12,254 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:28:12,254 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:28:12,255 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i [2022-07-21 01:28:12,312 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dba98df0/e4c85ecf602548f0b97e5fe9ec324d03/FLAG842f34faa [2022-07-21 01:28:12,634 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:28:12,634 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i [2022-07-21 01:28:12,638 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dba98df0/e4c85ecf602548f0b97e5fe9ec324d03/FLAG842f34faa [2022-07-21 01:28:13,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dba98df0/e4c85ecf602548f0b97e5fe9ec324d03 [2022-07-21 01:28:13,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:28:13,063 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:28:13,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:28:13,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:28:13,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:28:13,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:28:13" (1/1) ... [2022-07-21 01:28:13,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@761caa4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:13, skipping insertion in model container [2022-07-21 01:28:13,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:28:13" (1/1) ... [2022-07-21 01:28:13,072 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:28:13,081 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:28:13,182 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/Double_div_bad.i[808,821] [2022-07-21 01:28:13,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:28:13,194 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:28:13,202 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/Double_div_bad.i[808,821] [2022-07-21 01:28:13,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:28:13,240 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:28:13,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:13 WrapperNode [2022-07-21 01:28:13,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:28:13,241 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:28:13,241 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:28:13,241 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:28:13,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:13" (1/1) ... [2022-07-21 01:28:13,251 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:13" (1/1) ... [2022-07-21 01:28:13,260 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27 [2022-07-21 01:28:13,261 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:28:13,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:28:13,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:28:13,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:28:13,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:13" (1/1) ... [2022-07-21 01:28:13,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:13" (1/1) ... [2022-07-21 01:28:13,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:13" (1/1) ... [2022-07-21 01:28:13,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:13" (1/1) ... [2022-07-21 01:28:13,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:13" (1/1) ... [2022-07-21 01:28:13,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:13" (1/1) ... [2022-07-21 01:28:13,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:13" (1/1) ... [2022-07-21 01:28:13,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:28:13,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:28:13,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:28:13,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:28:13,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:13" (1/1) ... [2022-07-21 01:28:13,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:28:13,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:28:13,315 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-21 01:28:13,338 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-21 01:28:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:28:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 01:28:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:28:13,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:28:13,398 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:28:13,399 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:28:17,776 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:28:17,780 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:28:17,780 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 01:28:17,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:28:17 BoogieIcfgContainer [2022-07-21 01:28:17,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:28:17,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:28:17,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:28:17,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:28:17,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:28:13" (1/3) ... [2022-07-21 01:28:17,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd116dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:28:17, skipping insertion in model container [2022-07-21 01:28:17,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:28:13" (2/3) ... [2022-07-21 01:28:17,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd116dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:28:17, skipping insertion in model container [2022-07-21 01:28:17,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:28:17" (3/3) ... [2022-07-21 01:28:17,786 INFO L111 eAbstractionObserver]: Analyzing ICFG Double_div_bad.i [2022-07-21 01:28:17,794 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:28:17,795 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:28:17,836 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:28:17,841 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@7c05e5b3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@10c2c377 [2022-07-21 01:28:17,841 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:28:17,844 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-21 01:28:17,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 01:28:17,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:28:17,847 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 01:28:17,848 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:28:17,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:28:17,851 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-07-21 01:28:17,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:28:17,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773212502] [2022-07-21 01:28:17,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:28:17,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:28:17,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:28:17,885 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-21 01:28:17,886 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-21 01:28:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:28:18,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 01:28:18,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:28:21,868 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-21 01:28:21,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:28:21,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:28:21,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773212502] [2022-07-21 01:28:21,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773212502] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:28:21,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:28:21,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 01:28:21,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905440783] [2022-07-21 01:28:21,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:28:21,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 01:28:21,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:28:21,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 01:28:21,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 01:28:21,894 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 4 states, 4 states have (on average 1.5) 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-21 01:28:23,002 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:28:25,269 WARN L855 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) |c_ULTIMATE.start_main_~x~0#1|) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div roundNearestTiesToEven |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 11 53) roundNearestTiesToEven (/ 8.0 5.0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-21 01:28:26,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:28:26,736 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-07-21 01:28:27,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 01:28:27,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) 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-21 01:28:27,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:28:27,327 INFO L225 Difference]: With dead ends: 20 [2022-07-21 01:28:27,327 INFO L226 Difference]: Without dead ends: 8 [2022-07-21 01:28:27,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2022-07-21 01:28:27,331 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-21 01:28:27,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 1 Unchecked, 2.6s Time] [2022-07-21 01:28:27,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-07-21 01:28:27,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-07-21 01:28:27,348 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-21 01:28:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-07-21 01:28:27,349 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-07-21 01:28:27,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:28:27,349 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-07-21 01:28:27,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) 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-21 01:28:27,350 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-07-21 01:28:27,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 01:28:27,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:28:27,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:28:27,371 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-21 01:28:27,560 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-21 01:28:27,560 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:28:27,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:28:27,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2022-07-21 01:28:27,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:28:27,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067531903] [2022-07-21 01:28:27,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:28:27,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:28:27,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:28:27,563 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-21 01:28:27,564 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-21 01:28:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:28:28,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 01:28:28,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:28:40,456 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-21 01:28:40,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:28:47,717 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) |c_ULTIMATE.start_main_~x1~0#1|)) is different from false [2022-07-21 01:28:55,196 WARN L833 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false [2022-07-21 01:28:57,481 WARN L855 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true [2022-07-21 01:28:57,481 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-21 01:28:57,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:28:57,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067531903] [2022-07-21 01:28:57,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2067531903] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:28:57,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:28:57,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-21 01:28:57,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675056397] [2022-07-21 01:28:57,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:28:57,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 01:28:57,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:28:57,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 01:28:57,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=19, Unknown=4, NotChecked=18, Total=56 [2022-07-21 01:28:57,484 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.375) 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-21 01:28:59,793 WARN L855 $PredicateComparison]: unable to prove that (and (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-21 01:29:01,952 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-21 01:29:04,082 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:29:06,103 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:29:08,196 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:29:10,207 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:29:11,794 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:29:14,698 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:29:15,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:29:15,385 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-07-21 01:29:15,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:29:15,388 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) 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-21 01:29:15,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:29:15,388 INFO L225 Difference]: With dead ends: 13 [2022-07-21 01:29:15,388 INFO L226 Difference]: Without dead ends: 9 [2022-07-21 01:29:15,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=19, Invalid=21, Unknown=6, NotChecked=44, Total=90 [2022-07-21 01:29:15,389 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2022-07-21 01:29:15,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 2 Unknown, 13 Unchecked, 13.4s Time] [2022-07-21 01:29:15,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-07-21 01:29:15,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-07-21 01:29:15,392 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-21 01:29:15,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-07-21 01:29:15,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2022-07-21 01:29:15,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:29:15,392 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-07-21 01:29:15,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) 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-21 01:29:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-07-21 01:29:15,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-21 01:29:15,393 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:29:15,393 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-21 01:29:15,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-21 01:29:15,595 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-21 01:29:15,596 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:29:15,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:29:15,596 INFO L85 PathProgramCache]: Analyzing trace with hash 292915403, now seen corresponding path program 2 times [2022-07-21 01:29:15,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:29:15,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10732190] [2022-07-21 01:29:15,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 01:29:15,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:29:15,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:29:15,598 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-21 01:29:15,599 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-21 01:29:17,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 01:29:17,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 01:29:17,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 01:29:17,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:29:28,526 WARN L233 SmtUtils]: Spent 5.13s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:29:30,994 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-21 01:29:40,390 WARN L233 SmtUtils]: Spent 5.76s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:29:42,632 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-21 01:29:42,665 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-21 01:29:42,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:29:50,546 WARN L833 $PredicateComparison]: unable to prove that (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) |c_ULTIMATE.start_main_~x1~0#1|))) is different from false [2022-07-21 01:29:52,696 WARN L855 $PredicateComparison]: unable to prove that (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) |c_ULTIMATE.start_main_~x1~0#1|))) is different from true [2022-07-21 01:30:03,546 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2022-07-21 01:30:05,849 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-07-21 01:30:11,271 WARN L233 SmtUtils]: Spent 5.41s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:30:16,904 WARN L233 SmtUtils]: Spent 5.63s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:30:19,337 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2022-07-21 01:30:21,773 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-07-21 01:30:21,774 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-21 01:30:21,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:30:21,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10732190] [2022-07-21 01:30:21,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10732190] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:30:21,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:30:21,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 11 [2022-07-21 01:30:21,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220144016] [2022-07-21 01:30:21,775 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:30:21,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 01:30:21,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:30:21,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 01:30:21,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=31, Unknown=8, NotChecked=70, Total=132 [2022-07-21 01:30:21,776 INFO L87 Difference]: Start difference. First operand 9 states and 9 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-21 01:30:24,282 WARN L855 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-21 01:30:26,738 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) is different from false [2022-07-21 01:30:29,037 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) is different from true [2022-07-21 01:30:31,211 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-21 01:30:33,489 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (or (not (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-21 01:30:34,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:30:34,318 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-07-21 01:30:34,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 01:30:34,318 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 8 [2022-07-21 01:30:34,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:30:34,319 INFO L225 Difference]: With dead ends: 14 [2022-07-21 01:30:34,319 INFO L226 Difference]: Without dead ends: 10 [2022-07-21 01:30:34,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 35.3s TimeCoverageRelationStatistics Valid=31, Invalid=34, Unknown=13, NotChecked=162, Total=240 [2022-07-21 01:30:34,320 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 01:30:34,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 28 Unchecked, 0.9s Time] [2022-07-21 01:30:34,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-07-21 01:30:34,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-07-21 01:30:34,322 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-21 01:30:34,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-07-21 01:30:34,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2022-07-21 01:30:34,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:30:34,322 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-07-21 01:30:34,323 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-21 01:30:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-07-21 01:30:34,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 01:30:34,323 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:30:34,323 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2022-07-21 01:30:34,370 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-21 01:30:34,523 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-21 01:30:34,524 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:30:34,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:30:34,524 INFO L85 PathProgramCache]: Analyzing trace with hash 492108272, now seen corresponding path program 3 times [2022-07-21 01:30:34,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:30:34,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810012542] [2022-07-21 01:30:34,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 01:30:34,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:30:34,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:30:34,526 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-21 01:30:34,533 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-21 01:30:37,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-21 01:30:37,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 01:30:37,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 01:30:37,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:30:48,478 WARN L233 SmtUtils]: Spent 5.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:31:01,947 WARN L233 SmtUtils]: Spent 7.47s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 01:31:07,721 WARN L233 SmtUtils]: Spent 5.74s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:31:11,437 WARN L855 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-21 01:31:20,730 WARN L233 SmtUtils]: Spent 6.25s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:31:23,283 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-21 01:31:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-21 01:31:23,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:31:32,989 WARN L833 $PredicateComparison]: unable to prove that (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) |c_ULTIMATE.start_main_~x1~0#1|))) is different from false [2022-07-21 01:31:35,138 WARN L855 $PredicateComparison]: unable to prove that (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) |c_ULTIMATE.start_main_~x1~0#1|))) is different from true [2022-07-21 01:31:46,236 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2022-07-21 01:31:48,577 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-07-21 01:31:54,087 WARN L233 SmtUtils]: Spent 5.50s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:31:59,808 WARN L233 SmtUtils]: Spent 5.72s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:32:02,281 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2022-07-21 01:32:04,735 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2022-07-21 01:32:11,072 WARN L233 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:32:17,140 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:32:19,781 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2022-07-21 01:32:22,391 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2022-07-21 01:32:22,393 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-21 01:32:22,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:32:22,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810012542] [2022-07-21 01:32:22,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810012542] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:32:22,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:32:22,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2022-07-21 01:32:22,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514771854] [2022-07-21 01:32:22,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:32:22,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 01:32:22,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:32:22,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 01:32:22,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=40, Unknown=12, NotChecked=102, Total=182 [2022-07-21 01:32:22,395 INFO L87 Difference]: Start difference. First operand 10 states and 10 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-21 01:32:25,136 WARN L855 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-21 01:32:27,827 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0))) (or (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-21 01:32:30,482 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) is different from false [2022-07-21 01:32:33,124 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) is different from true [2022-07-21 01:32:35,327 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x1~0#1|) (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-21 01:32:37,394 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (or (not (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-21 01:32:38,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:32:38,854 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-07-21 01:32:38,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 01:32:38,855 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 9 [2022-07-21 01:32:38,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:32:38,855 INFO L225 Difference]: With dead ends: 15 [2022-07-21 01:32:38,856 INFO L226 Difference]: Without dead ends: 11 [2022-07-21 01:32:38,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 58.7s TimeCoverageRelationStatistics Valid=38, Invalid=44, Unknown=18, NotChecked=242, Total=342 [2022-07-21 01:32:38,856 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-21 01:32:38,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 34 Unchecked, 1.5s Time] [2022-07-21 01:32:38,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-07-21 01:32:38,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-07-21 01:32:38,860 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-21 01:32:38,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-07-21 01:32:38,860 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2022-07-21 01:32:38,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:32:38,861 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-07-21 01:32:38,861 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-21 01:32:38,861 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-07-21 01:32:38,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 01:32:38,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:32:38,861 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-07-21 01:32:38,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-21 01:32:39,061 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-21 01:32:39,062 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:32:39,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:32:39,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 4 times [2022-07-21 01:32:39,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:32:39,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606937203] [2022-07-21 01:32:39,063 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 01:32:39,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:32:39,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:32:39,064 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-21 01:32:39,065 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-21 01:32:42,125 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 01:32:42,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 01:32:42,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 01:32:42,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:32:54,750 WARN L233 SmtUtils]: Spent 5.13s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:32:57,345 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true