./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/zonotope_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/zonotope_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 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:24:20,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:24:20,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:24:20,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:24:20,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:24:20,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:24:20,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:24:20,731 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:24:20,740 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:24:20,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:24:20,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:24:20,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:24:20,751 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:24:20,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:24:20,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:24:20,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:24:20,757 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:24:20,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:24:20,760 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:24:20,765 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:24:20,767 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:24:20,768 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:24:20,769 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:24:20,770 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:24:20,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:24:20,778 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:24:20,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:24:20,779 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:24:20,780 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:24:20,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:24:20,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:24:20,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:24:20,784 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:24:20,785 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:24:20,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:24:20,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:24:20,788 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:24:20,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:24:20,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:24:20,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:24:20,789 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:24:20,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:24:20,800 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 01:24:20,833 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:24:20,833 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:24:20,834 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:24:20,834 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:24:20,835 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:24:20,835 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:24:20,836 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:24:20,836 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:24:20,836 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:24:20,837 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:24:20,837 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:24:20,838 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 01:24:20,838 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:24:20,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:24:20,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:24:20,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:24:20,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:24:20,839 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:24:20,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:24:20,840 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:24:20,840 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:24:20,840 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:24:20,840 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:24:20,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:24:20,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:24:20,841 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:24:20,841 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:24:20,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:24:20,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 01:24:20,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 01:24:20,842 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:24:20,842 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:24:20,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:24:20,843 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 -> 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 [2022-07-21 01:24:21,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:24:21,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:24:21,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:24:21,211 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:24:21,211 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:24:21,213 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/zonotope_2.c [2022-07-21 01:24:21,290 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9097efae/427ea26e175b449eb6abeb891231f1c7/FLAG43395163e [2022-07-21 01:24:21,705 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:24:21,706 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/zonotope_2.c [2022-07-21 01:24:21,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9097efae/427ea26e175b449eb6abeb891231f1c7/FLAG43395163e [2022-07-21 01:24:21,724 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9097efae/427ea26e175b449eb6abeb891231f1c7 [2022-07-21 01:24:21,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:24:21,727 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:24:21,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:24:21,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:24:21,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:24:21,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:24:21" (1/1) ... [2022-07-21 01:24:21,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cf6c64b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:21, skipping insertion in model container [2022-07-21 01:24:21,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:24:21" (1/1) ... [2022-07-21 01:24:21,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:24:21,752 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:24:21,857 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/float-benchs/zonotope_2.c[473,486] [2022-07-21 01:24:21,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:24:21,882 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:24:21,895 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/float-benchs/zonotope_2.c[473,486] [2022-07-21 01:24:21,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:24:21,915 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:24:21,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:21 WrapperNode [2022-07-21 01:24:21,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:24:21,918 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:24:21,918 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:24:21,918 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:24:21,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:21" (1/1) ... [2022-07-21 01:24:21,930 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:21" (1/1) ... [2022-07-21 01:24:21,945 INFO L137 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2022-07-21 01:24:21,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:24:21,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:24:21,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:24:21,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:24:21,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:21" (1/1) ... [2022-07-21 01:24:21,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:21" (1/1) ... [2022-07-21 01:24:21,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:21" (1/1) ... [2022-07-21 01:24:21,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:21" (1/1) ... [2022-07-21 01:24:21,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:21" (1/1) ... [2022-07-21 01:24:21,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:21" (1/1) ... [2022-07-21 01:24:21,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:21" (1/1) ... [2022-07-21 01:24:21,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:24:21,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:24:21,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:24:21,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:24:21,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:21" (1/1) ... [2022-07-21 01:24:21,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:24:22,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:24:22,017 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 01:24:22,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 01:24:22,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:24:22,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:24:22,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:24:22,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 01:24:22,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-21 01:24:22,075 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-21 01:24:22,127 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:24:22,129 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:24:22,261 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:24:22,268 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:24:22,268 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 01:24:22,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:24:22 BoogieIcfgContainer [2022-07-21 01:24:22,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:24:22,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:24:22,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:24:22,275 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:24:22,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:24:21" (1/3) ... [2022-07-21 01:24:22,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a47940f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:24:22, skipping insertion in model container [2022-07-21 01:24:22,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:21" (2/3) ... [2022-07-21 01:24:22,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a47940f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:24:22, skipping insertion in model container [2022-07-21 01:24:22,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:24:22" (3/3) ... [2022-07-21 01:24:22,278 INFO L111 eAbstractionObserver]: Analyzing ICFG zonotope_2.c [2022-07-21 01:24:22,294 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:24:22,295 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:24:22,357 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:24:22,365 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@cdac1a9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2b1c48b6 [2022-07-21 01:24:22,366 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:24:22,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 01:24:22,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 01:24:22,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:24:22,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:24:22,390 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:24:22,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:24:22,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1815999968, now seen corresponding path program 1 times [2022-07-21 01:24:22,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:24:22,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060815187] [2022-07-21 01:24:22,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:24:22,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:24:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:24:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:24:22,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:24:22,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060815187] [2022-07-21 01:24:22,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060815187] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:24:22,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:24:22,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 01:24:22,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509488215] [2022-07-21 01:24:22,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:24:22,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 01:24:22,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:24:22,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 01:24:22,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 01:24:22,567 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:24:22,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:24:22,585 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-07-21 01:24:22,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 01:24:22,589 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-21 01:24:22,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:24:22,606 INFO L225 Difference]: With dead ends: 32 [2022-07-21 01:24:22,607 INFO L226 Difference]: Without dead ends: 13 [2022-07-21 01:24:22,611 INFO L412 NwaCegarLoop]: 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 [2022-07-21 01:24:22,615 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:24:22,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:24:22,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-07-21 01:24:22,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-21 01:24:22,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 01:24:22,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-07-21 01:24:22,656 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2022-07-21 01:24:22,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:24:22,656 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-21 01:24:22,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:24:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-07-21 01:24:22,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 01:24:22,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:24:22,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:24:22,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 01:24:22,659 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:24:22,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:24:22,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1808611800, now seen corresponding path program 1 times [2022-07-21 01:24:22,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:24:22,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326795488] [2022-07-21 01:24:22,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:24:22,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:24:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:24:22,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:24:22,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:24:22,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326795488] [2022-07-21 01:24:22,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326795488] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:24:22,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:24:22,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 01:24:22,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190234580] [2022-07-21 01:24:22,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:24:22,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 01:24:22,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:24:22,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 01:24:22,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 01:24:22,756 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:24:22,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:24:22,784 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-07-21 01:24:22,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 01:24:22,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-21 01:24:22,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:24:22,786 INFO L225 Difference]: With dead ends: 24 [2022-07-21 01:24:22,786 INFO L226 Difference]: Without dead ends: 17 [2022-07-21 01:24:22,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 01:24:22,787 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:24:22,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:24:22,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-21 01:24:22,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2022-07-21 01:24:22,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 01:24:22,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-07-21 01:24:22,794 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2022-07-21 01:24:22,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:24:22,795 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-07-21 01:24:22,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:24:22,795 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-07-21 01:24:22,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 01:24:22,796 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:24:22,796 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:24:22,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 01:24:22,796 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:24:22,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:24:22,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1810339678, now seen corresponding path program 1 times [2022-07-21 01:24:22,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:24:22,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667020152] [2022-07-21 01:24:22,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:24:22,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:24:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 01:24:22,814 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 01:24:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 01:24:22,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 01:24:22,837 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 01:24:22,838 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 01:24:22,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 01:24:22,843 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-21 01:24:22,846 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 01:24:22,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 01:24:22 BoogieIcfgContainer [2022-07-21 01:24:22,865 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 01:24:22,865 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 01:24:22,866 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 01:24:22,866 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 01:24:22,866 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:24:22" (3/4) ... [2022-07-21 01:24:22,869 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-21 01:24:22,869 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 01:24:22,870 INFO L158 Benchmark]: Toolchain (without parser) took 1142.33ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 40.7MB in the beginning and 43.1MB in the end (delta: -2.3MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2022-07-21 01:24:22,871 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 60.8MB. Free memory was 42.4MB in the beginning and 42.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:24:22,871 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.53ms. Allocated memory is still 60.8MB. Free memory was 40.6MB in the beginning and 30.9MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 01:24:22,871 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.51ms. Allocated memory is still 60.8MB. Free memory was 30.7MB in the beginning and 29.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:24:22,872 INFO L158 Benchmark]: Boogie Preprocessor took 36.95ms. Allocated memory is still 60.8MB. Free memory was 29.3MB in the beginning and 28.4MB in the end (delta: 904.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:24:22,872 INFO L158 Benchmark]: RCFGBuilder took 286.40ms. Allocated memory is still 60.8MB. Free memory was 28.4MB in the beginning and 38.4MB in the end (delta: -10.1MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2022-07-21 01:24:22,873 INFO L158 Benchmark]: TraceAbstraction took 592.99ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 38.0MB in the beginning and 43.4MB in the end (delta: -5.5MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2022-07-21 01:24:22,873 INFO L158 Benchmark]: Witness Printer took 3.82ms. Allocated memory is still 75.5MB. Free memory was 43.4MB in the beginning and 43.1MB in the end (delta: 344.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:24:22,876 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.23ms. Allocated memory is still 60.8MB. Free memory was 42.4MB in the beginning and 42.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.53ms. Allocated memory is still 60.8MB. Free memory was 40.6MB in the beginning and 30.9MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.51ms. Allocated memory is still 60.8MB. Free memory was 30.7MB in the beginning and 29.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.95ms. Allocated memory is still 60.8MB. Free memory was 29.3MB in the beginning and 28.4MB in the end (delta: 904.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 286.40ms. Allocated memory is still 60.8MB. Free memory was 28.4MB in the beginning and 38.4MB in the end (delta: -10.1MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * TraceAbstraction took 592.99ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 38.0MB in the beginning and 43.4MB in the end (delta: -5.5MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * Witness Printer took 3.82ms. Allocated memory is still 75.5MB. Free memory was 43.4MB in the beginning and 43.1MB in the end (delta: 344.5kB). 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: 10]: 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 25, overapproximation of someBinaryArithmeticFLOAToperation at line 22. Possible FailurePath: [L14] float x = 12.f; [L15] float x1 = 12.f; [L16] float y = 16.f; [L17] float y1 = 16.f; [L18] int i; [L19] i = 0 VAL [i=0, x=12, x1=12, y=16, y1=16] [L19] COND TRUE i < 100000 [L20] x = x1 [L21] y = y1 [L22] x1 = 3.f * x / 4.f + y / 4.f [L23] y1 = x / 4.f + 3.f * y / 4.f VAL [i=0, x=12, y=16] [L25] CALL __VERIFIER_assert(x1 >= 0.f && x1 <= 100.f) VAL [\old(cond)=0] [L10] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L10] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 34 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 14 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 [2022-07-21 01:24:22,932 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/float-benchs/zonotope_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 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:24:24,848 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:24:24,851 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:24:24,897 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:24:24,898 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:24:24,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:24:24,904 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:24:24,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:24:24,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:24:24,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:24:24,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:24:24,919 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:24:24,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:24:24,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:24:24,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:24:24,931 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:24:24,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:24:24,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:24:24,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:24:24,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:24:24,941 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:24:24,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:24:24,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:24:24,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:24:24,947 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:24:24,951 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:24:24,952 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:24:24,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:24:24,953 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:24:24,954 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:24:24,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:24:24,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:24:24,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:24:24,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:24:24,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:24:24,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:24:24,960 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:24:24,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:24:24,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:24:24,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:24:24,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:24:24,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:24:24,967 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-21 01:24:25,015 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:24:25,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:24:25,017 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:24:25,017 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:24:25,018 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:24:25,018 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:24:25,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:24:25,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:24:25,019 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:24:25,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:24:25,020 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:24:25,020 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:24:25,021 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:24:25,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:24:25,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:24:25,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:24:25,021 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 01:24:25,022 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 01:24:25,022 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 01:24:25,022 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:24:25,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:24:25,022 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:24:25,023 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:24:25,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:24:25,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:24:25,023 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:24:25,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:24:25,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:24:25,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:24:25,024 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:24:25,025 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 01:24:25,025 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 01:24:25,025 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:24:25,025 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:24:25,026 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:24:25,026 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 01:24:25,026 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 -> 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 [2022-07-21 01:24:25,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:24:25,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:24:25,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:24:25,364 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:24:25,365 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:24:25,366 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/zonotope_2.c [2022-07-21 01:24:25,423 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398619e19/f87c46dd00604cc98ff4dcb0d48ddaa9/FLAGd26999f97 [2022-07-21 01:24:25,847 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:24:25,848 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/zonotope_2.c [2022-07-21 01:24:25,853 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398619e19/f87c46dd00604cc98ff4dcb0d48ddaa9/FLAGd26999f97 [2022-07-21 01:24:26,257 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398619e19/f87c46dd00604cc98ff4dcb0d48ddaa9 [2022-07-21 01:24:26,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:24:26,263 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:24:26,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:24:26,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:24:26,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:24:26,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:24:26" (1/1) ... [2022-07-21 01:24:26,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bfd8dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:26, skipping insertion in model container [2022-07-21 01:24:26,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:24:26" (1/1) ... [2022-07-21 01:24:26,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:24:26,293 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:24:26,439 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/float-benchs/zonotope_2.c[473,486] [2022-07-21 01:24:26,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:24:26,461 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:24:26,472 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/float-benchs/zonotope_2.c[473,486] [2022-07-21 01:24:26,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:24:26,523 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:24:26,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:26 WrapperNode [2022-07-21 01:24:26,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:24:26,525 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:24:26,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:24:26,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:24:26,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:26" (1/1) ... [2022-07-21 01:24:26,539 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:26" (1/1) ... [2022-07-21 01:24:26,554 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2022-07-21 01:24:26,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:24:26,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:24:26,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:24:26,556 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:24:26,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:26" (1/1) ... [2022-07-21 01:24:26,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:26" (1/1) ... [2022-07-21 01:24:26,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:26" (1/1) ... [2022-07-21 01:24:26,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:26" (1/1) ... [2022-07-21 01:24:26,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:26" (1/1) ... [2022-07-21 01:24:26,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:26" (1/1) ... [2022-07-21 01:24:26,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:26" (1/1) ... [2022-07-21 01:24:26,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:24:26,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:24:26,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:24:26,576 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:24:26,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:26" (1/1) ... [2022-07-21 01:24:26,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:24:26,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:24:26,609 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 01:24:26,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 01:24:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:24:26,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:24:26,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:24:26,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 01:24:26,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-21 01:24:26,647 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-21 01:24:26,700 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:24:26,701 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:24:28,898 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:24:28,903 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:24:28,903 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 01:24:28,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:24:28 BoogieIcfgContainer [2022-07-21 01:24:28,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:24:28,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:24:28,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:24:28,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:24:28,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:24:26" (1/3) ... [2022-07-21 01:24:28,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb4e04d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:24:28, skipping insertion in model container [2022-07-21 01:24:28,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:24:26" (2/3) ... [2022-07-21 01:24:28,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb4e04d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:24:28, skipping insertion in model container [2022-07-21 01:24:28,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:24:28" (3/3) ... [2022-07-21 01:24:28,912 INFO L111 eAbstractionObserver]: Analyzing ICFG zonotope_2.c [2022-07-21 01:24:28,925 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:24:28,926 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:24:28,973 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:24:28,979 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@31fad4fa, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@708d2e8 [2022-07-21 01:24:28,980 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:24:28,983 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 01:24:28,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 01:24:28,989 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:24:28,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:24:28,990 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:24:28,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:24:28,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1815999968, now seen corresponding path program 1 times [2022-07-21 01:24:29,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:24:29,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14639332] [2022-07-21 01:24:29,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:24:29,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:24:29,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:24:29,011 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:24:29,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-21 01:24:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:24:29,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-21 01:24:29,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:24:29,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:24:29,179 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:24:29,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:24:29,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [14639332] [2022-07-21 01:24:29,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [14639332] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:24:29,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:24:29,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 01:24:29,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256162198] [2022-07-21 01:24:29,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:24:29,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 01:24:29,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:24:29,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 01:24:29,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 01:24:29,244 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:24:29,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:24:29,259 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-07-21 01:24:29,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 01:24:29,261 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-21 01:24:29,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:24:29,267 INFO L225 Difference]: With dead ends: 32 [2022-07-21 01:24:29,267 INFO L226 Difference]: Without dead ends: 13 [2022-07-21 01:24:29,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 01:24:29,273 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:24:29,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:24:29,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-07-21 01:24:29,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-21 01:24:29,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 01:24:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-07-21 01:24:29,302 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2022-07-21 01:24:29,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:24:29,302 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-21 01:24:29,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:24:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-07-21 01:24:29,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 01:24:29,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:24:29,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:24:29,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-21 01:24:29,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:24:29,520 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:24:29,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:24:29,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1808611800, now seen corresponding path program 1 times [2022-07-21 01:24:29,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:24:29,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885650375] [2022-07-21 01:24:29,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:24:29,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:24:29,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:24:29,524 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:24:29,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-21 01:24:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:24:29,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 01:24:29,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:24:29,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:24:29,625 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:24:29,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:24:29,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1885650375] [2022-07-21 01:24:29,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1885650375] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:24:29,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:24:29,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 01:24:29,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102865492] [2022-07-21 01:24:29,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:24:29,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 01:24:29,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:24:29,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 01:24:29,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 01:24:29,630 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:24:31,773 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 [] [2022-07-21 01:24:31,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:24:31,827 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-07-21 01:24:31,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 01:24:31,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-21 01:24:31,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:24:31,829 INFO L225 Difference]: With dead ends: 21 [2022-07-21 01:24:31,829 INFO L226 Difference]: Without dead ends: 14 [2022-07-21 01:24:31,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 01:24:31,836 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-21 01:24:31,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-21 01:24:31,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-07-21 01:24:31,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-07-21 01:24:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 01:24:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-07-21 01:24:31,854 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2022-07-21 01:24:31,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:24:31,854 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-07-21 01:24:31,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:24:31,854 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-07-21 01:24:31,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 01:24:31,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:24:31,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:24:31,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-21 01:24:32,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:24:32,056 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:24:32,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:24:32,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1810339678, now seen corresponding path program 1 times [2022-07-21 01:24:32,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:24:32,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608048713] [2022-07-21 01:24:32,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:24:32,058 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:24:32,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:24:32,059 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:24:32,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-21 01:24:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:24:32,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 01:24:32,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:24:32,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:24:32,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:24:32,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:24:32,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608048713] [2022-07-21 01:24:32,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608048713] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:24:32,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:24:32,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 01:24:32,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465619777] [2022-07-21 01:24:32,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:24:32,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 01:24:32,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:24:32,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 01:24:32,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:24:32,505 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:24:33,685 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:24:35,810 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:24:38,154 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:24:38,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:24:38,293 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-07-21 01:24:38,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 01:24:38,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-21 01:24:38,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:24:38,297 INFO L225 Difference]: With dead ends: 31 [2022-07-21 01:24:38,297 INFO L226 Difference]: Without dead ends: 29 [2022-07-21 01:24:38,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-21 01:24:38,298 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-21 01:24:38,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 48 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 2 Unknown, 0 Unchecked, 5.7s Time] [2022-07-21 01:24:38,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-21 01:24:38,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-07-21 01:24:38,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 01:24:38,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-21 01:24:38,307 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 7 [2022-07-21 01:24:38,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:24:38,307 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-21 01:24:38,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:24:38,308 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-21 01:24:38,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 01:24:38,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:24:38,309 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:24:38,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-21 01:24:38,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:24:38,516 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:24:38,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:24:38,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1269539930, now seen corresponding path program 1 times [2022-07-21 01:24:38,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:24:38,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262517098] [2022-07-21 01:24:38,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:24:38,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:24:38,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:24:38,520 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:24:38,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-21 01:24:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:24:38,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 01:24:38,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:24:39,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:24:39,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:24:49,433 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2022-07-21 01:24:51,457 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2022-07-21 01:24:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:24:51,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:24:51,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262517098] [2022-07-21 01:24:51,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262517098] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-21 01:24:51,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 01:24:51,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2022-07-21 01:24:51,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895172784] [2022-07-21 01:24:51,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:24:51,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:24:51,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:24:51,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:24:51,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=67, Unknown=2, NotChecked=16, Total=110 [2022-07-21 01:24:51,483 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:24:53,517 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (fp.leq .cse0 .cse1) (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24)) (fp.geq .cse0 (_ +zero 8 24)) (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse1))) is different from false [2022-07-21 01:24:55,542 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (fp.leq .cse0 .cse1) (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24)) (fp.geq .cse0 (_ +zero 8 24)) (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse1))) is different from true [2022-07-21 01:24:57,713 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:24:57,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:24:57,850 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-07-21 01:24:57,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 01:24:57,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-07-21 01:24:57,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:24:57,851 INFO L225 Difference]: With dead ends: 33 [2022-07-21 01:24:57,852 INFO L226 Difference]: Without dead ends: 29 [2022-07-21 01:24:57,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=31, Invalid=83, Unknown=4, NotChecked=38, Total=156 [2022-07-21 01:24:57,853 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-21 01:24:57,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 46 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 1 Unknown, 23 Unchecked, 2.3s Time] [2022-07-21 01:24:57,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-21 01:24:57,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-21 01:24:57,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 01:24:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-07-21 01:24:57,863 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 12 [2022-07-21 01:24:57,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:24:57,864 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-07-21 01:24:57,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 01:24:57,864 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-07-21 01:24:57,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 01:24:57,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:24:57,865 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:24:57,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-21 01:24:58,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:24:58,068 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:24:58,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:24:58,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1102679400, now seen corresponding path program 1 times [2022-07-21 01:24:58,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:24:58,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869927615] [2022-07-21 01:24:58,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:24:58,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:24:58,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:24:58,070 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:24:58,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-21 01:24:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:24:58,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 01:24:58,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:24:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 01:24:58,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:24:58,396 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 01:24:58,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:24:58,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869927615] [2022-07-21 01:24:58,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869927615] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:24:58,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:24:58,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-21 01:24:58,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746185779] [2022-07-21 01:24:58,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:24:58,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:24:58,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:24:58,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:24:58,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:24:58,398 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 01:25:00,504 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:25:02,681 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:25:02,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:25:02,782 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-07-21 01:25:02,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 01:25:02,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2022-07-21 01:25:02,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:25:02,784 INFO L225 Difference]: With dead ends: 40 [2022-07-21 01:25:02,784 INFO L226 Difference]: Without dead ends: 30 [2022-07-21 01:25:02,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:25:02,785 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-21 01:25:02,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-07-21 01:25:02,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-21 01:25:02,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-21 01:25:02,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 01:25:02,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-07-21 01:25:02,791 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2022-07-21 01:25:02,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:25:02,792 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-07-21 01:25:02,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 01:25:02,792 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-07-21 01:25:02,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 01:25:02,793 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:25:02,793 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:25:02,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-21 01:25:02,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:25:02,994 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:25:02,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:25:02,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1100951522, now seen corresponding path program 1 times [2022-07-21 01:25:02,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:25:02,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662665067] [2022-07-21 01:25:02,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:25:02,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:25:02,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:25:02,996 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:25:02,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-21 01:25:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:25:03,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 01:25:03,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:25:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 01:25:04,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:25:12,887 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2022-07-21 01:25:14,916 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2022-07-21 01:25:48,987 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2022-07-21 01:25:51,068 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2022-07-21 01:25:51,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-07-21 01:25:51,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:25:51,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662665067] [2022-07-21 01:25:51,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662665067] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:25:51,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:25:51,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-07-21 01:25:51,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758026806] [2022-07-21 01:25:51,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:25:51,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 01:25:51,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:25:51,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 01:25:51,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=83, Unknown=4, NotChecked=38, Total=156 [2022-07-21 01:25:51,103 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 01:25:52,858 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:25:54,963 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:25:57,120 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (= ((_ to_fp 8 24) c_currentRoundingMode 12.0) |c_ULTIMATE.start_main_~x1~0#1|) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-21 01:25:59,667 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1)))) (and (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse1))) (fp.geq .cse4 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) .cse1) (fp.div c_currentRoundingMode .cse3 .cse1))) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-07-21 01:26:02,139 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 [] [2022-07-21 01:26:02,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:26:02,269 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-07-21 01:26:02,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 01:26:02,274 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2022-07-21 01:26:02,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:26:02,274 INFO L225 Difference]: With dead ends: 42 [2022-07-21 01:26:02,274 INFO L226 Difference]: Without dead ends: 40 [2022-07-21 01:26:02,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=53, Invalid=139, Unknown=6, NotChecked=108, Total=306 [2022-07-21 01:26:02,276 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-21 01:26:02,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 66 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 2 Unknown, 66 Unchecked, 6.3s Time] [2022-07-21 01:26:02,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-21 01:26:02,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2022-07-21 01:26:02,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 01:26:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-07-21 01:26:02,284 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 19 [2022-07-21 01:26:02,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:26:02,284 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-07-21 01:26:02,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 01:26:02,284 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-07-21 01:26:02,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-21 01:26:02,285 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:26:02,285 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-21 01:26:02,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-21 01:26:02,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:26:02,497 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:26:02,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:26:02,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1943528346, now seen corresponding path program 2 times [2022-07-21 01:26:02,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:26:02,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112723837] [2022-07-21 01:26:02,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 01:26:02,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:26:02,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:26:02,499 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:26:02,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-21 01:26:02,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 01:26:02,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 01:26:02,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 01:26:02,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:26:04,519 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 01:26:04,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:26:14,943 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2022-07-21 01:26:16,971 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2022-07-21 01:26:51,600 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2022-07-21 01:26:53,674 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2022-07-21 01:26:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 3 not checked. [2022-07-21 01:26:53,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:26:53,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112723837] [2022-07-21 01:26:53,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112723837] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:26:53,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:26:53,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-07-21 01:26:53,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656129208] [2022-07-21 01:26:53,689 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:26:53,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 01:26:53,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:26:53,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 01:26:53,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=83, Unknown=4, NotChecked=38, Total=156 [2022-07-21 01:26:53,690 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 01:26:55,711 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:26:57,825 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:27:00,035 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (= ((_ to_fp 8 24) c_currentRoundingMode 12.0) |c_ULTIMATE.start_main_~x1~0#1|) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-21 01:27:02,072 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 16.0))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse4) .cse2))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) .cse2) (fp.div c_currentRoundingMode .cse4 .cse2))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-07-21 01:27:04,487 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:27:04,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:27:04,617 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-07-21 01:27:04,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 01:27:04,622 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2022-07-21 01:27:04,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:27:04,623 INFO L225 Difference]: With dead ends: 40 [2022-07-21 01:27:04,623 INFO L226 Difference]: Without dead ends: 38 [2022-07-21 01:27:04,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=53, Invalid=139, Unknown=6, NotChecked=108, Total=306 [2022-07-21 01:27:04,624 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-21 01:27:04,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 74 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 3 Unknown, 63 Unchecked, 6.6s Time] [2022-07-21 01:27:04,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-21 01:27:04,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-21 01:27:04,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 01:27:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-07-21 01:27:04,632 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 24 [2022-07-21 01:27:04,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:27:04,633 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-07-21 01:27:04,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 01:27:04,633 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-07-21 01:27:04,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-21 01:27:04,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:27:04,634 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-21 01:27:04,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-21 01:27:04,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:27:04,836 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:27:04,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:27:04,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1358239522, now seen corresponding path program 3 times [2022-07-21 01:27:04,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:27:04,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204116735] [2022-07-21 01:27:04,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 01:27:04,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:27:04,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:27:04,841 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:27:04,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-21 01:27:05,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-21 01:27:05,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 01:27:05,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-21 01:27:05,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:27:11,827 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-21 01:27:11,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:27:22,271 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2022-07-21 01:27:24,321 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2022-07-21 01:27:59,483 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2022-07-21 01:28:01,567 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2022-07-21 01:28:38,206 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2022-07-21 01:28:40,348 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2022-07-21 01:28:40,370 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 8 not checked. [2022-07-21 01:28:40,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:28:40,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204116735] [2022-07-21 01:28:40,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204116735] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:28:40,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:28:40,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-07-21 01:28:40,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636379430] [2022-07-21 01:28:40,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:28:40,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-21 01:28:40,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:28:40,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-21 01:28:40,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=99, Unknown=8, NotChecked=66, Total=210 [2022-07-21 01:28:40,372 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-21 01:28:42,401 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:28:44,542 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 [] [2022-07-21 01:28:46,842 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:28:49,134 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 12.0) |c_ULTIMATE.start_main_~x1~0#1|) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-07-21 01:28:51,282 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 12.0) |c_ULTIMATE.start_main_~x1~0#1|) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-21 01:28:53,382 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 16.0))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse4) .cse2))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) .cse2) (fp.div c_currentRoundingMode .cse4 .cse2))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-07-21 01:28:55,787 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse5) .cse2) (fp.div c_currentRoundingMode .cse6 .cse2))) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse6) .cse2))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2))) (fp.geq .cse4 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) .cse2))) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-07-21 01:28:58,273 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:28:58,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:28:58,423 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2022-07-21 01:28:58,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 01:28:58,423 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 31 [2022-07-21 01:28:58,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:28:58,424 INFO L225 Difference]: With dead ends: 55 [2022-07-21 01:28:58,424 INFO L226 Difference]: Without dead ends: 53 [2022-07-21 01:28:58,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=61, Invalid=161, Unknown=12, NotChecked=186, Total=420 [2022-07-21 01:28:58,425 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-07-21 01:28:58,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 72 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 4 Unknown, 102 Unchecked, 9.1s Time] [2022-07-21 01:28:58,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-21 01:28:58,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-07-21 01:28:58,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 01:28:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-07-21 01:28:58,433 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 31 [2022-07-21 01:28:58,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:28:58,433 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-07-21 01:28:58,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-21 01:28:58,434 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-07-21 01:28:58,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 01:28:58,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:28:58,435 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-07-21 01:28:58,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-21 01:28:58,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:28:58,644 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:28:58,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:28:58,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1721810214, now seen corresponding path program 4 times [2022-07-21 01:28:58,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:28:58,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498605133] [2022-07-21 01:28:58,645 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 01:28:58,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:28:58,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:28:58,646 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:28:58,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-21 01:28:59,016 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 01:28:59,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 01:28:59,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-21 01:28:59,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:29:05,559 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-21 01:29:05,559 INFO L328 TraceCheckSpWp]: Computing backward predicates...