./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2214d54defcd10650ad85b05551b84060b114c89dc0a9f14233f38f030bbd558 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 07:54:07,790 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 07:54:07,792 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 07:54:07,835 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 07:54:07,835 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 07:54:07,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 07:54:07,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 07:54:07,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 07:54:07,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 07:54:07,842 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 07:54:07,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 07:54:07,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 07:54:07,844 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 07:54:07,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 07:54:07,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 07:54:07,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 07:54:07,849 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 07:54:07,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 07:54:07,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 07:54:07,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 07:54:07,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 07:54:07,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 07:54:07,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 07:54:07,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 07:54:07,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 07:54:07,864 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 07:54:07,864 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 07:54:07,865 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 07:54:07,865 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 07:54:07,866 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 07:54:07,866 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 07:54:07,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 07:54:07,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 07:54:07,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 07:54:07,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 07:54:07,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 07:54:07,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 07:54:07,870 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 07:54:07,870 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 07:54:07,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 07:54:07,872 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 07:54:07,872 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 07:54:07,889 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 07:54:07,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 07:54:07,891 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 07:54:07,891 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 07:54:07,892 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 07:54:07,892 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 07:54:07,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 07:54:07,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 07:54:07,893 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 07:54:07,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 07:54:07,894 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 07:54:07,894 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 07:54:07,894 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 07:54:07,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 07:54:07,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 07:54:07,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 07:54:07,895 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 07:54:07,895 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 07:54:07,895 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 07:54:07,895 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 07:54:07,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 07:54:07,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 07:54:07,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 07:54:07,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 07:54:07,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:54:07,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 07:54:07,896 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 07:54:07,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 07:54:07,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 07:54:07,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 07:54:07,897 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 07:54:07,897 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 07:54:07,897 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 07:54:07,897 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 07:54:07,897 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 -> 2214d54defcd10650ad85b05551b84060b114c89dc0a9f14233f38f030bbd558 [2021-12-17 07:54:08,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 07:54:08,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 07:54:08,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 07:54:08,105 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 07:54:08,106 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 07:54:08,107 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c [2021-12-17 07:54:08,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf354dcb/acc23458d9b34c0d87592f9acf51d2dd/FLAG38dd09a4e [2021-12-17 07:54:08,556 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 07:54:08,557 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c [2021-12-17 07:54:08,564 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf354dcb/acc23458d9b34c0d87592f9acf51d2dd/FLAG38dd09a4e [2021-12-17 07:54:08,983 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf354dcb/acc23458d9b34c0d87592f9acf51d2dd [2021-12-17 07:54:08,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 07:54:08,986 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 07:54:08,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 07:54:08,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 07:54:08,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 07:54:08,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:54:08" (1/1) ... [2021-12-17 07:54:08,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d941c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:08, skipping insertion in model container [2021-12-17 07:54:08,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:54:08" (1/1) ... [2021-12-17 07:54:08,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 07:54:09,007 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 07:54:09,157 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/loop-floats-scientific-comp/loop2-2.c[474,487] [2021-12-17 07:54:09,173 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:54:09,178 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 07:54:09,188 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/loop-floats-scientific-comp/loop2-2.c[474,487] [2021-12-17 07:54:09,199 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:54:09,211 INFO L208 MainTranslator]: Completed translation [2021-12-17 07:54:09,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:09 WrapperNode [2021-12-17 07:54:09,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 07:54:09,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 07:54:09,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 07:54:09,213 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 07:54:09,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:09" (1/1) ... [2021-12-17 07:54:09,220 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:09" (1/1) ... [2021-12-17 07:54:09,238 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2021-12-17 07:54:09,238 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 07:54:09,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 07:54:09,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 07:54:09,239 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 07:54:09,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:09" (1/1) ... [2021-12-17 07:54:09,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:09" (1/1) ... [2021-12-17 07:54:09,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:09" (1/1) ... [2021-12-17 07:54:09,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:09" (1/1) ... [2021-12-17 07:54:09,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:09" (1/1) ... [2021-12-17 07:54:09,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:09" (1/1) ... [2021-12-17 07:54:09,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:09" (1/1) ... [2021-12-17 07:54:09,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 07:54:09,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 07:54:09,258 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 07:54:09,258 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 07:54:09,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:09" (1/1) ... [2021-12-17 07:54:09,264 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:54:09,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 07:54:09,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 07:54:09,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 07:54:09,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 07:54:09,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 07:54:09,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 07:54:09,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 07:54:09,360 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 07:54:09,361 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 07:54:09,432 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 07:54:09,436 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 07:54:09,436 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 07:54:09,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:54:09 BoogieIcfgContainer [2021-12-17 07:54:09,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 07:54:09,439 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 07:54:09,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 07:54:09,442 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 07:54:09,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 07:54:08" (1/3) ... [2021-12-17 07:54:09,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8bd9eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:54:09, skipping insertion in model container [2021-12-17 07:54:09,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:09" (2/3) ... [2021-12-17 07:54:09,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8bd9eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:54:09, skipping insertion in model container [2021-12-17 07:54:09,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:54:09" (3/3) ... [2021-12-17 07:54:09,444 INFO L111 eAbstractionObserver]: Analyzing ICFG loop2-2.c [2021-12-17 07:54:09,447 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 07:54:09,447 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 07:54:09,475 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 07:54:09,481 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 07:54:09,481 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 07:54:09,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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) [2021-12-17 07:54:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-17 07:54:09,493 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:54:09,494 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:54:09,494 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:54:09,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:54:09,498 INFO L85 PathProgramCache]: Analyzing trace with hash 119997515, now seen corresponding path program 1 times [2021-12-17 07:54:09,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 07:54:09,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369749188] [2021-12-17 07:54:09,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:54:09,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 07:54:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:54:09,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:54:09,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 07:54:09,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369749188] [2021-12-17 07:54:09,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369749188] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:54:09,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:54:09,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 07:54:09,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148280682] [2021-12-17 07:54:09,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:54:09,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 07:54:09,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 07:54:09,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 07:54:09,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 07:54:09,631 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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) [2021-12-17 07:54:09,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:54:09,641 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2021-12-17 07:54:09,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 07:54:09,643 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 [2021-12-17 07:54:09,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:54:09,648 INFO L225 Difference]: With dead ends: 29 [2021-12-17 07:54:09,648 INFO L226 Difference]: Without dead ends: 12 [2021-12-17 07:54:09,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 07:54:09,653 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:54:09,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 07:54:09,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-12-17 07:54:09,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-12-17 07:54:09,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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) [2021-12-17 07:54:09,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2021-12-17 07:54:09,675 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 8 [2021-12-17 07:54:09,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:54:09,675 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-12-17 07:54:09,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2021-12-17 07:54:09,676 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2021-12-17 07:54:09,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 07:54:09,676 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:54:09,676 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:54:09,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 07:54:09,677 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:54:09,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:54:09,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2105434535, now seen corresponding path program 1 times [2021-12-17 07:54:09,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 07:54:09,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928281438] [2021-12-17 07:54:09,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:54:09,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 07:54:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:54:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:54:09,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 07:54:09,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928281438] [2021-12-17 07:54:09,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928281438] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:54:09,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:54:09,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 07:54:09,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387932738] [2021-12-17 07:54:09,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:54:09,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 07:54:09,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 07:54:09,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 07:54:09,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 07:54:09,823 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2021-12-17 07:54:09,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:54:09,834 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2021-12-17 07:54:09,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 07:54:09,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 11 [2021-12-17 07:54:09,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:54:09,844 INFO L225 Difference]: With dead ends: 23 [2021-12-17 07:54:09,844 INFO L226 Difference]: Without dead ends: 15 [2021-12-17 07:54:09,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 07:54:09,845 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:54:09,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 19 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 07:54:09,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-17 07:54:09,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2021-12-17 07:54:09,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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) [2021-12-17 07:54:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-12-17 07:54:09,848 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2021-12-17 07:54:09,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:54:09,848 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-12-17 07:54:09,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2021-12-17 07:54:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-12-17 07:54:09,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 07:54:09,849 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:54:09,849 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:54:09,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 07:54:09,849 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:54:09,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:54:09,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2048176233, now seen corresponding path program 1 times [2021-12-17 07:54:09,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 07:54:09,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895639029] [2021-12-17 07:54:09,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:54:09,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 07:54:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 07:54:09,872 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 07:54:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 07:54:09,911 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 07:54:09,913 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 07:54:09,914 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 07:54:09,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 07:54:09,919 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-12-17 07:54:09,921 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 07:54:09,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 07:54:09 BoogieIcfgContainer [2021-12-17 07:54:09,936 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 07:54:09,937 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 07:54:09,937 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 07:54:09,949 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 07:54:09,949 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:54:09" (3/4) ... [2021-12-17 07:54:09,951 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-17 07:54:09,951 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 07:54:09,952 INFO L158 Benchmark]: Toolchain (without parser) took 966.06ms. Allocated memory is still 144.7MB. Free memory was 114.8MB in the beginning and 78.9MB in the end (delta: 35.9MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2021-12-17 07:54:09,953 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory was 44.0MB in the beginning and 43.9MB in the end (delta: 41.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:54:09,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.98ms. Allocated memory is still 144.7MB. Free memory was 114.4MB in the beginning and 121.4MB in the end (delta: -7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 07:54:09,960 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.76ms. Allocated memory is still 144.7MB. Free memory was 121.4MB in the beginning and 119.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 07:54:09,960 INFO L158 Benchmark]: Boogie Preprocessor took 18.57ms. Allocated memory is still 144.7MB. Free memory was 119.8MB in the beginning and 118.8MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 07:54:09,961 INFO L158 Benchmark]: RCFGBuilder took 179.76ms. Allocated memory is still 144.7MB. Free memory was 118.8MB in the beginning and 108.9MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 07:54:09,961 INFO L158 Benchmark]: TraceAbstraction took 497.97ms. Allocated memory is still 144.7MB. Free memory was 108.3MB in the beginning and 79.5MB in the end (delta: 28.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-12-17 07:54:09,962 INFO L158 Benchmark]: Witness Printer took 14.55ms. Allocated memory is still 144.7MB. Free memory was 79.5MB in the beginning and 78.9MB in the end (delta: 584.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 07:54:09,966 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory was 44.0MB in the beginning and 43.9MB in the end (delta: 41.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.98ms. Allocated memory is still 144.7MB. Free memory was 114.4MB in the beginning and 121.4MB in the end (delta: -7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.76ms. Allocated memory is still 144.7MB. Free memory was 121.4MB in the beginning and 119.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.57ms. Allocated memory is still 144.7MB. Free memory was 119.8MB in the beginning and 118.8MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 179.76ms. Allocated memory is still 144.7MB. Free memory was 118.8MB in the beginning and 108.9MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 497.97ms. Allocated memory is still 144.7MB. Free memory was 108.3MB in the beginning and 79.5MB in the end (delta: 28.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Witness Printer took 14.55ms. Allocated memory is still 144.7MB. Free memory was 79.5MB in the beginning and 78.9MB in the end (delta: 584.7kB). Peak memory consumption was 2.1MB. 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: 12]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 49, overapproximation of someBinaryArithmeticFLOAToperation at line 35. Possible FailurePath: [L14] float pi = 3.14159 ; VAL [pi=314159/100000] [L20] float x = __VERIFIER_nondet_float() ; [L21] float octant = pi/3 ; [L22] CALL assume_abort_if_not(x > octant && x < pi) [L10] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, pi=314159/100000] [L22] RET assume_abort_if_not(x > octant && x < pi) [L23] float oddExp = x ; [L24] float evenExp = 1.0 ; [L25] float term = x ; [L26] unsigned int count = 2 ; [L27] int multFactor = 0 ; [L28] int temp ; VAL [count=2, evenExp=1, multFactor=0, oddExp=49, pi=314159/100000, term=49, x=49] [L30] COND TRUE 1 [L32] term = term * (x/count) VAL [count=2, evenExp=1, multFactor=0, oddExp=49, pi=314159/100000, x=49] [L33] EXPR (count>>1 % 2 == 0) ? 1 : -1 VAL [(count>>1 % 2 == 0) ? 1 : -1=-1, count=2, evenExp=1, multFactor=0, oddExp=49, pi=314159/100000, x=49] [L33] multFactor = (count>>1 % 2 == 0) ? 1 : -1 [L35] evenExp = evenExp + multFactor*term [L37] count++ [L39] term = term * (x/count) [L41] oddExp = oddExp + multFactor*term [L43] count++ [L45] temp = __VERIFIER_nondet_int() [L46] COND TRUE temp == 0 VAL [count=4, multFactor=-1, pi=314159/100000, temp=0, x=49] [L49] CALL __VERIFIER_assert( oddExp >= evenExp ) [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, pi=314159/100000] [L12] reach_error() VAL [\old(cond)=0, cond=0, pi=314159/100000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 28 mSDtfsCounter, 6 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 21 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-17 07:54:09,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2214d54defcd10650ad85b05551b84060b114c89dc0a9f14233f38f030bbd558 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 07:54:11,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 07:54:11,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 07:54:11,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 07:54:11,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 07:54:11,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 07:54:11,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 07:54:11,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 07:54:11,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 07:54:11,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 07:54:11,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 07:54:11,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 07:54:11,910 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 07:54:11,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 07:54:11,912 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 07:54:11,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 07:54:11,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 07:54:11,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 07:54:11,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 07:54:11,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 07:54:11,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 07:54:11,925 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 07:54:11,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 07:54:11,926 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 07:54:11,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 07:54:11,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 07:54:11,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 07:54:11,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 07:54:11,931 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 07:54:11,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 07:54:11,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 07:54:11,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 07:54:11,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 07:54:11,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 07:54:11,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 07:54:11,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 07:54:11,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 07:54:11,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 07:54:11,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 07:54:11,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 07:54:11,937 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 07:54:11,941 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-17 07:54:11,961 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 07:54:11,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 07:54:11,962 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 07:54:11,962 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 07:54:11,963 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 07:54:11,963 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 07:54:11,964 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 07:54:11,964 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 07:54:11,964 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 07:54:11,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 07:54:11,965 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 07:54:11,965 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 07:54:11,965 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 07:54:11,965 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 07:54:11,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 07:54:11,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 07:54:11,966 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-17 07:54:11,966 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-17 07:54:11,966 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-17 07:54:11,966 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 07:54:11,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 07:54:11,966 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 07:54:11,966 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 07:54:11,967 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 07:54:11,967 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 07:54:11,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 07:54:11,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:54:11,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 07:54:11,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 07:54:11,968 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 07:54:11,968 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-17 07:54:11,968 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-17 07:54:11,968 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 07:54:11,968 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 07:54:11,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 07:54:11,969 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 07:54:11,969 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-17 07:54:11,969 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 -> 2214d54defcd10650ad85b05551b84060b114c89dc0a9f14233f38f030bbd558 [2021-12-17 07:54:12,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 07:54:12,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 07:54:12,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 07:54:12,229 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 07:54:12,230 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 07:54:12,231 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c [2021-12-17 07:54:12,272 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a3bdf05/830942d19f514204ac6636c930fd97f2/FLAGb2df5723f [2021-12-17 07:54:12,642 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 07:54:12,643 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c [2021-12-17 07:54:12,648 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a3bdf05/830942d19f514204ac6636c930fd97f2/FLAGb2df5723f [2021-12-17 07:54:12,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a3bdf05/830942d19f514204ac6636c930fd97f2 [2021-12-17 07:54:12,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 07:54:12,666 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 07:54:12,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 07:54:12,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 07:54:12,670 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 07:54:12,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:54:12" (1/1) ... [2021-12-17 07:54:12,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e96747e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:12, skipping insertion in model container [2021-12-17 07:54:12,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:54:12" (1/1) ... [2021-12-17 07:54:12,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 07:54:12,688 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 07:54:12,794 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/loop-floats-scientific-comp/loop2-2.c[474,487] [2021-12-17 07:54:12,808 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:54:12,816 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 07:54:12,824 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/loop-floats-scientific-comp/loop2-2.c[474,487] [2021-12-17 07:54:12,863 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:54:12,888 INFO L208 MainTranslator]: Completed translation [2021-12-17 07:54:12,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:12 WrapperNode [2021-12-17 07:54:12,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 07:54:12,889 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 07:54:12,889 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 07:54:12,889 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 07:54:12,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:12" (1/1) ... [2021-12-17 07:54:12,899 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:12" (1/1) ... [2021-12-17 07:54:12,939 INFO L137 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2021-12-17 07:54:12,939 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 07:54:12,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 07:54:12,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 07:54:12,940 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 07:54:12,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:12" (1/1) ... [2021-12-17 07:54:12,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:12" (1/1) ... [2021-12-17 07:54:12,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:12" (1/1) ... [2021-12-17 07:54:12,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:12" (1/1) ... [2021-12-17 07:54:12,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:12" (1/1) ... [2021-12-17 07:54:12,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:12" (1/1) ... [2021-12-17 07:54:12,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:12" (1/1) ... [2021-12-17 07:54:12,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 07:54:12,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 07:54:12,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 07:54:12,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 07:54:12,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:12" (1/1) ... [2021-12-17 07:54:12,988 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:54:12,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 07:54:13,005 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 07:54:13,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 07:54:13,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 07:54:13,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 07:54:13,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 07:54:13,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 07:54:13,103 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 07:54:13,104 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 07:54:18,065 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 07:54:18,069 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 07:54:18,069 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 07:54:18,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:54:18 BoogieIcfgContainer [2021-12-17 07:54:18,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 07:54:18,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 07:54:18,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 07:54:18,074 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 07:54:18,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 07:54:12" (1/3) ... [2021-12-17 07:54:18,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5913dd4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:54:18, skipping insertion in model container [2021-12-17 07:54:18,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:54:12" (2/3) ... [2021-12-17 07:54:18,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5913dd4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:54:18, skipping insertion in model container [2021-12-17 07:54:18,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:54:18" (3/3) ... [2021-12-17 07:54:18,076 INFO L111 eAbstractionObserver]: Analyzing ICFG loop2-2.c [2021-12-17 07:54:18,079 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 07:54:18,079 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 07:54:18,108 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 07:54:18,113 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 07:54:18,113 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 07:54:18,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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) [2021-12-17 07:54:18,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-17 07:54:18,144 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:54:18,144 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:54:18,145 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:54:18,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:54:18,153 INFO L85 PathProgramCache]: Analyzing trace with hash 119997515, now seen corresponding path program 1 times [2021-12-17 07:54:18,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:54:18,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333479317] [2021-12-17 07:54:18,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:54:18,163 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:54:18,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:54:18,165 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:54:18,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-17 07:54:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:54:18,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-17 07:54:18,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:54:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:54:18,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:54:18,312 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:54:18,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333479317] [2021-12-17 07:54:18,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333479317] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:54:18,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:54:18,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 07:54:18,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519030612] [2021-12-17 07:54:18,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:54:18,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 07:54:18,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:54:18,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 07:54:18,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 07:54:18,336 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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) [2021-12-17 07:54:18,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:54:18,344 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2021-12-17 07:54:18,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 07:54:18,346 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 [2021-12-17 07:54:18,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:54:18,350 INFO L225 Difference]: With dead ends: 29 [2021-12-17 07:54:18,350 INFO L226 Difference]: Without dead ends: 12 [2021-12-17 07:54:18,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 07:54:18,355 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:54:18,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 07:54:18,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-12-17 07:54:18,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-12-17 07:54:18,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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) [2021-12-17 07:54:18,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2021-12-17 07:54:18,374 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 8 [2021-12-17 07:54:18,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:54:18,375 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-12-17 07:54:18,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2021-12-17 07:54:18,375 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2021-12-17 07:54:18,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 07:54:18,376 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:54:18,376 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:54:18,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-17 07:54:18,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:54:18,586 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:54:18,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:54:18,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2105434535, now seen corresponding path program 1 times [2021-12-17 07:54:18,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:54:18,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592794400] [2021-12-17 07:54:18,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:54:18,588 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:54:18,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:54:18,589 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:54:18,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-17 07:54:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:54:19,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 07:54:19,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:54:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:54:19,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:54:19,229 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:54:19,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592794400] [2021-12-17 07:54:19,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592794400] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:54:19,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:54:19,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 07:54:19,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389990689] [2021-12-17 07:54:19,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:54:19,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 07:54:19,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:54:19,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 07:54:19,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 07:54:19,232 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2021-12-17 07:54:21,999 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:54:24,260 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:54:24,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:54:24,348 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2021-12-17 07:54:24,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 07:54:24,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 11 [2021-12-17 07:54:24,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:54:24,349 INFO L225 Difference]: With dead ends: 23 [2021-12-17 07:54:24,349 INFO L226 Difference]: Without dead ends: 15 [2021-12-17 07:54:24,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 07:54:24,350 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2021-12-17 07:54:24,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 2 Unknown, 0 Unchecked, 5.1s Time] [2021-12-17 07:54:24,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-17 07:54:24,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2021-12-17 07:54:24,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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) [2021-12-17 07:54:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-12-17 07:54:24,354 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2021-12-17 07:54:24,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:54:24,354 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-12-17 07:54:24,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2021-12-17 07:54:24,355 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-12-17 07:54:24,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 07:54:24,355 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:54:24,355 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:54:24,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-17 07:54:24,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:54:24,571 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:54:24,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:54:24,572 INFO L85 PathProgramCache]: Analyzing trace with hash -2048176233, now seen corresponding path program 1 times [2021-12-17 07:54:24,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:54:24,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476939882] [2021-12-17 07:54:24,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:54:24,573 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:54:24,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:54:24,574 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:54:24,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-17 07:54:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:54:27,835 WARN L261 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-17 07:54:27,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:55:03,543 WARN L227 SmtUtils]: Spent 11.08s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 07:55:37,199 WARN L227 SmtUtils]: Spent 18.83s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 07:55:56,429 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1))) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse2)))) is different from false [2021-12-17 07:55:58,509 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1))) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse2)))) is different from true [2021-12-17 07:57:13,061 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)))))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse0)) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse0))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse3)))) is different from false [2021-12-17 07:57:15,140 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)))))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse0)) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse0))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse3)))) is different from true [2021-12-17 07:57:32,454 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse2)))) is different from false [2021-12-17 07:57:34,530 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse2)))) is different from true [2021-12-17 07:57:34,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:57:34,532 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:57:34,532 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:57:34,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476939882] [2021-12-17 07:57:34,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476939882] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:57:34,532 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:57:34,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 07:57:34,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557836829] [2021-12-17 07:57:34,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:57:34,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 07:57:34,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:57:34,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 07:57:34,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=39, Unknown=6, NotChecked=42, Total=110 [2021-12-17 07:57:34,533 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second 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) [2021-12-17 07:57:43,356 WARN L227 SmtUtils]: Spent 5.37s on a formula simplification. DAG size of input: 26 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 07:57:51,218 WARN L227 SmtUtils]: Spent 6.01s on a formula simplification. DAG size of input: 38 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 07:57:53,355 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:57:56,447 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:57:56,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:57:56,996 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2021-12-17 07:57:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 07:57:57,056 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 11 [2021-12-17 07:57:57,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:57:57,057 INFO L225 Difference]: With dead ends: 20 [2021-12-17 07:57:57,057 INFO L226 Difference]: Without dead ends: 16 [2021-12-17 07:57:57,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 73.2s TimeCoverageRelationStatistics Valid=41, Invalid=75, Unknown=6, NotChecked=60, Total=182 [2021-12-17 07:57:57,058 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:57:57,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 11 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 2 Unknown, 28 Unchecked, 7.0s Time] [2021-12-17 07:57:57,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-12-17 07:57:57,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-12-17 07:57:57,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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) [2021-12-17 07:57:57,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2021-12-17 07:57:57,061 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2021-12-17 07:57:57,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:57:57,061 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-12-17 07:57:57,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2021-12-17 07:57:57,062 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2021-12-17 07:57:57,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-17 07:57:57,062 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:57:57,062 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:57:57,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-17 07:57:57,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:57:57,275 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:57:57,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:57:57,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1599389039, now seen corresponding path program 1 times [2021-12-17 07:57:57,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:57:57,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411577499] [2021-12-17 07:57:57,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:57:57,276 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:57:57,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:57:57,277 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:57:57,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-17 07:57:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:57:58,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 07:57:58,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:57:58,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:57:58,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 07:57:58,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:57:58,586 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:57:58,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411577499] [2021-12-17 07:57:58,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411577499] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 07:57:58,587 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 07:57:58,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-17 07:57:58,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525628879] [2021-12-17 07:57:58,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 07:57:58,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 07:57:58,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:57:58,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 07:57:58,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-17 07:57:58,588 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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) [2021-12-17 07:58:01,266 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:58:03,596 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:58:05,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:58:08,102 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:58:10,321 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:58:12,327 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:58:14,522 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:58:16,529 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:58:17,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:58:17,347 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2021-12-17 07:58:17,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 07:58:17,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 15 [2021-12-17 07:58:17,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:58:17,348 INFO L225 Difference]: With dead ends: 35 [2021-12-17 07:58:17,348 INFO L226 Difference]: Without dead ends: 27 [2021-12-17 07:58:17,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-17 07:58:17,349 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2021-12-17 07:58:17,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 25 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 7 Unknown, 0 Unchecked, 18.7s Time] [2021-12-17 07:58:17,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-17 07:58:17,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2021-12-17 07:58:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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) [2021-12-17 07:58:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-12-17 07:58:17,352 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2021-12-17 07:58:17,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:58:17,353 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-12-17 07:58:17,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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) [2021-12-17 07:58:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2021-12-17 07:58:17,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-17 07:58:17,353 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:58:17,353 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:58:17,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-17 07:58:17,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:58:17,558 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:58:17,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:58:17,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1656647341, now seen corresponding path program 1 times [2021-12-17 07:58:17,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:58:17,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127881451] [2021-12-17 07:58:17,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:58:17,559 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:58:17,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:58:17,561 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:58:17,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-17 08:02:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:02:31,845 WARN L261 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-17 08:02:31,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:03:14,751 WARN L227 SmtUtils]: Spent 15.71s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 08:03:51,377 WARN L227 SmtUtils]: Spent 17.31s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 08:04:23,087 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv4294967294 32)))))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1))) (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv4294967295 32)))))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|))) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse2) (= |c_ULTIMATE.start_main_~count~0#1| (_ bv4 32)))) is different from false [2021-12-17 08:05:27,727 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv4294967294 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv4294967295 32)))))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1))) (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|)))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse2))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse3) (= |c_ULTIMATE.start_main_~count~0#1| (_ bv4 32))))) is different from false [2021-12-17 08:06:06,598 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv4294967294 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv4294967295 32)))))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1))) (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|)))) (= (bvadd |c_ULTIMATE.start_main_#t~ite5#1| (_ bv1 32)) (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse2))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse3) (= |c_ULTIMATE.start_main_~count~0#1| (_ bv4 32))))) is different from false [2021-12-17 08:06:08,768 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv4294967294 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv4294967295 32)))))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1))) (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|)))) (= (bvadd |c_ULTIMATE.start_main_#t~ite5#1| (_ bv1 32)) (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse2))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse3) (= |c_ULTIMATE.start_main_~count~0#1| (_ bv4 32))))) is different from true [2021-12-17 08:06:29,331 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse3)))))) is different from false [2021-12-17 08:06:31,451 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse3)))))) is different from true [2021-12-17 08:07:50,838 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (let ((.cse0 (let ((.cse4 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse4)) (fp.mul roundNearestTiesToEven .cse1 .cse3)))))))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse0)) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse0))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse5)))) is different from false [2021-12-17 08:07:52,964 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (let ((.cse0 (let ((.cse4 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse4)) (fp.mul roundNearestTiesToEven .cse1 .cse3)))))))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse0)) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse0))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse5)))) is different from true [2021-12-17 08:08:10,997 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (not (let ((.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse4)))) is different from false [2021-12-17 08:08:13,138 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (not (let ((.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse4)))) is different from true [2021-12-17 08:08:13,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-17 08:08:13,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:08:24,712 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite5#1|))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32))))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)))) is different from false [2021-12-17 08:08:26,838 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite5#1|))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32))))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)))) is different from true [2021-12-17 08:08:33,121 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32))))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)))) is different from false [2021-12-17 08:08:35,205 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32))))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)))) is different from true [2021-12-17 08:08:41,650 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32))))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)))) is different from false [2021-12-17 08:08:43,796 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32))))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)))) is different from true [2021-12-17 08:08:54,799 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite5#1|)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv2 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv3 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)) (fp.mul c_currentRoundingMode .cse2 .cse3))))) is different from false [2021-12-17 08:08:57,028 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite5#1|)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv2 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv3 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)) (fp.mul c_currentRoundingMode .cse2 .cse3))))) is different from true Killed by 15