./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 26d01a9c 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/bitvector/soft_float_2a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f330893f1140a32f6e6dacd6cc5115391759545d59ea17334f6f3b644ed5a51c --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 07:42:06,779 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 07:42:06,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 07:42:06,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 07:42:06,818 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 07:42:06,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 07:42:06,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 07:42:06,826 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 07:42:06,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 07:42:06,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 07:42:06,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 07:42:06,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 07:42:06,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 07:42:06,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 07:42:06,832 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 07:42:06,834 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 07:42:06,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 07:42:06,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 07:42:06,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 07:42:06,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 07:42:06,841 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 07:42:06,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 07:42:06,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 07:42:06,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 07:42:06,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 07:42:06,853 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 07:42:06,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 07:42:06,854 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 07:42:06,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 07:42:06,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 07:42:06,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 07:42:06,858 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 07:42:06,859 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 07:42:06,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 07:42:06,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 07:42:06,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 07:42:06,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 07:42:06,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 07:42:06,863 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 07:42:06,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 07:42:06,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 07:42:06,866 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-02-18 07:42:06,891 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 07:42:06,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 07:42:06,891 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 07:42:06,892 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 07:42:06,892 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 07:42:06,893 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 07:42:06,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 07:42:06,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 07:42:06,893 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 07:42:06,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 07:42:06,894 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 07:42:06,895 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 07:42:06,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 07:42:06,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 07:42:06,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 07:42:06,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 07:42:06,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 07:42:06,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 07:42:06,896 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-18 07:42:06,896 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 07:42:06,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 07:42:06,896 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 07:42:06,897 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 07:42:06,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 07:42:06,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 07:42:06,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 07:42:06,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 07:42:06,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 07:42:06,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 07:42:06,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 07:42:06,898 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 07:42:06,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 07:42:06,899 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 07:42:06,899 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 07:42:06,899 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 07:42:06,899 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 07:42:06,899 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 07:42:06,899 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 ! overflow) ) 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 -> f330893f1140a32f6e6dacd6cc5115391759545d59ea17334f6f3b644ed5a51c [2023-02-18 07:42:07,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 07:42:07,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 07:42:07,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 07:42:07,185 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 07:42:07,185 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 07:42:07,186 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2023-02-18 07:42:08,438 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 07:42:08,652 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 07:42:08,652 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2023-02-18 07:42:08,660 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48c23cce1/c723d14937f844e9b2df071b8fd34324/FLAG0c28fd2ba [2023-02-18 07:42:08,672 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48c23cce1/c723d14937f844e9b2df071b8fd34324 [2023-02-18 07:42:08,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 07:42:08,676 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 07:42:08,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 07:42:08,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 07:42:08,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 07:42:08,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:42:08" (1/1) ... [2023-02-18 07:42:08,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48f7000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:08, skipping insertion in model container [2023-02-18 07:42:08,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:42:08" (1/1) ... [2023-02-18 07:42:08,695 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 07:42:08,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 07:42:08,834 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c[728,741] [2023-02-18 07:42:08,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 07:42:08,906 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 07:42:08,916 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c[728,741] [2023-02-18 07:42:08,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 07:42:08,954 INFO L208 MainTranslator]: Completed translation [2023-02-18 07:42:08,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:08 WrapperNode [2023-02-18 07:42:08,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 07:42:08,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 07:42:08,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 07:42:08,957 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 07:42:08,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:08" (1/1) ... [2023-02-18 07:42:08,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:08" (1/1) ... [2023-02-18 07:42:09,014 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 178 [2023-02-18 07:42:09,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 07:42:09,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 07:42:09,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 07:42:09,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 07:42:09,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:08" (1/1) ... [2023-02-18 07:42:09,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:08" (1/1) ... [2023-02-18 07:42:09,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:08" (1/1) ... [2023-02-18 07:42:09,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:08" (1/1) ... [2023-02-18 07:42:09,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:08" (1/1) ... [2023-02-18 07:42:09,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:08" (1/1) ... [2023-02-18 07:42:09,054 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:08" (1/1) ... [2023-02-18 07:42:09,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:08" (1/1) ... [2023-02-18 07:42:09,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 07:42:09,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 07:42:09,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 07:42:09,063 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 07:42:09,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:08" (1/1) ... [2023-02-18 07:42:09,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 07:42:09,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:09,133 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) [2023-02-18 07:42:09,135 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 [2023-02-18 07:42:09,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 07:42:09,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 07:42:09,167 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-18 07:42:09,167 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-18 07:42:09,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 07:42:09,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 07:42:09,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 07:42:09,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 07:42:09,232 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 07:42:09,234 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 07:42:09,696 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 07:42:09,703 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 07:42:09,704 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 07:42:09,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:42:09 BoogieIcfgContainer [2023-02-18 07:42:09,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 07:42:09,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 07:42:09,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 07:42:09,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 07:42:09,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 07:42:08" (1/3) ... [2023-02-18 07:42:09,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3533baa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:42:09, skipping insertion in model container [2023-02-18 07:42:09,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:08" (2/3) ... [2023-02-18 07:42:09,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3533baa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:42:09, skipping insertion in model container [2023-02-18 07:42:09,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:42:09" (3/3) ... [2023-02-18 07:42:09,713 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_2a.c.cil.c [2023-02-18 07:42:09,731 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 07:42:09,731 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-02-18 07:42:09,797 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 07:42:09,803 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@52d56838, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 07:42:09,803 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-02-18 07:42:09,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 84 states have (on average 1.6785714285714286) internal successors, (141), 103 states have internal predecessors, (141), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 07:42:09,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 07:42:09,813 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:09,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:09,814 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:09,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:09,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1074403763, now seen corresponding path program 1 times [2023-02-18 07:42:09,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:09,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854666044] [2023-02-18 07:42:09,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:09,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:10,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:10,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:10,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854666044] [2023-02-18 07:42:10,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854666044] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:10,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:10,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 07:42:10,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481736324] [2023-02-18 07:42:10,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:10,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:42:10,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:10,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:42:10,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:42:10,100 INFO L87 Difference]: Start difference. First operand has 110 states, 84 states have (on average 1.6785714285714286) internal successors, (141), 103 states have internal predecessors, (141), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:42:10,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:10,268 INFO L93 Difference]: Finished difference Result 265 states and 384 transitions. [2023-02-18 07:42:10,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:42:10,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 07:42:10,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:10,283 INFO L225 Difference]: With dead ends: 265 [2023-02-18 07:42:10,289 INFO L226 Difference]: Without dead ends: 139 [2023-02-18 07:42:10,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:10,298 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 83 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:10,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 382 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:10,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-02-18 07:42:10,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 129. [2023-02-18 07:42:10,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 107 states have (on average 1.5327102803738317) internal successors, (164), 122 states have internal predecessors, (164), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 172 transitions. [2023-02-18 07:42:10,390 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 172 transitions. Word has length 9 [2023-02-18 07:42:10,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:10,391 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 172 transitions. [2023-02-18 07:42:10,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:42:10,391 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 172 transitions. [2023-02-18 07:42:10,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 07:42:10,392 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:10,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:10,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 07:42:10,393 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:10,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:10,394 INFO L85 PathProgramCache]: Analyzing trace with hash 336718349, now seen corresponding path program 1 times [2023-02-18 07:42:10,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:10,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593217616] [2023-02-18 07:42:10,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:10,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:10,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:10,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:10,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593217616] [2023-02-18 07:42:10,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593217616] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:10,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:10,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:42:10,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693619247] [2023-02-18 07:42:10,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:10,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:42:10,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:10,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:42:10,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:10,521 INFO L87 Difference]: Start difference. First operand 129 states and 172 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2023-02-18 07:42:10,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:10,695 INFO L93 Difference]: Finished difference Result 283 states and 378 transitions. [2023-02-18 07:42:10,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 07:42:10,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 14 [2023-02-18 07:42:10,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:10,697 INFO L225 Difference]: With dead ends: 283 [2023-02-18 07:42:10,698 INFO L226 Difference]: Without dead ends: 157 [2023-02-18 07:42:10,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:42:10,700 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 146 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:10,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 313 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:10,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-18 07:42:10,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 138. [2023-02-18 07:42:10,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 116 states have (on average 1.5172413793103448) internal successors, (176), 131 states have internal predecessors, (176), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:10,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 184 transitions. [2023-02-18 07:42:10,729 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 184 transitions. Word has length 14 [2023-02-18 07:42:10,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:10,729 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 184 transitions. [2023-02-18 07:42:10,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2023-02-18 07:42:10,730 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 184 transitions. [2023-02-18 07:42:10,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-18 07:42:10,730 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:10,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:10,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 07:42:10,731 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:10,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:10,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1848334339, now seen corresponding path program 1 times [2023-02-18 07:42:10,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:10,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615825692] [2023-02-18 07:42:10,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:10,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:10,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:10,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:10,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615825692] [2023-02-18 07:42:10,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615825692] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:10,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:10,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:42:10,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282936320] [2023-02-18 07:42:10,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:10,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:42:10,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:10,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:42:10,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:10,807 INFO L87 Difference]: Start difference. First operand 138 states and 184 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2023-02-18 07:42:10,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:10,919 INFO L93 Difference]: Finished difference Result 165 states and 213 transitions. [2023-02-18 07:42:10,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 07:42:10,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 15 [2023-02-18 07:42:10,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:10,922 INFO L225 Difference]: With dead ends: 165 [2023-02-18 07:42:10,922 INFO L226 Difference]: Without dead ends: 163 [2023-02-18 07:42:10,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:42:10,924 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 112 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:10,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 403 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:10,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-02-18 07:42:10,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 138. [2023-02-18 07:42:10,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 116 states have (on average 1.5) internal successors, (174), 131 states have internal predecessors, (174), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:10,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 182 transitions. [2023-02-18 07:42:10,940 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 182 transitions. Word has length 15 [2023-02-18 07:42:10,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:10,940 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 182 transitions. [2023-02-18 07:42:10,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2023-02-18 07:42:10,941 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 182 transitions. [2023-02-18 07:42:10,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 07:42:10,942 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:10,942 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:10,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 07:42:10,942 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:10,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:10,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1471974372, now seen corresponding path program 1 times [2023-02-18 07:42:10,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:10,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632353252] [2023-02-18 07:42:10,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:10,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:10,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-18 07:42:10,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:10,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632353252] [2023-02-18 07:42:10,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632353252] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:10,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:10,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 07:42:10,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041029159] [2023-02-18 07:42:10,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:10,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 07:42:10,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:10,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 07:42:10,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 07:42:10,975 INFO L87 Difference]: Start difference. First operand 138 states and 182 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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) [2023-02-18 07:42:11,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:11,005 INFO L93 Difference]: Finished difference Result 146 states and 192 transitions. [2023-02-18 07:42:11,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 07:42:11,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 16 [2023-02-18 07:42:11,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:11,007 INFO L225 Difference]: With dead ends: 146 [2023-02-18 07:42:11,008 INFO L226 Difference]: Without dead ends: 145 [2023-02-18 07:42:11,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 07:42:11,018 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 4 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:11,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 212 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:42:11,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-18 07:42:11,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 135. [2023-02-18 07:42:11,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 114 states have (on average 1.4912280701754386) internal successors, (170), 128 states have internal predecessors, (170), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:11,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 178 transitions. [2023-02-18 07:42:11,048 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 178 transitions. Word has length 16 [2023-02-18 07:42:11,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:11,048 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 178 transitions. [2023-02-18 07:42:11,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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) [2023-02-18 07:42:11,049 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 178 transitions. [2023-02-18 07:42:11,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-18 07:42:11,053 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:11,053 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:11,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-18 07:42:11,054 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:11,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:11,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1615596652, now seen corresponding path program 1 times [2023-02-18 07:42:11,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:11,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666496008] [2023-02-18 07:42:11,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:11,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:11,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:11,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:11,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666496008] [2023-02-18 07:42:11,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666496008] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:11,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446799152] [2023-02-18 07:42:11,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:11,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:11,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:11,173 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:11,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 07:42:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:11,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 07:42:11,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:11,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:11,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:42:11,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446799152] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:11,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:42:11,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-02-18 07:42:11,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637887567] [2023-02-18 07:42:11,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:11,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:42:11,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:11,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:42:11,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:42:11,275 INFO L87 Difference]: Start difference. First operand 135 states and 178 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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) [2023-02-18 07:42:11,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:11,324 INFO L93 Difference]: Finished difference Result 164 states and 219 transitions. [2023-02-18 07:42:11,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:42:11,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 17 [2023-02-18 07:42:11,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:11,326 INFO L225 Difference]: With dead ends: 164 [2023-02-18 07:42:11,326 INFO L226 Difference]: Without dead ends: 163 [2023-02-18 07:42:11,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:42:11,328 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 16 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:11,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 335 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:42:11,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-02-18 07:42:11,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 137. [2023-02-18 07:42:11,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 130 states have internal predecessors, (173), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:11,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 181 transitions. [2023-02-18 07:42:11,338 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 181 transitions. Word has length 17 [2023-02-18 07:42:11,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:11,339 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 181 transitions. [2023-02-18 07:42:11,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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) [2023-02-18 07:42:11,339 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 181 transitions. [2023-02-18 07:42:11,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 07:42:11,340 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:11,340 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:11,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:11,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:11,546 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:11,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:11,550 INFO L85 PathProgramCache]: Analyzing trace with hash 946405765, now seen corresponding path program 1 times [2023-02-18 07:42:11,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:11,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159660458] [2023-02-18 07:42:11,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:11,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:11,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 07:42:11,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:11,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159660458] [2023-02-18 07:42:11,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159660458] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:11,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:11,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 07:42:11,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143754887] [2023-02-18 07:42:11,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:11,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:42:11,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:11,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:42:11,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:42:11,609 INFO L87 Difference]: Start difference. First operand 137 states and 181 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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) [2023-02-18 07:42:11,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:11,654 INFO L93 Difference]: Finished difference Result 170 states and 227 transitions. [2023-02-18 07:42:11,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:42:11,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 19 [2023-02-18 07:42:11,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:11,657 INFO L225 Difference]: With dead ends: 170 [2023-02-18 07:42:11,657 INFO L226 Difference]: Without dead ends: 168 [2023-02-18 07:42:11,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:42:11,658 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 18 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:11,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 319 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:42:11,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-02-18 07:42:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 139. [2023-02-18 07:42:11,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.4705882352941178) internal successors, (175), 132 states have internal predecessors, (175), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:11,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 183 transitions. [2023-02-18 07:42:11,681 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 183 transitions. Word has length 19 [2023-02-18 07:42:11,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:11,681 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 183 transitions. [2023-02-18 07:42:11,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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) [2023-02-18 07:42:11,681 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 183 transitions. [2023-02-18 07:42:11,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 07:42:11,685 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:11,686 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:11,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-18 07:42:11,686 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:11,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:11,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1019740832, now seen corresponding path program 1 times [2023-02-18 07:42:11,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:11,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340570233] [2023-02-18 07:42:11,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:11,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:11,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:11,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 07:42:11,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:11,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340570233] [2023-02-18 07:42:11,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340570233] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:11,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:11,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:42:11,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701389514] [2023-02-18 07:42:11,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:11,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:42:11,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:11,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:42:11,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:11,778 INFO L87 Difference]: Start difference. First operand 139 states and 183 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:42:11,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:11,846 INFO L93 Difference]: Finished difference Result 202 states and 269 transitions. [2023-02-18 07:42:11,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 07:42:11,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-18 07:42:11,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:11,850 INFO L225 Difference]: With dead ends: 202 [2023-02-18 07:42:11,850 INFO L226 Difference]: Without dead ends: 200 [2023-02-18 07:42:11,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:42:11,852 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 142 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:11,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 313 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:11,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-02-18 07:42:11,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 170. [2023-02-18 07:42:11,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 149 states have (on average 1.476510067114094) internal successors, (220), 162 states have internal predecessors, (220), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:11,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 228 transitions. [2023-02-18 07:42:11,863 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 228 transitions. Word has length 24 [2023-02-18 07:42:11,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:11,864 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 228 transitions. [2023-02-18 07:42:11,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:42:11,864 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 228 transitions. [2023-02-18 07:42:11,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 07:42:11,865 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:11,865 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:11,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-18 07:42:11,866 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:11,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:11,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1048368188, now seen corresponding path program 1 times [2023-02-18 07:42:11,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:11,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230609507] [2023-02-18 07:42:11,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:11,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:11,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:11,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:11,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 07:42:11,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:11,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230609507] [2023-02-18 07:42:11,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230609507] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:11,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:11,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:42:11,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689936359] [2023-02-18 07:42:11,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:11,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:42:11,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:11,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:42:11,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:11,912 INFO L87 Difference]: Start difference. First operand 170 states and 228 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:42:11,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:11,991 INFO L93 Difference]: Finished difference Result 194 states and 257 transitions. [2023-02-18 07:42:11,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 07:42:11,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-18 07:42:11,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:11,993 INFO L225 Difference]: With dead ends: 194 [2023-02-18 07:42:11,993 INFO L226 Difference]: Without dead ends: 192 [2023-02-18 07:42:11,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:42:11,994 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 143 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:11,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 313 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:11,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-02-18 07:42:12,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 163. [2023-02-18 07:42:12,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 142 states have (on average 1.4647887323943662) internal successors, (208), 155 states have internal predecessors, (208), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:12,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 216 transitions. [2023-02-18 07:42:12,006 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 216 transitions. Word has length 24 [2023-02-18 07:42:12,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:12,007 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 216 transitions. [2023-02-18 07:42:12,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:42:12,008 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 216 transitions. [2023-02-18 07:42:12,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-18 07:42:12,008 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:12,009 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:12,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-18 07:42:12,009 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:12,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:12,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1639510623, now seen corresponding path program 1 times [2023-02-18 07:42:12,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:12,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256425103] [2023-02-18 07:42:12,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:12,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:12,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:12,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:12,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-18 07:42:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:12,080 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-18 07:42:12,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:12,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256425103] [2023-02-18 07:42:12,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256425103] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:12,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:12,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:42:12,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308995265] [2023-02-18 07:42:12,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:12,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:42:12,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:12,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:42:12,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:12,082 INFO L87 Difference]: Start difference. First operand 163 states and 216 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:42:12,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:12,143 INFO L93 Difference]: Finished difference Result 187 states and 248 transitions. [2023-02-18 07:42:12,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 07:42:12,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2023-02-18 07:42:12,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:12,144 INFO L225 Difference]: With dead ends: 187 [2023-02-18 07:42:12,144 INFO L226 Difference]: Without dead ends: 185 [2023-02-18 07:42:12,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:42:12,145 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 140 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:12,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 306 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:42:12,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-02-18 07:42:12,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 157. [2023-02-18 07:42:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 138 states have (on average 1.4420289855072463) internal successors, (199), 149 states have internal predecessors, (199), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:12,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 207 transitions. [2023-02-18 07:42:12,152 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 207 transitions. Word has length 31 [2023-02-18 07:42:12,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:12,152 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 207 transitions. [2023-02-18 07:42:12,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:42:12,153 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 207 transitions. [2023-02-18 07:42:12,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-18 07:42:12,153 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:12,153 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:12,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-18 07:42:12,154 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:12,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:12,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1668137979, now seen corresponding path program 1 times [2023-02-18 07:42:12,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:12,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402368793] [2023-02-18 07:42:12,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:12,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:12,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:12,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:12,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-18 07:42:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:12,203 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-18 07:42:12,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:12,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402368793] [2023-02-18 07:42:12,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402368793] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:12,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:12,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:42:12,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092190423] [2023-02-18 07:42:12,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:12,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:42:12,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:12,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:42:12,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:12,206 INFO L87 Difference]: Start difference. First operand 157 states and 207 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:42:12,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:12,265 INFO L93 Difference]: Finished difference Result 179 states and 236 transitions. [2023-02-18 07:42:12,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 07:42:12,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2023-02-18 07:42:12,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:12,267 INFO L225 Difference]: With dead ends: 179 [2023-02-18 07:42:12,267 INFO L226 Difference]: Without dead ends: 177 [2023-02-18 07:42:12,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:42:12,268 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 141 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:12,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 304 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:42:12,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-18 07:42:12,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 148. [2023-02-18 07:42:12,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 131 states have (on average 1.4274809160305344) internal successors, (187), 140 states have internal predecessors, (187), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:12,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 195 transitions. [2023-02-18 07:42:12,276 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 195 transitions. Word has length 31 [2023-02-18 07:42:12,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:12,276 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 195 transitions. [2023-02-18 07:42:12,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:42:12,277 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 195 transitions. [2023-02-18 07:42:12,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-18 07:42:12,277 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:12,277 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:12,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-18 07:42:12,278 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:12,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:12,278 INFO L85 PathProgramCache]: Analyzing trace with hash -2013703089, now seen corresponding path program 1 times [2023-02-18 07:42:12,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:12,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988372049] [2023-02-18 07:42:12,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:12,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:12,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:12,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:12,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-18 07:42:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:12,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 07:42:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:12,371 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 07:42:12,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:12,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988372049] [2023-02-18 07:42:12,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988372049] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:12,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549466292] [2023-02-18 07:42:12,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:12,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:12,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:12,378 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:12,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 07:42:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:12,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-18 07:42:12,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:12,501 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 07:42:12,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:12,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549466292] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:12,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:12,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10, 8] total 18 [2023-02-18 07:42:12,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217798049] [2023-02-18 07:42:12,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:12,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 07:42:12,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:12,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 07:42:12,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2023-02-18 07:42:12,611 INFO L87 Difference]: Start difference. First operand 148 states and 195 transitions. Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-18 07:42:13,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:13,013 INFO L93 Difference]: Finished difference Result 499 states and 641 transitions. [2023-02-18 07:42:13,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-18 07:42:13,014 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 37 [2023-02-18 07:42:13,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:13,016 INFO L225 Difference]: With dead ends: 499 [2023-02-18 07:42:13,016 INFO L226 Difference]: Without dead ends: 311 [2023-02-18 07:42:13,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2023-02-18 07:42:13,018 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 215 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:13,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1270 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 07:42:13,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2023-02-18 07:42:13,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 149. [2023-02-18 07:42:13,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 131 states have (on average 1.381679389312977) internal successors, (181), 140 states have internal predecessors, (181), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 189 transitions. [2023-02-18 07:42:13,029 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 189 transitions. Word has length 37 [2023-02-18 07:42:13,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:13,030 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 189 transitions. [2023-02-18 07:42:13,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-18 07:42:13,030 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 189 transitions. [2023-02-18 07:42:13,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-18 07:42:13,031 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:13,031 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:13,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:13,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-18 07:42:13,238 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:13,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:13,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1912507181, now seen corresponding path program 1 times [2023-02-18 07:42:13,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:13,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249515867] [2023-02-18 07:42:13,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:13,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:13,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:13,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:13,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-18 07:42:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:13,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 07:42:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-18 07:42:13,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:13,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249515867] [2023-02-18 07:42:13,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249515867] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:13,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:13,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 07:42:13,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339232076] [2023-02-18 07:42:13,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:13,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 07:42:13,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:13,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 07:42:13,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-18 07:42:13,329 INFO L87 Difference]: Start difference. First operand 149 states and 189 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:13,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:13,420 INFO L93 Difference]: Finished difference Result 308 states and 371 transitions. [2023-02-18 07:42:13,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 07:42:13,420 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 54 [2023-02-18 07:42:13,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:13,423 INFO L225 Difference]: With dead ends: 308 [2023-02-18 07:42:13,423 INFO L226 Difference]: Without dead ends: 250 [2023-02-18 07:42:13,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-18 07:42:13,424 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 157 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:13,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 678 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:13,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-02-18 07:42:13,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 149. [2023-02-18 07:42:13,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 131 states have (on average 1.366412213740458) internal successors, (179), 140 states have internal predecessors, (179), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:13,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 187 transitions. [2023-02-18 07:42:13,436 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 187 transitions. Word has length 54 [2023-02-18 07:42:13,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:13,436 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 187 transitions. [2023-02-18 07:42:13,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:13,436 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 187 transitions. [2023-02-18 07:42:13,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-18 07:42:13,437 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:13,438 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:13,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-18 07:42:13,438 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:13,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:13,439 INFO L85 PathProgramCache]: Analyzing trace with hash 2123327684, now seen corresponding path program 2 times [2023-02-18 07:42:13,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:13,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329560926] [2023-02-18 07:42:13,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:13,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:13,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:13,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:13,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-18 07:42:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:13,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 07:42:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:13,559 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-18 07:42:13,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:13,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329560926] [2023-02-18 07:42:13,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329560926] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:13,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:13,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 07:42:13,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108654965] [2023-02-18 07:42:13,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:13,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 07:42:13,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:13,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 07:42:13,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-18 07:42:13,561 INFO L87 Difference]: Start difference. First operand 149 states and 187 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:13,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:13,701 INFO L93 Difference]: Finished difference Result 443 states and 529 transitions. [2023-02-18 07:42:13,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 07:42:13,702 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 58 [2023-02-18 07:42:13,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:13,704 INFO L225 Difference]: With dead ends: 443 [2023-02-18 07:42:13,704 INFO L226 Difference]: Without dead ends: 400 [2023-02-18 07:42:13,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-02-18 07:42:13,705 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 470 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:13,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 689 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2023-02-18 07:42:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 174. [2023-02-18 07:42:13,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 155 states have (on average 1.367741935483871) internal successors, (212), 164 states have internal predecessors, (212), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-18 07:42:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 221 transitions. [2023-02-18 07:42:13,715 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 221 transitions. Word has length 58 [2023-02-18 07:42:13,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:13,715 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 221 transitions. [2023-02-18 07:42:13,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:13,715 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 221 transitions. [2023-02-18 07:42:13,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-18 07:42:13,716 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:13,716 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:13,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-18 07:42:13,716 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:13,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:13,717 INFO L85 PathProgramCache]: Analyzing trace with hash 2123329606, now seen corresponding path program 1 times [2023-02-18 07:42:13,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:13,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420411543] [2023-02-18 07:42:13,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:13,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:13,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:13,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:13,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-18 07:42:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:13,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 07:42:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:13,811 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-18 07:42:13,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:13,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420411543] [2023-02-18 07:42:13,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420411543] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:13,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527503336] [2023-02-18 07:42:13,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:13,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:13,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:13,814 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:13,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 07:42:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:13,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-18 07:42:13,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:13,945 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-18 07:42:13,945 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:42:13,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527503336] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:13,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:42:13,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2023-02-18 07:42:13,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409579318] [2023-02-18 07:42:13,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:13,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 07:42:13,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:13,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 07:42:13,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-02-18 07:42:13,947 INFO L87 Difference]: Start difference. First operand 174 states and 221 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:42:14,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:14,066 INFO L93 Difference]: Finished difference Result 349 states and 437 transitions. [2023-02-18 07:42:14,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 07:42:14,066 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2023-02-18 07:42:14,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:14,068 INFO L225 Difference]: With dead ends: 349 [2023-02-18 07:42:14,068 INFO L226 Difference]: Without dead ends: 281 [2023-02-18 07:42:14,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-02-18 07:42:14,069 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 213 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:14,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 646 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:14,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-02-18 07:42:14,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 198. [2023-02-18 07:42:14,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 177 states have (on average 1.3333333333333333) internal successors, (236), 185 states have internal predecessors, (236), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-18 07:42:14,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 249 transitions. [2023-02-18 07:42:14,079 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 249 transitions. Word has length 58 [2023-02-18 07:42:14,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:14,079 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 249 transitions. [2023-02-18 07:42:14,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:42:14,079 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2023-02-18 07:42:14,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-18 07:42:14,080 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:14,080 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:14,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:14,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:14,286 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:14,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:14,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1746371489, now seen corresponding path program 1 times [2023-02-18 07:42:14,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:14,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072032325] [2023-02-18 07:42:14,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:14,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:14,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:14,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:14,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-18 07:42:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:14,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-02-18 07:42:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:14,381 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:14,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:14,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072032325] [2023-02-18 07:42:14,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072032325] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:14,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794078375] [2023-02-18 07:42:14,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:14,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:14,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:14,384 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:14,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 07:42:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:14,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-18 07:42:14,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-18 07:42:14,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:14,545 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-02-18 07:42:14,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794078375] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:14,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:14,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 14 [2023-02-18 07:42:14,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994741381] [2023-02-18 07:42:14,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:14,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 07:42:14,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:14,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 07:42:14,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-18 07:42:14,548 INFO L87 Difference]: Start difference. First operand 198 states and 249 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 12 states have internal predecessors, (69), 4 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-18 07:42:14,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:14,888 INFO L93 Difference]: Finished difference Result 425 states and 536 transitions. [2023-02-18 07:42:14,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 07:42:14,889 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 12 states have internal predecessors, (69), 4 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 63 [2023-02-18 07:42:14,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:14,891 INFO L225 Difference]: With dead ends: 425 [2023-02-18 07:42:14,891 INFO L226 Difference]: Without dead ends: 258 [2023-02-18 07:42:14,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2023-02-18 07:42:14,893 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 296 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:14,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 618 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 07:42:14,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-02-18 07:42:14,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 189. [2023-02-18 07:42:14,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 168 states have (on average 1.3095238095238095) internal successors, (220), 177 states have internal predecessors, (220), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-18 07:42:14,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 233 transitions. [2023-02-18 07:42:14,912 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 233 transitions. Word has length 63 [2023-02-18 07:42:14,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:14,913 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 233 transitions. [2023-02-18 07:42:14,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 12 states have internal predecessors, (69), 4 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-18 07:42:14,913 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 233 transitions. [2023-02-18 07:42:14,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-18 07:42:14,913 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:14,914 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:14,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:15,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-18 07:42:15,120 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:15,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:15,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1713333159, now seen corresponding path program 1 times [2023-02-18 07:42:15,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:15,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080316915] [2023-02-18 07:42:15,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:15,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:15,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:15,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:15,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-18 07:42:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:15,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-02-18 07:42:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:15,198 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:15,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:15,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080316915] [2023-02-18 07:42:15,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080316915] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:15,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844473758] [2023-02-18 07:42:15,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:15,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:15,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:15,201 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:15,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 07:42:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:15,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 07:42:15,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:15,309 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-18 07:42:15,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:15,361 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:15,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844473758] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:15,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:15,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-02-18 07:42:15,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320399040] [2023-02-18 07:42:15,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:15,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 07:42:15,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:15,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 07:42:15,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2023-02-18 07:42:15,363 INFO L87 Difference]: Start difference. First operand 189 states and 233 transitions. Second operand has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-18 07:42:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:15,587 INFO L93 Difference]: Finished difference Result 678 states and 867 transitions. [2023-02-18 07:42:15,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 07:42:15,588 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 66 [2023-02-18 07:42:15,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:15,590 INFO L225 Difference]: With dead ends: 678 [2023-02-18 07:42:15,590 INFO L226 Difference]: Without dead ends: 517 [2023-02-18 07:42:15,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=232, Unknown=0, NotChecked=0, Total=380 [2023-02-18 07:42:15,591 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 211 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:15,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 631 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:15,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2023-02-18 07:42:15,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 216. [2023-02-18 07:42:15,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 195 states have (on average 1.3025641025641026) internal successors, (254), 204 states have internal predecessors, (254), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-18 07:42:15,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 267 transitions. [2023-02-18 07:42:15,614 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 267 transitions. Word has length 66 [2023-02-18 07:42:15,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:15,614 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 267 transitions. [2023-02-18 07:42:15,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-18 07:42:15,614 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 267 transitions. [2023-02-18 07:42:15,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-18 07:42:15,615 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:15,615 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:15,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:15,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-18 07:42:15,821 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:15,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:15,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1090633703, now seen corresponding path program 1 times [2023-02-18 07:42:15,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:15,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706243431] [2023-02-18 07:42:15,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:15,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:15,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:15,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:15,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-18 07:42:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:15,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-02-18 07:42:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:15,975 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-18 07:42:15,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:15,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706243431] [2023-02-18 07:42:15,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706243431] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:15,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:15,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-18 07:42:15,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163778148] [2023-02-18 07:42:15,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:15,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 07:42:15,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:15,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 07:42:15,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-18 07:42:15,977 INFO L87 Difference]: Start difference. First operand 216 states and 267 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:16,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:16,133 INFO L93 Difference]: Finished difference Result 524 states and 626 transitions. [2023-02-18 07:42:16,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 07:42:16,133 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 70 [2023-02-18 07:42:16,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:16,135 INFO L225 Difference]: With dead ends: 524 [2023-02-18 07:42:16,135 INFO L226 Difference]: Without dead ends: 481 [2023-02-18 07:42:16,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-18 07:42:16,136 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 486 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:16,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 727 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2023-02-18 07:42:16,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 220. [2023-02-18 07:42:16,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 198 states have (on average 1.297979797979798) internal successors, (257), 208 states have internal predecessors, (257), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 07:42:16,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 272 transitions. [2023-02-18 07:42:16,151 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 272 transitions. Word has length 70 [2023-02-18 07:42:16,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:16,151 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 272 transitions. [2023-02-18 07:42:16,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:16,151 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 272 transitions. [2023-02-18 07:42:16,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-18 07:42:16,152 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:16,152 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:16,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-18 07:42:16,152 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:16,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:16,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1090635625, now seen corresponding path program 1 times [2023-02-18 07:42:16,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:16,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509589966] [2023-02-18 07:42:16,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:16,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:16,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:16,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:16,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-18 07:42:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:16,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-02-18 07:42:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:16,262 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:16,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:16,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509589966] [2023-02-18 07:42:16,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509589966] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:16,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817201155] [2023-02-18 07:42:16,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:16,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:16,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:16,264 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:16,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 07:42:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:16,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-18 07:42:16,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-02-18 07:42:16,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:16,480 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-02-18 07:42:16,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817201155] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:16,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:16,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 17 [2023-02-18 07:42:16,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162799536] [2023-02-18 07:42:16,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:16,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 07:42:16,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:16,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 07:42:16,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2023-02-18 07:42:16,483 INFO L87 Difference]: Start difference. First operand 220 states and 272 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 15 states have internal predecessors, (81), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-18 07:42:16,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:16,934 INFO L93 Difference]: Finished difference Result 535 states and 670 transitions. [2023-02-18 07:42:16,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-18 07:42:16,935 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 15 states have internal predecessors, (81), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 70 [2023-02-18 07:42:16,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:16,937 INFO L225 Difference]: With dead ends: 535 [2023-02-18 07:42:16,937 INFO L226 Difference]: Without dead ends: 367 [2023-02-18 07:42:16,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 134 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2023-02-18 07:42:16,938 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 147 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:16,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1063 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 07:42:16,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2023-02-18 07:42:16,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 238. [2023-02-18 07:42:16,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 216 states have (on average 1.2777777777777777) internal successors, (276), 224 states have internal predecessors, (276), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 07:42:16,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 291 transitions. [2023-02-18 07:42:16,959 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 291 transitions. Word has length 70 [2023-02-18 07:42:16,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:16,960 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 291 transitions. [2023-02-18 07:42:16,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 15 states have internal predecessors, (81), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-18 07:42:16,960 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 291 transitions. [2023-02-18 07:42:16,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-02-18 07:42:16,961 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:16,961 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:16,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:17,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-18 07:42:17,167 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:17,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:17,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1449957273, now seen corresponding path program 2 times [2023-02-18 07:42:17,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:17,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92649689] [2023-02-18 07:42:17,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:17,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:17,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:17,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:17,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-18 07:42:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:17,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-02-18 07:42:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:17,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:17,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92649689] [2023-02-18 07:42:17,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92649689] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:17,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034563086] [2023-02-18 07:42:17,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 07:42:17,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:17,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:17,293 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:17,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 07:42:17,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-18 07:42:17,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:42:17,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 07:42:17,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-02-18 07:42:17,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:42:17,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034563086] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:17,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:42:17,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2023-02-18 07:42:17,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108423535] [2023-02-18 07:42:17,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:17,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 07:42:17,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:17,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 07:42:17,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-02-18 07:42:17,404 INFO L87 Difference]: Start difference. First operand 238 states and 291 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:17,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:17,514 INFO L93 Difference]: Finished difference Result 379 states and 455 transitions. [2023-02-18 07:42:17,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 07:42:17,514 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2023-02-18 07:42:17,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:17,516 INFO L225 Difference]: With dead ends: 379 [2023-02-18 07:42:17,516 INFO L226 Difference]: Without dead ends: 336 [2023-02-18 07:42:17,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-02-18 07:42:17,517 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 199 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:17,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 887 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:17,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2023-02-18 07:42:17,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 249. [2023-02-18 07:42:17,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 227 states have (on average 1.2863436123348018) internal successors, (292), 234 states have internal predecessors, (292), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 07:42:17,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 307 transitions. [2023-02-18 07:42:17,533 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 307 transitions. Word has length 75 [2023-02-18 07:42:17,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:17,533 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 307 transitions. [2023-02-18 07:42:17,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:17,533 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 307 transitions. [2023-02-18 07:42:17,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-02-18 07:42:17,534 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:17,534 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:17,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:17,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:17,741 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:17,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:17,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1507213653, now seen corresponding path program 1 times [2023-02-18 07:42:17,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:17,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780628966] [2023-02-18 07:42:17,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:17,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:17,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:17,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:17,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-18 07:42:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:17,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-02-18 07:42:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:17,872 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-02-18 07:42:17,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:17,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780628966] [2023-02-18 07:42:17,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780628966] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:17,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312589798] [2023-02-18 07:42:17,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:17,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:17,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:17,874 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:17,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-18 07:42:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:17,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-18 07:42:17,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:18,020 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-18 07:42:18,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:18,095 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-02-18 07:42:18,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312589798] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:18,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:18,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 21 [2023-02-18 07:42:18,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945602918] [2023-02-18 07:42:18,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:18,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-18 07:42:18,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:18,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-18 07:42:18,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2023-02-18 07:42:18,098 INFO L87 Difference]: Start difference. First operand 249 states and 307 transitions. Second operand has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 18 states have internal predecessors, (80), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-18 07:42:18,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:18,664 INFO L93 Difference]: Finished difference Result 930 states and 1138 transitions. [2023-02-18 07:42:18,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-18 07:42:18,665 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 18 states have internal predecessors, (80), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) Word has length 75 [2023-02-18 07:42:18,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:18,668 INFO L225 Difference]: With dead ends: 930 [2023-02-18 07:42:18,669 INFO L226 Difference]: Without dead ends: 871 [2023-02-18 07:42:18,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=962, Unknown=0, NotChecked=0, Total=1122 [2023-02-18 07:42:18,670 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 487 mSDsluCounter, 3205 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 3473 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:18,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 3473 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 07:42:18,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2023-02-18 07:42:18,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 279. [2023-02-18 07:42:18,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 255 states have (on average 1.2862745098039217) internal successors, (328), 260 states have internal predecessors, (328), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (14), 14 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-18 07:42:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 348 transitions. [2023-02-18 07:42:18,694 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 348 transitions. Word has length 75 [2023-02-18 07:42:18,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:18,694 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 348 transitions. [2023-02-18 07:42:18,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 18 states have internal predecessors, (80), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-18 07:42:18,694 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 348 transitions. [2023-02-18 07:42:18,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-02-18 07:42:18,696 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:18,696 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:18,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:18,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:18,902 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:18,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:18,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1507215575, now seen corresponding path program 1 times [2023-02-18 07:42:18,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:18,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903961225] [2023-02-18 07:42:18,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:18,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:18,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:18,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:19,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-18 07:42:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:19,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-02-18 07:42:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:19,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:19,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903961225] [2023-02-18 07:42:19,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903961225] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:19,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279881917] [2023-02-18 07:42:19,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:19,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:19,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:19,026 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:19,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-18 07:42:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:19,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-18 07:42:19,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:19,239 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-18 07:42:19,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-18 07:42:19,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279881917] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:19,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:19,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 24 [2023-02-18 07:42:19,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641482448] [2023-02-18 07:42:19,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:19,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-18 07:42:19,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:19,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-18 07:42:19,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2023-02-18 07:42:19,546 INFO L87 Difference]: Start difference. First operand 279 states and 348 transitions. Second operand has 24 states, 24 states have (on average 5.041666666666667) internal successors, (121), 22 states have internal predecessors, (121), 6 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-18 07:42:21,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:21,098 INFO L93 Difference]: Finished difference Result 957 states and 1194 transitions. [2023-02-18 07:42:21,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-18 07:42:21,098 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.041666666666667) internal successors, (121), 22 states have internal predecessors, (121), 6 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) Word has length 75 [2023-02-18 07:42:21,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:21,101 INFO L225 Difference]: With dead ends: 957 [2023-02-18 07:42:21,102 INFO L226 Difference]: Without dead ends: 730 [2023-02-18 07:42:21,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 140 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=278, Invalid=1792, Unknown=0, NotChecked=0, Total=2070 [2023-02-18 07:42:21,104 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 692 mSDsluCounter, 2608 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 2864 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:21,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 2864 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-18 07:42:21,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2023-02-18 07:42:21,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 317. [2023-02-18 07:42:21,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 291 states have (on average 1.2920962199312716) internal successors, (376), 294 states have internal predecessors, (376), 7 states have call successors, (7), 4 states have call predecessors, (7), 9 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2023-02-18 07:42:21,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 401 transitions. [2023-02-18 07:42:21,125 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 401 transitions. Word has length 75 [2023-02-18 07:42:21,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:21,126 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 401 transitions. [2023-02-18 07:42:21,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.041666666666667) internal successors, (121), 22 states have internal predecessors, (121), 6 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-18 07:42:21,126 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 401 transitions. [2023-02-18 07:42:21,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-02-18 07:42:21,127 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:21,127 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:21,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:21,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:21,333 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:21,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:21,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2106925069, now seen corresponding path program 1 times [2023-02-18 07:42:21,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:21,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827197212] [2023-02-18 07:42:21,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:21,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:21,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:21,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:21,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-02-18 07:42:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:21,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-02-18 07:42:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:21,395 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-02-18 07:42:21,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:21,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827197212] [2023-02-18 07:42:21,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827197212] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:21,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996032519] [2023-02-18 07:42:21,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:21,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:21,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:21,397 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:21,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-18 07:42:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:21,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 07:42:21,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-02-18 07:42:21,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:42:21,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996032519] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:21,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:42:21,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-02-18 07:42:21,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356865576] [2023-02-18 07:42:21,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:21,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:42:21,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:21,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:42:21,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:42:21,484 INFO L87 Difference]: Start difference. First operand 317 states and 401 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:42:21,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:21,540 INFO L93 Difference]: Finished difference Result 613 states and 789 transitions. [2023-02-18 07:42:21,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:42:21,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 81 [2023-02-18 07:42:21,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:21,542 INFO L225 Difference]: With dead ends: 613 [2023-02-18 07:42:21,542 INFO L226 Difference]: Without dead ends: 353 [2023-02-18 07:42:21,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:42:21,545 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 4 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:21,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 301 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:42:21,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2023-02-18 07:42:21,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 333. [2023-02-18 07:42:21,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 307 states have (on average 1.276872964169381) internal successors, (392), 310 states have internal predecessors, (392), 7 states have call successors, (7), 4 states have call predecessors, (7), 9 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2023-02-18 07:42:21,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 417 transitions. [2023-02-18 07:42:21,567 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 417 transitions. Word has length 81 [2023-02-18 07:42:21,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:21,567 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 417 transitions. [2023-02-18 07:42:21,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:42:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 417 transitions. [2023-02-18 07:42:21,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-02-18 07:42:21,568 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:21,568 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:21,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:21,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-18 07:42:21,775 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:21,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:21,775 INFO L85 PathProgramCache]: Analyzing trace with hash -188212205, now seen corresponding path program 1 times [2023-02-18 07:42:21,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:21,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381085852] [2023-02-18 07:42:21,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:21,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:21,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:21,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:21,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-02-18 07:42:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:21,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-02-18 07:42:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:21,964 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:21,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:21,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381085852] [2023-02-18 07:42:21,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381085852] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:21,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629433466] [2023-02-18 07:42:21,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:21,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:21,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:21,973 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:21,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-18 07:42:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:22,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 07:42:22,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:22,129 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 32 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-18 07:42:22,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:22,367 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:22,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629433466] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:22,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:22,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2023-02-18 07:42:22,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992110954] [2023-02-18 07:42:22,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:22,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-18 07:42:22,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:22,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-18 07:42:22,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2023-02-18 07:42:22,369 INFO L87 Difference]: Start difference. First operand 333 states and 417 transitions. Second operand has 19 states, 19 states have (on average 7.157894736842105) internal successors, (136), 19 states have internal predecessors, (136), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 07:42:22,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:22,938 INFO L93 Difference]: Finished difference Result 867 states and 1104 transitions. [2023-02-18 07:42:22,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 07:42:22,938 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.157894736842105) internal successors, (136), 19 states have internal predecessors, (136), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 82 [2023-02-18 07:42:22,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:22,941 INFO L225 Difference]: With dead ends: 867 [2023-02-18 07:42:22,941 INFO L226 Difference]: Without dead ends: 564 [2023-02-18 07:42:22,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 156 SyntacticMatches, 13 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=280, Invalid=476, Unknown=0, NotChecked=0, Total=756 [2023-02-18 07:42:22,942 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 134 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:22,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1056 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 07:42:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2023-02-18 07:42:22,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 344. [2023-02-18 07:42:22,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 318 states have (on average 1.2610062893081762) internal successors, (401), 321 states have internal predecessors, (401), 7 states have call successors, (7), 4 states have call predecessors, (7), 9 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2023-02-18 07:42:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 426 transitions. [2023-02-18 07:42:22,965 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 426 transitions. Word has length 82 [2023-02-18 07:42:22,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:22,966 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 426 transitions. [2023-02-18 07:42:22,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.157894736842105) internal successors, (136), 19 states have internal predecessors, (136), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 07:42:22,966 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 426 transitions. [2023-02-18 07:42:22,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-02-18 07:42:22,988 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:22,989 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:22,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:23,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-02-18 07:42:23,189 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:23,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:23,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1501155771, now seen corresponding path program 1 times [2023-02-18 07:42:23,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:23,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680297828] [2023-02-18 07:42:23,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:23,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:23,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:23,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:23,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-02-18 07:42:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:23,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-02-18 07:42:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:23,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:23,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680297828] [2023-02-18 07:42:23,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680297828] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:23,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975234706] [2023-02-18 07:42:23,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:23,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:23,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:23,335 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:23,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-18 07:42:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:23,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 07:42:23,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:23,445 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 26 proven. 87 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-18 07:42:23,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:23,558 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:23,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975234706] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:23,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:23,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2023-02-18 07:42:23,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576954788] [2023-02-18 07:42:23,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:23,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-18 07:42:23,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:23,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-18 07:42:23,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2023-02-18 07:42:23,560 INFO L87 Difference]: Start difference. First operand 344 states and 426 transitions. Second operand has 26 states, 26 states have (on average 6.230769230769231) internal successors, (162), 26 states have internal predecessors, (162), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-18 07:42:24,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:24,005 INFO L93 Difference]: Finished difference Result 1359 states and 1760 transitions. [2023-02-18 07:42:24,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-18 07:42:24,009 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.230769230769231) internal successors, (162), 26 states have internal predecessors, (162), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 88 [2023-02-18 07:42:24,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:24,014 INFO L225 Difference]: With dead ends: 1359 [2023-02-18 07:42:24,014 INFO L226 Difference]: Without dead ends: 1086 [2023-02-18 07:42:24,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=488, Invalid=772, Unknown=0, NotChecked=0, Total=1260 [2023-02-18 07:42:24,018 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 670 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:24,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 894 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 07:42:24,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2023-02-18 07:42:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 373. [2023-02-18 07:42:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 347 states have (on average 1.2507204610951008) internal successors, (434), 350 states have internal predecessors, (434), 7 states have call successors, (7), 4 states have call predecessors, (7), 9 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2023-02-18 07:42:24,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 459 transitions. [2023-02-18 07:42:24,051 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 459 transitions. Word has length 88 [2023-02-18 07:42:24,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:24,051 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 459 transitions. [2023-02-18 07:42:24,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.230769230769231) internal successors, (162), 26 states have internal predecessors, (162), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-18 07:42:24,052 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 459 transitions. [2023-02-18 07:42:24,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-02-18 07:42:24,053 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:24,053 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 9, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:24,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:24,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-02-18 07:42:24,259 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:24,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:24,260 INFO L85 PathProgramCache]: Analyzing trace with hash -351302957, now seen corresponding path program 2 times [2023-02-18 07:42:24,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:24,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957860780] [2023-02-18 07:42:24,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:24,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:24,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:24,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:24,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-02-18 07:42:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:24,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-02-18 07:42:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:24,582 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 4 proven. 241 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:24,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:24,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957860780] [2023-02-18 07:42:24,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957860780] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:24,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482574249] [2023-02-18 07:42:24,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 07:42:24,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:24,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:24,585 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:24,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-18 07:42:24,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-18 07:42:24,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:42:24,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 07:42:24,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:24,743 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2023-02-18 07:42:24,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:42:24,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482574249] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:24,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:42:24,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 21 [2023-02-18 07:42:24,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352682100] [2023-02-18 07:42:24,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:24,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 07:42:24,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:24,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 07:42:24,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2023-02-18 07:42:24,745 INFO L87 Difference]: Start difference. First operand 373 states and 459 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:24,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:24,893 INFO L93 Difference]: Finished difference Result 489 states and 587 transitions. [2023-02-18 07:42:24,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 07:42:24,893 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 112 [2023-02-18 07:42:24,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:24,895 INFO L225 Difference]: With dead ends: 489 [2023-02-18 07:42:24,895 INFO L226 Difference]: Without dead ends: 449 [2023-02-18 07:42:24,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2023-02-18 07:42:24,896 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 239 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:24,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 708 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:24,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2023-02-18 07:42:24,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 351. [2023-02-18 07:42:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 325 states have (on average 1.24) internal successors, (403), 330 states have internal predecessors, (403), 7 states have call successors, (7), 4 states have call predecessors, (7), 9 states have return successors, (18), 16 states have call predecessors, (18), 7 states have call successors, (18) [2023-02-18 07:42:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 428 transitions. [2023-02-18 07:42:24,935 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 428 transitions. Word has length 112 [2023-02-18 07:42:24,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:24,936 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 428 transitions. [2023-02-18 07:42:24,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:24,937 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 428 transitions. [2023-02-18 07:42:24,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-02-18 07:42:24,938 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:24,939 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 9, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:24,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:25,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-02-18 07:42:25,145 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:25,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:25,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1908646084, now seen corresponding path program 1 times [2023-02-18 07:42:25,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:25,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017603336] [2023-02-18 07:42:25,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:25,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:25,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:25,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:25,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-02-18 07:42:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:25,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 07:42:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 4 proven. 247 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-18 07:42:25,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:25,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017603336] [2023-02-18 07:42:25,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017603336] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:25,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886034075] [2023-02-18 07:42:25,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:25,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:25,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:25,518 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:25,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-18 07:42:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:25,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-18 07:42:25,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2023-02-18 07:42:25,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:42:25,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886034075] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:25,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:42:25,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 24 [2023-02-18 07:42:25,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751483124] [2023-02-18 07:42:25,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:25,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 07:42:25,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:25,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 07:42:25,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2023-02-18 07:42:25,881 INFO L87 Difference]: Start difference. First operand 351 states and 428 transitions. Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:26,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:26,382 INFO L93 Difference]: Finished difference Result 752 states and 902 transitions. [2023-02-18 07:42:26,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 07:42:26,383 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 115 [2023-02-18 07:42:26,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:26,385 INFO L225 Difference]: With dead ends: 752 [2023-02-18 07:42:26,385 INFO L226 Difference]: Without dead ends: 709 [2023-02-18 07:42:26,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=1117, Unknown=0, NotChecked=0, Total=1260 [2023-02-18 07:42:26,386 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 478 mSDsluCounter, 1711 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1936 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:26,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1936 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 07:42:26,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2023-02-18 07:42:26,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 411. [2023-02-18 07:42:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 384 states have (on average 1.25) internal successors, (480), 386 states have internal predecessors, (480), 7 states have call successors, (7), 4 states have call predecessors, (7), 10 states have return successors, (22), 20 states have call predecessors, (22), 7 states have call successors, (22) [2023-02-18 07:42:26,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 509 transitions. [2023-02-18 07:42:26,413 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 509 transitions. Word has length 115 [2023-02-18 07:42:26,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:26,414 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 509 transitions. [2023-02-18 07:42:26,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:26,414 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 509 transitions. [2023-02-18 07:42:26,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-02-18 07:42:26,415 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:26,416 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 9, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:26,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:26,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:26,629 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:26,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:26,630 INFO L85 PathProgramCache]: Analyzing trace with hash -291366528, now seen corresponding path program 1 times [2023-02-18 07:42:26,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:26,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51252385] [2023-02-18 07:42:26,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:26,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:26,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:26,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:26,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-02-18 07:42:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:26,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-02-18 07:42:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:26,968 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 4 proven. 235 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-18 07:42:26,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:26,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51252385] [2023-02-18 07:42:26,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51252385] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:26,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336877708] [2023-02-18 07:42:26,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:26,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:26,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:26,970 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:26,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-18 07:42:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:27,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-18 07:42:27,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2023-02-18 07:42:27,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:42:27,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336877708] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:27,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:42:27,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2023-02-18 07:42:27,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859679915] [2023-02-18 07:42:27,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:27,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 07:42:27,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:27,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 07:42:27,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2023-02-18 07:42:27,254 INFO L87 Difference]: Start difference. First operand 411 states and 509 transitions. Second operand has 11 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:42:27,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:27,499 INFO L93 Difference]: Finished difference Result 516 states and 628 transitions. [2023-02-18 07:42:27,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 07:42:27,500 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 116 [2023-02-18 07:42:27,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:27,502 INFO L225 Difference]: With dead ends: 516 [2023-02-18 07:42:27,502 INFO L226 Difference]: Without dead ends: 512 [2023-02-18 07:42:27,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2023-02-18 07:42:27,503 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 189 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:27,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 756 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 07:42:27,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2023-02-18 07:42:27,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 444. [2023-02-18 07:42:27,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 417 states have (on average 1.249400479616307) internal successors, (521), 419 states have internal predecessors, (521), 7 states have call successors, (7), 4 states have call predecessors, (7), 10 states have return successors, (22), 20 states have call predecessors, (22), 7 states have call successors, (22) [2023-02-18 07:42:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 550 transitions. [2023-02-18 07:42:27,528 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 550 transitions. Word has length 116 [2023-02-18 07:42:27,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:27,528 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 550 transitions. [2023-02-18 07:42:27,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:42:27,529 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 550 transitions. [2023-02-18 07:42:27,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-02-18 07:42:27,530 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:27,530 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 9, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:27,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:27,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-18 07:42:27,736 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:27,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:27,737 INFO L85 PathProgramCache]: Analyzing trace with hash -442427553, now seen corresponding path program 1 times [2023-02-18 07:42:27,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:27,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918099915] [2023-02-18 07:42:27,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:27,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:27,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:27,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:28,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-02-18 07:42:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:28,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-02-18 07:42:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:28,118 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 4 proven. 235 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-18 07:42:28,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:28,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918099915] [2023-02-18 07:42:28,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918099915] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:28,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499064510] [2023-02-18 07:42:28,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:28,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:28,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:28,119 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:28,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-18 07:42:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:28,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-18 07:42:28,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:28,404 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2023-02-18 07:42:28,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:42:28,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499064510] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:28,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:42:28,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2023-02-18 07:42:28,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967982801] [2023-02-18 07:42:28,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:28,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 07:42:28,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:28,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 07:42:28,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2023-02-18 07:42:28,406 INFO L87 Difference]: Start difference. First operand 444 states and 550 transitions. Second operand has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:42:28,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:28,641 INFO L93 Difference]: Finished difference Result 519 states and 632 transitions. [2023-02-18 07:42:28,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 07:42:28,642 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 117 [2023-02-18 07:42:28,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:28,644 INFO L225 Difference]: With dead ends: 519 [2023-02-18 07:42:28,644 INFO L226 Difference]: Without dead ends: 510 [2023-02-18 07:42:28,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2023-02-18 07:42:28,645 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 172 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:28,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 839 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 07:42:28,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2023-02-18 07:42:28,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 444. [2023-02-18 07:42:28,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 417 states have (on average 1.2422062350119905) internal successors, (518), 419 states have internal predecessors, (518), 7 states have call successors, (7), 4 states have call predecessors, (7), 10 states have return successors, (22), 20 states have call predecessors, (22), 7 states have call successors, (22) [2023-02-18 07:42:28,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 547 transitions. [2023-02-18 07:42:28,669 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 547 transitions. Word has length 117 [2023-02-18 07:42:28,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:28,669 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 547 transitions. [2023-02-18 07:42:28,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:42:28,670 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 547 transitions. [2023-02-18 07:42:28,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-02-18 07:42:28,671 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:28,671 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 9, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:28,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:28,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-02-18 07:42:28,878 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:28,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:28,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1926768750, now seen corresponding path program 1 times [2023-02-18 07:42:28,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:28,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879349187] [2023-02-18 07:42:28,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:28,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:28,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:29,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:29,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-02-18 07:42:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:29,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 07:42:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:29,053 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2023-02-18 07:42:29,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:29,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879349187] [2023-02-18 07:42:29,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879349187] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:29,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775498633] [2023-02-18 07:42:29,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:29,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:29,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:29,055 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:29,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-18 07:42:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:29,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-18 07:42:29,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:29,231 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2023-02-18 07:42:29,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:29,317 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2023-02-18 07:42:29,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775498633] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:29,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:29,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24 [2023-02-18 07:42:29,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673995016] [2023-02-18 07:42:29,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:29,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-18 07:42:29,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:29,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-18 07:42:29,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2023-02-18 07:42:29,319 INFO L87 Difference]: Start difference. First operand 444 states and 547 transitions. Second operand has 24 states, 24 states have (on average 4.208333333333333) internal successors, (101), 21 states have internal predecessors, (101), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-18 07:42:30,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:30,202 INFO L93 Difference]: Finished difference Result 1524 states and 1790 transitions. [2023-02-18 07:42:30,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-02-18 07:42:30,209 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.208333333333333) internal successors, (101), 21 states have internal predecessors, (101), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) Word has length 117 [2023-02-18 07:42:30,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:30,214 INFO L225 Difference]: With dead ends: 1524 [2023-02-18 07:42:30,215 INFO L226 Difference]: Without dead ends: 1492 [2023-02-18 07:42:30,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 226 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=455, Invalid=2625, Unknown=0, NotChecked=0, Total=3080 [2023-02-18 07:42:30,217 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 1388 mSDsluCounter, 3186 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1388 SdHoareTripleChecker+Valid, 3455 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:30,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1388 Valid, 3455 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 07:42:30,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2023-02-18 07:42:30,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 450. [2023-02-18 07:42:30,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 423 states have (on average 1.243498817966903) internal successors, (526), 424 states have internal predecessors, (526), 7 states have call successors, (7), 4 states have call predecessors, (7), 10 states have return successors, (22), 21 states have call predecessors, (22), 7 states have call successors, (22) [2023-02-18 07:42:30,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 555 transitions. [2023-02-18 07:42:30,251 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 555 transitions. Word has length 117 [2023-02-18 07:42:30,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:30,251 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 555 transitions. [2023-02-18 07:42:30,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.208333333333333) internal successors, (101), 21 states have internal predecessors, (101), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-18 07:42:30,252 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 555 transitions. [2023-02-18 07:42:30,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-02-18 07:42:30,254 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:30,254 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 9, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:30,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:30,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-18 07:42:30,464 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:30,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:30,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1926766828, now seen corresponding path program 1 times [2023-02-18 07:42:30,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:30,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119067249] [2023-02-18 07:42:30,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:30,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:30,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:30,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:30,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-02-18 07:42:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:30,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 07:42:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:30,792 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 4 proven. 241 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:30,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:30,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119067249] [2023-02-18 07:42:30,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119067249] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:30,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464098926] [2023-02-18 07:42:30,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:30,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:30,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:30,794 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:30,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-18 07:42:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:30,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-18 07:42:30,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:31,177 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2023-02-18 07:42:31,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:31,634 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2023-02-18 07:42:31,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464098926] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:31,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:31,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 33 [2023-02-18 07:42:31,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150237314] [2023-02-18 07:42:31,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:31,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-18 07:42:31,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:31,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-18 07:42:31,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=962, Unknown=0, NotChecked=0, Total=1056 [2023-02-18 07:42:31,637 INFO L87 Difference]: Start difference. First operand 450 states and 555 transitions. Second operand has 33 states, 33 states have (on average 5.363636363636363) internal successors, (177), 31 states have internal predecessors, (177), 6 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-18 07:42:34,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:34,162 INFO L93 Difference]: Finished difference Result 1418 states and 1729 transitions. [2023-02-18 07:42:34,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-02-18 07:42:34,163 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 5.363636363636363) internal successors, (177), 31 states have internal predecessors, (177), 6 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) Word has length 117 [2023-02-18 07:42:34,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:34,166 INFO L225 Difference]: With dead ends: 1418 [2023-02-18 07:42:34,166 INFO L226 Difference]: Without dead ends: 1060 [2023-02-18 07:42:34,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 222 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=529, Invalid=3631, Unknown=0, NotChecked=0, Total=4160 [2023-02-18 07:42:34,168 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 895 mSDsluCounter, 4486 mSDsCounter, 0 mSdLazyCounter, 2327 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 4765 SdHoareTripleChecker+Invalid, 2370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:34,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 4765 Invalid, 2370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2327 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-02-18 07:42:34,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2023-02-18 07:42:34,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 464. [2023-02-18 07:42:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 437 states have (on average 1.2471395881006866) internal successors, (545), 437 states have internal predecessors, (545), 7 states have call successors, (7), 4 states have call predecessors, (7), 10 states have return successors, (22), 22 states have call predecessors, (22), 7 states have call successors, (22) [2023-02-18 07:42:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 574 transitions. [2023-02-18 07:42:34,200 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 574 transitions. Word has length 117 [2023-02-18 07:42:34,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:34,200 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 574 transitions. [2023-02-18 07:42:34,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.363636363636363) internal successors, (177), 31 states have internal predecessors, (177), 6 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-18 07:42:34,200 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 574 transitions. [2023-02-18 07:42:34,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-02-18 07:42:34,202 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:34,202 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:34,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-02-18 07:42:34,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:34,408 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:34,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:34,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1210699596, now seen corresponding path program 1 times [2023-02-18 07:42:34,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:34,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61224000] [2023-02-18 07:42:34,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:34,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:34,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:34,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:34,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-02-18 07:42:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:34,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-02-18 07:42:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:34,787 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 4 proven. 297 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-18 07:42:34,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:34,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61224000] [2023-02-18 07:42:34,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61224000] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:34,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106875687] [2023-02-18 07:42:34,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:34,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:34,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:34,790 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:34,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-18 07:42:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:34,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-18 07:42:34,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:35,196 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 38 proven. 275 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-18 07:42:35,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:35,915 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 4 proven. 297 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-18 07:42:35,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106875687] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:35,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:35,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 40 [2023-02-18 07:42:35,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506348373] [2023-02-18 07:42:35,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:35,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-02-18 07:42:35,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:35,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-02-18 07:42:35,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=1114, Unknown=0, NotChecked=0, Total=1560 [2023-02-18 07:42:35,918 INFO L87 Difference]: Start difference. First operand 464 states and 574 transitions. Second operand has 40 states, 40 states have (on average 6.025) internal successors, (241), 40 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 07:42:39,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 07:42:47,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:47,068 INFO L93 Difference]: Finished difference Result 1339 states and 1695 transitions. [2023-02-18 07:42:47,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-02-18 07:42:47,077 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 6.025) internal successors, (241), 40 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 122 [2023-02-18 07:42:47,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:47,081 INFO L225 Difference]: With dead ends: 1339 [2023-02-18 07:42:47,081 INFO L226 Difference]: Without dead ends: 945 [2023-02-18 07:42:47,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 235 SyntacticMatches, 13 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1389, Invalid=2642, Unknown=1, NotChecked=0, Total=4032 [2023-02-18 07:42:47,088 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 527 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 1853 mSolverCounterSat, 47 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 1901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1853 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:47,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1788 Invalid, 1901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1853 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2023-02-18 07:42:47,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2023-02-18 07:42:47,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 505. [2023-02-18 07:42:47,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 478 states have (on average 1.2322175732217573) internal successors, (589), 478 states have internal predecessors, (589), 7 states have call successors, (7), 4 states have call predecessors, (7), 10 states have return successors, (22), 22 states have call predecessors, (22), 7 states have call successors, (22) [2023-02-18 07:42:47,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 618 transitions. [2023-02-18 07:42:47,132 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 618 transitions. Word has length 122 [2023-02-18 07:42:47,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:47,132 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 618 transitions. [2023-02-18 07:42:47,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 6.025) internal successors, (241), 40 states have internal predecessors, (241), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 07:42:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 618 transitions. [2023-02-18 07:42:47,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-02-18 07:42:47,134 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:47,135 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:47,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:47,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:47,346 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:47,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:47,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1780147732, now seen corresponding path program 1 times [2023-02-18 07:42:47,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:47,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894535191] [2023-02-18 07:42:47,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:47,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:47,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:47,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:47,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 07:42:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:47,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-18 07:42:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:47,759 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 4 proven. 493 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-18 07:42:47,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:47,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894535191] [2023-02-18 07:42:47,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894535191] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:47,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451286127] [2023-02-18 07:42:47,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:47,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:47,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:47,765 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:47,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-18 07:42:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:47,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 07:42:47,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:47,988 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 26 proven. 483 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-18 07:42:47,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:48,390 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 4 proven. 493 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-18 07:42:48,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451286127] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:48,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:48,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2023-02-18 07:42:48,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941034218] [2023-02-18 07:42:48,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:48,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-18 07:42:48,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:48,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-18 07:42:48,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2023-02-18 07:42:48,393 INFO L87 Difference]: Start difference. First operand 505 states and 618 transitions. Second operand has 50 states, 50 states have (on average 5.64) internal successors, (282), 50 states have internal predecessors, (282), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-18 07:42:49,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:49,543 INFO L93 Difference]: Finished difference Result 2343 states and 3040 transitions. [2023-02-18 07:42:49,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-02-18 07:42:49,544 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.64) internal successors, (282), 50 states have internal predecessors, (282), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 133 [2023-02-18 07:42:49,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:49,552 INFO L225 Difference]: With dead ends: 2343 [2023-02-18 07:42:49,553 INFO L226 Difference]: Without dead ends: 1979 [2023-02-18 07:42:49,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1744, Invalid=2812, Unknown=0, NotChecked=0, Total=4556 [2023-02-18 07:42:49,556 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 1275 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:49,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1275 Valid, 1176 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 07:42:49,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2023-02-18 07:42:49,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 544. [2023-02-18 07:42:49,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 517 states have (on average 1.2147001934235977) internal successors, (628), 517 states have internal predecessors, (628), 7 states have call successors, (7), 4 states have call predecessors, (7), 10 states have return successors, (22), 22 states have call predecessors, (22), 7 states have call successors, (22) [2023-02-18 07:42:49,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 657 transitions. [2023-02-18 07:42:49,621 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 657 transitions. Word has length 133 [2023-02-18 07:42:49,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:49,621 INFO L495 AbstractCegarLoop]: Abstraction has 544 states and 657 transitions. [2023-02-18 07:42:49,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.64) internal successors, (282), 50 states have internal predecessors, (282), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-18 07:42:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 657 transitions. [2023-02-18 07:42:49,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-02-18 07:42:49,624 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:49,625 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:49,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:49,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-02-18 07:42:49,832 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:49,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:49,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1649033054, now seen corresponding path program 2 times [2023-02-18 07:42:49,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:49,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684713413] [2023-02-18 07:42:49,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:49,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 07:42:49,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 07:42:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 07:42:50,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 07:42:50,007 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-18 07:42:50,008 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2023-02-18 07:42:50,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-02-18 07:42:50,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-02-18 07:42:50,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-02-18 07:42:50,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-02-18 07:42:50,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-02-18 07:42:50,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-02-18 07:42:50,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-02-18 07:42:50,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2023-02-18 07:42:50,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2023-02-18 07:42:50,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2023-02-18 07:42:50,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-02-18 07:42:50,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-02-18 07:42:50,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-02-18 07:42:50,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-02-18 07:42:50,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-02-18 07:42:50,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-02-18 07:42:50,012 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-02-18 07:42:50,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-02-18 07:42:50,016 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:50,020 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 07:42:50,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 07:42:50 BoogieIcfgContainer [2023-02-18 07:42:50,094 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 07:42:50,095 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 07:42:50,095 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 07:42:50,095 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 07:42:50,096 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:42:09" (3/4) ... [2023-02-18 07:42:50,105 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-18 07:42:50,105 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 07:42:50,106 INFO L158 Benchmark]: Toolchain (without parser) took 41430.42ms. Allocated memory was 119.5MB in the beginning and 293.6MB in the end (delta: 174.1MB). Free memory was 81.8MB in the beginning and 151.7MB in the end (delta: -70.0MB). Peak memory consumption was 104.8MB. Max. memory is 16.1GB. [2023-02-18 07:42:50,108 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 119.5MB. Free memory was 91.9MB in the beginning and 91.9MB in the end (delta: 49.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 07:42:50,108 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.35ms. Allocated memory is still 119.5MB. Free memory was 81.8MB in the beginning and 68.1MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-18 07:42:50,108 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.52ms. Allocated memory is still 119.5MB. Free memory was 68.1MB in the beginning and 66.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 07:42:50,109 INFO L158 Benchmark]: Boogie Preprocessor took 46.58ms. Allocated memory is still 119.5MB. Free memory was 66.0MB in the beginning and 64.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 07:42:50,109 INFO L158 Benchmark]: RCFGBuilder took 643.14ms. Allocated memory is still 119.5MB. Free memory was 64.3MB in the beginning and 88.5MB in the end (delta: -24.2MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2023-02-18 07:42:50,109 INFO L158 Benchmark]: TraceAbstraction took 40387.17ms. Allocated memory was 119.5MB in the beginning and 293.6MB in the end (delta: 174.1MB). Free memory was 87.9MB in the beginning and 151.7MB in the end (delta: -63.8MB). Peak memory consumption was 110.0MB. Max. memory is 16.1GB. [2023-02-18 07:42:50,109 INFO L158 Benchmark]: Witness Printer took 10.44ms. Allocated memory is still 293.6MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 07:42:50,114 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 119.5MB. Free memory was 91.9MB in the beginning and 91.9MB in the end (delta: 49.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.35ms. Allocated memory is still 119.5MB. Free memory was 81.8MB in the beginning and 68.1MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.52ms. Allocated memory is still 119.5MB. Free memory was 68.1MB in the beginning and 66.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.58ms. Allocated memory is still 119.5MB. Free memory was 66.0MB in the beginning and 64.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 643.14ms. Allocated memory is still 119.5MB. Free memory was 64.3MB in the beginning and 88.5MB in the end (delta: -24.2MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * TraceAbstraction took 40387.17ms. Allocated memory was 119.5MB in the beginning and 293.6MB in the end (delta: 174.1MB). Free memory was 87.9MB in the beginning and 151.7MB in the end (delta: -63.8MB). Peak memory consumption was 110.0MB. Max. memory is 16.1GB. * Witness Printer took 10.44ms. Allocated memory is still 293.6MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseComplement at line 76, overapproximation of bitwiseAnd at line 171. Possible FailurePath: [L221] unsigned int a ; [L222] unsigned int ma = __VERIFIER_nondet_uint(); [L223] signed char ea = __VERIFIER_nondet_char(); [L224] unsigned int b ; [L225] unsigned int mb = __VERIFIER_nondet_uint(); [L226] signed char eb = __VERIFIER_nondet_char(); [L227] unsigned int r_mul ; [L228] unsigned int zero ; [L229] unsigned int one ; [L230] int sa ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; VAL [ea=-127, eb=-128] [L238] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L238] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-127, eb=-128] [L238] zero = base2flt(0, 0) [L239] CALL, EXPR base2flt(1, 0) VAL [\old(e)=0, \old(m)=1] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L35] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L47] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24, m=0] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=1, e=-24, m=0] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=1, __retres4=1744830464, e=-24, m=0, res=1744830464] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=1, \result=1744830464, __retres4=1744830464, e=-24, m=0, res=1744830464] [L239] RET, EXPR base2flt(1, 0) VAL [base2flt(1, 0)=1744830464, ea=-127, eb=-128, zero=0] [L239] one = base2flt(1, 0) [L240] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-127, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=0] [L77] EXPR e + 128 VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=0] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-127, \old(m)=16777216, __retres4=16777216, e=-127, m=0, res=16777216] [L80] return (__retres4); VAL [\old(e)=-127, \old(m)=16777216, \result=16777216, __retres4=16777216, e=-127, m=0, res=16777216] [L240] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=16777216, ea=-127, eb=-128, ma=16777216, one=1744830464, zero=0] [L240] a = base2flt(ma, ea) [L241] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=-128, \old(m)=16777217] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L29] COND FALSE !(! m) VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L57] COND TRUE 1 VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L77] EXPR e + 128 VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-128, \old(m)=16777217, __retres4=16777217, e=-128, m=16777217, res=16777217] [L80] return (__retres4); VAL [\old(e)=-128, \old(m)=16777217, \result=36028797035741185, __retres4=16777217, e=-128, m=16777217, res=16777217] [L241] RET, EXPR base2flt(mb, eb) VAL [a=16777216, base2flt(mb, eb)=36028797035741185, ea=-127, eb=-128, ma=16777216, mb=16777217, one=1744830464, zero=0] [L241] b = base2flt(mb, eb) [L243] COND FALSE !(a < zero) VAL [a=16777216, b=16777217, ea=-127, eb=-128, ma=16777216, mb=16777217, one=1744830464, zero=0] [L246] COND TRUE a > zero [L247] tmp = 1 VAL [a=16777216, b=16777217, ea=-127, eb=-128, ma=16777216, mb=16777217, one=1744830464, tmp=1, zero=0] [L251] sa = tmp VAL [a=16777216, b=16777217, ea=-127, eb=-128, ma=16777216, mb=16777217, one=1744830464, sa=1, tmp=1, zero=0] [L254] CALL mulflt(a, b) [L148] unsigned int res ; [L149] unsigned int ma ; [L150] unsigned int mb ; [L151] unsigned long long accu ; [L152] int ea ; [L153] int eb ; [L154] unsigned int tmp ; [L155] unsigned int __retres10 ; VAL [\old(a)=16777216, \old(b)=16777217, a=16777216, b=16777217] [L158] COND TRUE a < b [L159] tmp = a [L160] a = b [L161] b = tmp VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, tmp=16777216] [L165] COND FALSE !(! b) VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, tmp=16777216] [L171] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, ma=0, tmp=16777216] [L172] (int )(a >> 24U) - 128 VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, ma=0, tmp=16777216] - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 110 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 40.2s, OverallIterations: 33, TraceHistogramMax: 24, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 23.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 10524 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10489 mSDsluCounter, 34420 SdHoareTripleChecker+Invalid, 11.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30364 mSDsCounter, 523 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12263 IncrementalHoareTripleChecker+Invalid, 12787 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 523 mSolverCounterUnsat, 4056 mSDtfsCounter, 12263 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3490 GetRequests, 2755 SyntacticMatches, 57 SemanticMatches, 678 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5285 ImplicationChecksByTransitivity, 13.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=544occurred in iteration=32, InterpolantAutomatonStates: 516, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 32 MinimizatonAttempts, 7655 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 4024 NumberOfCodeBlocks, 3883 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 4818 ConstructedInterpolants, 0 QuantifiedInterpolants, 29921 SizeOfPredicates, 104 NumberOfNonLiveVariables, 4043 ConjunctsInSsa, 371 ConjunctsInUnsatCore, 64 InterpolantComputations, 20 PerfectInterpolantSequences, 3987/8195 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 [2023-02-18 07:42:50,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f330893f1140a32f6e6dacd6cc5115391759545d59ea17334f6f3b644ed5a51c --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 07:42:52,325 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 07:42:52,327 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 07:42:52,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 07:42:52,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 07:42:52,368 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 07:42:52,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 07:42:52,375 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 07:42:52,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 07:42:52,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 07:42:52,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 07:42:52,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 07:42:52,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 07:42:52,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 07:42:52,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 07:42:52,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 07:42:52,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 07:42:52,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 07:42:52,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 07:42:52,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 07:42:52,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 07:42:52,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 07:42:52,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 07:42:52,415 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 07:42:52,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 07:42:52,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 07:42:52,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 07:42:52,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 07:42:52,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 07:42:52,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 07:42:52,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 07:42:52,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 07:42:52,426 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 07:42:52,427 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 07:42:52,428 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 07:42:52,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 07:42:52,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 07:42:52,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 07:42:52,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 07:42:52,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 07:42:52,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 07:42:52,435 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2023-02-18 07:42:52,474 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 07:42:52,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 07:42:52,475 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 07:42:52,476 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 07:42:52,476 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 07:42:52,477 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 07:42:52,477 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 07:42:52,478 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 07:42:52,478 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 07:42:52,478 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 07:42:52,479 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 07:42:52,479 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 07:42:52,479 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 07:42:52,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 07:42:52,480 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 07:42:52,480 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 07:42:52,480 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 07:42:52,480 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-18 07:42:52,480 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-18 07:42:52,481 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-18 07:42:52,481 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-18 07:42:52,481 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 07:42:52,481 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 07:42:52,481 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 07:42:52,482 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 07:42:52,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 07:42:52,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 07:42:52,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 07:42:52,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 07:42:52,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 07:42:52,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 07:42:52,491 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 07:42:52,492 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-18 07:42:52,492 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-18 07:42:52,492 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 07:42:52,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 07:42:52,492 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 07:42:52,492 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 07:42:52,493 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-18 07:42:52,493 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 07:42:52,493 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 ! overflow) ) 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 -> f330893f1140a32f6e6dacd6cc5115391759545d59ea17334f6f3b644ed5a51c [2023-02-18 07:42:52,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 07:42:52,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 07:42:52,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 07:42:52,809 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 07:42:52,809 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 07:42:52,810 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2023-02-18 07:42:54,157 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 07:42:54,381 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 07:42:54,385 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2023-02-18 07:42:54,391 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72205e620/1969b84fe4e74866ae11fa725db80ac2/FLAG5faa137fd [2023-02-18 07:42:54,404 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72205e620/1969b84fe4e74866ae11fa725db80ac2 [2023-02-18 07:42:54,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 07:42:54,408 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 07:42:54,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 07:42:54,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 07:42:54,412 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 07:42:54,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:42:54" (1/1) ... [2023-02-18 07:42:54,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73bf2717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:54, skipping insertion in model container [2023-02-18 07:42:54,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:42:54" (1/1) ... [2023-02-18 07:42:54,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 07:42:54,441 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 07:42:54,556 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c[728,741] [2023-02-18 07:42:54,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 07:42:54,609 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 07:42:54,620 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c[728,741] [2023-02-18 07:42:54,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 07:42:54,678 INFO L208 MainTranslator]: Completed translation [2023-02-18 07:42:54,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:54 WrapperNode [2023-02-18 07:42:54,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 07:42:54,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 07:42:54,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 07:42:54,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 07:42:54,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:54" (1/1) ... [2023-02-18 07:42:54,720 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:54" (1/1) ... [2023-02-18 07:42:54,748 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 122 [2023-02-18 07:42:54,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 07:42:54,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 07:42:54,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 07:42:54,751 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 07:42:54,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:54" (1/1) ... [2023-02-18 07:42:54,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:54" (1/1) ... [2023-02-18 07:42:54,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:54" (1/1) ... [2023-02-18 07:42:54,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:54" (1/1) ... [2023-02-18 07:42:54,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:54" (1/1) ... [2023-02-18 07:42:54,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:54" (1/1) ... [2023-02-18 07:42:54,800 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:54" (1/1) ... [2023-02-18 07:42:54,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:54" (1/1) ... [2023-02-18 07:42:54,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 07:42:54,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 07:42:54,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 07:42:54,811 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 07:42:54,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:54" (1/1) ... [2023-02-18 07:42:54,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 07:42:54,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:54,842 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) [2023-02-18 07:42:54,853 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 [2023-02-18 07:42:54,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 07:42:54,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-18 07:42:54,882 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-18 07:42:54,882 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-18 07:42:54,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 07:42:54,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 07:42:54,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 07:42:54,883 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 07:42:54,976 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 07:42:54,978 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 07:42:55,416 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 07:42:55,422 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 07:42:55,423 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 07:42:55,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:42:55 BoogieIcfgContainer [2023-02-18 07:42:55,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 07:42:55,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 07:42:55,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 07:42:55,430 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 07:42:55,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 07:42:54" (1/3) ... [2023-02-18 07:42:55,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fed08bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:42:55, skipping insertion in model container [2023-02-18 07:42:55,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:54" (2/3) ... [2023-02-18 07:42:55,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fed08bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:42:55, skipping insertion in model container [2023-02-18 07:42:55,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:42:55" (3/3) ... [2023-02-18 07:42:55,433 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_2a.c.cil.c [2023-02-18 07:42:55,450 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 07:42:55,451 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-02-18 07:42:55,513 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 07:42:55,520 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@13a0a95a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 07:42:55,521 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-02-18 07:42:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 80 states have internal predecessors, (102), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 07:42:55,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 07:42:55,533 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:55,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:55,534 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:55,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:55,541 INFO L85 PathProgramCache]: Analyzing trace with hash -146311098, now seen corresponding path program 1 times [2023-02-18 07:42:55,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:42:55,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1929120516] [2023-02-18 07:42:55,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:55,553 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:42:55,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:42:55,559 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:42:55,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-18 07:42:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:55,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-18 07:42:55,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:55,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:55,687 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:42:55,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:42:55,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1929120516] [2023-02-18 07:42:55,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1929120516] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:55,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:55,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-18 07:42:55,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619349428] [2023-02-18 07:42:55,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:55,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 07:42:55,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:42:55,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 07:42:55,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 07:42:55,743 INFO L87 Difference]: Start difference. First operand has 87 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 80 states have internal predecessors, (102), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:42:55,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:55,787 INFO L93 Difference]: Finished difference Result 161 states and 225 transitions. [2023-02-18 07:42:55,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 07:42:55,789 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 07:42:55,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:55,796 INFO L225 Difference]: With dead ends: 161 [2023-02-18 07:42:55,797 INFO L226 Difference]: Without dead ends: 61 [2023-02-18 07:42:55,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 07:42:55,805 INFO L413 NwaCegarLoop]: 97 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, 97 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 [2023-02-18 07:42:55,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:42:55,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-02-18 07:42:55,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-02-18 07:42:55,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 55 states have internal predecessors, (65), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2023-02-18 07:42:55,853 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 9 [2023-02-18 07:42:55,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:55,854 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2023-02-18 07:42:55,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:42:55,855 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2023-02-18 07:42:55,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 07:42:55,857 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:55,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:55,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:56,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:42:56,068 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:56,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:56,069 INFO L85 PathProgramCache]: Analyzing trace with hash -147252364, now seen corresponding path program 1 times [2023-02-18 07:42:56,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:42:56,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211314789] [2023-02-18 07:42:56,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:56,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:42:56,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:42:56,072 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:42:56,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-18 07:42:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:56,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 07:42:56,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:56,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:56,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:42:56,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:42:56,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1211314789] [2023-02-18 07:42:56,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1211314789] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:56,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:56,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:42:56,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386698279] [2023-02-18 07:42:56,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:56,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:42:56,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:42:56,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:42:56,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:42:56,127 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:42:56,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:56,185 INFO L93 Difference]: Finished difference Result 127 states and 153 transitions. [2023-02-18 07:42:56,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 07:42:56,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 07:42:56,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:56,189 INFO L225 Difference]: With dead ends: 127 [2023-02-18 07:42:56,190 INFO L226 Difference]: Without dead ends: 69 [2023-02-18 07:42:56,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:56,193 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 9 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:56,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 196 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:42:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-18 07:42:56,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2023-02-18 07:42:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 59 states have internal predecessors, (69), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2023-02-18 07:42:56,215 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 9 [2023-02-18 07:42:56,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:56,216 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2023-02-18 07:42:56,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:42:56,216 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2023-02-18 07:42:56,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 07:42:56,217 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:56,217 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:56,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:56,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:42:56,427 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:56,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:56,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1113461066, now seen corresponding path program 1 times [2023-02-18 07:42:56,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:42:56,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848604687] [2023-02-18 07:42:56,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:56,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:42:56,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:42:56,435 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:42:56,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-18 07:42:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:56,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 07:42:56,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:56,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:42:56,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:42:56,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [848604687] [2023-02-18 07:42:56,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [848604687] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:56,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:56,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 07:42:56,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462896536] [2023-02-18 07:42:56,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:56,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:42:56,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:42:56,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:42:56,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:42:56,549 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2023-02-18 07:42:56,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:56,639 INFO L93 Difference]: Finished difference Result 159 states and 192 transitions. [2023-02-18 07:42:56,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:42:56,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 16 [2023-02-18 07:42:56,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:56,641 INFO L225 Difference]: With dead ends: 159 [2023-02-18 07:42:56,641 INFO L226 Difference]: Without dead ends: 103 [2023-02-18 07:42:56,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:56,643 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 55 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:56,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 187 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:56,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-18 07:42:56,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2023-02-18 07:42:56,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 88 states have internal predecessors, (108), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:56,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2023-02-18 07:42:56,653 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 16 [2023-02-18 07:42:56,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:56,653 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2023-02-18 07:42:56,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2023-02-18 07:42:56,654 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2023-02-18 07:42:56,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-18 07:42:56,654 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:56,655 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:56,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:56,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:42:56,866 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:56,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:56,866 INFO L85 PathProgramCache]: Analyzing trace with hash 206311476, now seen corresponding path program 1 times [2023-02-18 07:42:56,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:42:56,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [302810509] [2023-02-18 07:42:56,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:56,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:42:56,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:42:56,869 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:42:56,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-18 07:42:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:56,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 07:42:56,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:56,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:42:56,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:42:56,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [302810509] [2023-02-18 07:42:56,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [302810509] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:56,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:56,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 07:42:56,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897614793] [2023-02-18 07:42:56,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:56,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:42:56,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:42:56,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:42:56,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:56,980 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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) [2023-02-18 07:42:57,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:57,075 INFO L93 Difference]: Finished difference Result 170 states and 201 transitions. [2023-02-18 07:42:57,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 07:42:57,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 21 [2023-02-18 07:42:57,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:57,077 INFO L225 Difference]: With dead ends: 170 [2023-02-18 07:42:57,077 INFO L226 Difference]: Without dead ends: 95 [2023-02-18 07:42:57,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:42:57,079 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 38 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:57,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 262 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:57,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-02-18 07:42:57,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2023-02-18 07:42:57,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 70 states have (on average 1.3) internal successors, (91), 77 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2023-02-18 07:42:57,103 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 21 [2023-02-18 07:42:57,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:57,104 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2023-02-18 07:42:57,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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) [2023-02-18 07:42:57,104 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2023-02-18 07:42:57,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-18 07:42:57,105 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:57,105 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:57,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:57,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:42:57,306 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:57,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:57,307 INFO L85 PathProgramCache]: Analyzing trace with hash 206202372, now seen corresponding path program 1 times [2023-02-18 07:42:57,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:42:57,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812656477] [2023-02-18 07:42:57,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:57,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:42:57,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:42:57,309 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:42:57,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-18 07:42:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:57,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 07:42:57,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:57,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:57,425 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:42:57,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812656477] [2023-02-18 07:42:57,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812656477] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:57,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:42:57,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-02-18 07:42:57,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483291226] [2023-02-18 07:42:57,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:57,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 07:42:57,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:42:57,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 07:42:57,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-02-18 07:42:57,427 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:42:57,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:57,841 INFO L93 Difference]: Finished difference Result 181 states and 221 transitions. [2023-02-18 07:42:57,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 07:42:57,851 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-02-18 07:42:57,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:57,852 INFO L225 Difference]: With dead ends: 181 [2023-02-18 07:42:57,852 INFO L226 Difference]: Without dead ends: 122 [2023-02-18 07:42:57,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2023-02-18 07:42:57,854 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 186 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:57,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 301 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 07:42:57,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-18 07:42:57,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 86. [2023-02-18 07:42:57,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 78 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:57,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2023-02-18 07:42:57,865 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 21 [2023-02-18 07:42:57,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:57,866 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2023-02-18 07:42:57,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:42:57,866 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2023-02-18 07:42:57,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-18 07:42:57,867 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:57,867 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:57,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:58,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:42:58,077 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:58,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:58,077 INFO L85 PathProgramCache]: Analyzing trace with hash 710516666, now seen corresponding path program 1 times [2023-02-18 07:42:58,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:42:58,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691121008] [2023-02-18 07:42:58,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:58,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:42:58,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:42:58,080 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:42:58,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-18 07:42:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:58,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 07:42:58,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:58,139 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:58,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:58,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:42:58,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691121008] [2023-02-18 07:42:58,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691121008] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:58,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:42:58,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-18 07:42:58,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364693192] [2023-02-18 07:42:58,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:58,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 07:42:58,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:42:58,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 07:42:58,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-18 07:42:58,178 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:42:58,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:58,359 INFO L93 Difference]: Finished difference Result 184 states and 216 transitions. [2023-02-18 07:42:58,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 07:42:58,359 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-02-18 07:42:58,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:58,360 INFO L225 Difference]: With dead ends: 184 [2023-02-18 07:42:58,361 INFO L226 Difference]: Without dead ends: 123 [2023-02-18 07:42:58,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2023-02-18 07:42:58,362 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 141 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:58,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 522 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:58,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-18 07:42:58,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 104. [2023-02-18 07:42:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 96 states have internal predecessors, (112), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:58,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2023-02-18 07:42:58,373 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 26 [2023-02-18 07:42:58,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:58,374 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2023-02-18 07:42:58,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:42:58,374 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2023-02-18 07:42:58,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-18 07:42:58,375 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:58,375 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:58,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:58,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:42:58,585 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:58,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:58,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1133060784, now seen corresponding path program 1 times [2023-02-18 07:42:58,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:42:58,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182509631] [2023-02-18 07:42:58,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:58,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:42:58,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:42:58,587 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:42:58,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-18 07:42:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:58,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 07:42:58,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:58,680 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:42:58,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:42:58,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:42:58,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182509631] [2023-02-18 07:42:58,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182509631] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:58,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:42:58,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-18 07:42:58,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25068951] [2023-02-18 07:42:58,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:58,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 07:42:58,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:42:58,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 07:42:58,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-18 07:42:58,762 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:42:59,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:59,227 INFO L93 Difference]: Finished difference Result 251 states and 304 transitions. [2023-02-18 07:42:59,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 07:42:59,228 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2023-02-18 07:42:59,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:59,230 INFO L225 Difference]: With dead ends: 251 [2023-02-18 07:42:59,230 INFO L226 Difference]: Without dead ends: 190 [2023-02-18 07:42:59,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2023-02-18 07:42:59,231 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 102 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:59,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 490 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 07:42:59,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-02-18 07:42:59,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 106. [2023-02-18 07:42:59,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.2065217391304348) internal successors, (111), 98 states have internal predecessors, (111), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:59,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2023-02-18 07:42:59,245 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 38 [2023-02-18 07:42:59,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:59,246 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2023-02-18 07:42:59,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:42:59,246 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2023-02-18 07:42:59,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-18 07:42:59,247 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:59,247 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:59,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-02-18 07:42:59,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:42:59,459 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:42:59,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:59,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1445955526, now seen corresponding path program 2 times [2023-02-18 07:42:59,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:42:59,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810934793] [2023-02-18 07:42:59,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 07:42:59,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:42:59,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:42:59,461 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:42:59,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-18 07:42:59,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 07:42:59,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:42:59,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 07:42:59,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:59,564 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:59,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:59,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:42:59,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810934793] [2023-02-18 07:42:59,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810934793] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:59,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:42:59,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2023-02-18 07:42:59,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987221778] [2023-02-18 07:42:59,709 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:59,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-18 07:42:59,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:42:59,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-18 07:42:59,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2023-02-18 07:42:59,710 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:43:00,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:00,249 INFO L93 Difference]: Finished difference Result 242 states and 284 transitions. [2023-02-18 07:43:00,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-18 07:43:00,250 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2023-02-18 07:43:00,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:00,251 INFO L225 Difference]: With dead ends: 242 [2023-02-18 07:43:00,252 INFO L226 Difference]: Without dead ends: 181 [2023-02-18 07:43:00,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=383, Invalid=949, Unknown=0, NotChecked=0, Total=1332 [2023-02-18 07:43:00,253 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 317 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:00,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1039 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 07:43:00,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-18 07:43:00,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 144. [2023-02-18 07:43:00,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 130 states have (on average 1.2) internal successors, (156), 136 states have internal predecessors, (156), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:43:00,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 164 transitions. [2023-02-18 07:43:00,267 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 164 transitions. Word has length 46 [2023-02-18 07:43:00,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:00,267 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 164 transitions. [2023-02-18 07:43:00,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:43:00,268 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 164 transitions. [2023-02-18 07:43:00,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-18 07:43:00,269 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:00,269 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:00,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:00,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:00,479 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:43:00,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:00,479 INFO L85 PathProgramCache]: Analyzing trace with hash 285162288, now seen corresponding path program 2 times [2023-02-18 07:43:00,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:00,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788105212] [2023-02-18 07:43:00,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 07:43:00,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:00,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:00,481 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:00,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-18 07:43:00,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-18 07:43:00,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:43:00,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-18 07:43:00,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:00,531 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-02-18 07:43:00,531 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:43:00,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:00,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788105212] [2023-02-18 07:43:00,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788105212] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:43:00,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:43:00,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 07:43:00,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030962275] [2023-02-18 07:43:00,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:43:00,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 07:43:00,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:00,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 07:43:00,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 07:43:00,534 INFO L87 Difference]: Start difference. First operand 144 states and 164 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:43:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:00,559 INFO L93 Difference]: Finished difference Result 150 states and 171 transitions. [2023-02-18 07:43:00,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 07:43:00,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 58 [2023-02-18 07:43:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:00,561 INFO L225 Difference]: With dead ends: 150 [2023-02-18 07:43:00,561 INFO L226 Difference]: Without dead ends: 149 [2023-02-18 07:43:00,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 07:43:00,562 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 2 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:00,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 134 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:43:00,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-02-18 07:43:00,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 143. [2023-02-18 07:43:00,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 130 states have (on average 1.1923076923076923) internal successors, (155), 135 states have internal predecessors, (155), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:43:00,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 163 transitions. [2023-02-18 07:43:00,574 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 163 transitions. Word has length 58 [2023-02-18 07:43:00,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:00,574 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 163 transitions. [2023-02-18 07:43:00,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:43:00,574 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 163 transitions. [2023-02-18 07:43:00,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-18 07:43:00,576 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:00,576 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:00,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:00,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:00,784 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:43:00,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:00,785 INFO L85 PathProgramCache]: Analyzing trace with hash 285229814, now seen corresponding path program 1 times [2023-02-18 07:43:00,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:00,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091031427] [2023-02-18 07:43:00,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:00,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:00,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:00,787 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:00,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-18 07:43:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:00,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 07:43:00,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:43:00,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:43:01,265 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:43:01,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:01,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091031427] [2023-02-18 07:43:01,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091031427] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:43:01,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:43:01,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-02-18 07:43:01,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334790185] [2023-02-18 07:43:01,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:43:01,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 07:43:01,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:01,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 07:43:01,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-02-18 07:43:01,268 INFO L87 Difference]: Start difference. First operand 143 states and 163 transitions. Second operand has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:43:02,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:02,754 INFO L93 Difference]: Finished difference Result 392 states and 481 transitions. [2023-02-18 07:43:02,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-18 07:43:02,755 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 58 [2023-02-18 07:43:02,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:02,757 INFO L225 Difference]: With dead ends: 392 [2023-02-18 07:43:02,757 INFO L226 Difference]: Without dead ends: 332 [2023-02-18 07:43:02,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=343, Invalid=649, Unknown=0, NotChecked=0, Total=992 [2023-02-18 07:43:02,759 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 348 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:02,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 880 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-18 07:43:02,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-02-18 07:43:02,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 145. [2023-02-18 07:43:02,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 132 states have (on average 1.1363636363636365) internal successors, (150), 137 states have internal predecessors, (150), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:43:02,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2023-02-18 07:43:02,784 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 58 [2023-02-18 07:43:02,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:02,784 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2023-02-18 07:43:02,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:43:02,785 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2023-02-18 07:43:02,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-18 07:43:02,785 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:02,786 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:02,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:02,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:02,995 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:43:02,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:02,995 INFO L85 PathProgramCache]: Analyzing trace with hash -205887174, now seen corresponding path program 3 times [2023-02-18 07:43:02,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:02,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347074123] [2023-02-18 07:43:02,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 07:43:02,996 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:02,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:02,997 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:02,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-18 07:43:03,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2023-02-18 07:43:03,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:43:03,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-18 07:43:03,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:03,279 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 2 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:43:03,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:43:03,773 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 2 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:43:03,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:03,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347074123] [2023-02-18 07:43:03,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347074123] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:43:03,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:43:03,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2023-02-18 07:43:03,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260018573] [2023-02-18 07:43:03,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:43:03,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-18 07:43:03,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:03,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-18 07:43:03,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=886, Unknown=0, NotChecked=0, Total=1190 [2023-02-18 07:43:03,776 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand has 35 states, 35 states have (on average 4.457142857142857) internal successors, (156), 33 states have internal predecessors, (156), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:43:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:07,304 INFO L93 Difference]: Finished difference Result 495 states and 597 transitions. [2023-02-18 07:43:07,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-02-18 07:43:07,304 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.457142857142857) internal successors, (156), 33 states have internal predecessors, (156), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2023-02-18 07:43:07,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:07,306 INFO L225 Difference]: With dead ends: 495 [2023-02-18 07:43:07,306 INFO L226 Difference]: Without dead ends: 435 [2023-02-18 07:43:07,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2711, Invalid=7189, Unknown=0, NotChecked=0, Total=9900 [2023-02-18 07:43:07,312 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 725 mSDsluCounter, 2763 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 2948 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:07,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 2948 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-18 07:43:07,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2023-02-18 07:43:07,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 223. [2023-02-18 07:43:07,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 210 states have (on average 1.161904761904762) internal successors, (244), 215 states have internal predecessors, (244), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:43:07,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 252 transitions. [2023-02-18 07:43:07,339 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 252 transitions. Word has length 86 [2023-02-18 07:43:07,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:07,340 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 252 transitions. [2023-02-18 07:43:07,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.457142857142857) internal successors, (156), 33 states have internal predecessors, (156), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:43:07,341 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 252 transitions. [2023-02-18 07:43:07,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-02-18 07:43:07,343 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:07,344 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:07,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:07,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:07,553 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:43:07,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:07,553 INFO L85 PathProgramCache]: Analyzing trace with hash 512275446, now seen corresponding path program 2 times [2023-02-18 07:43:07,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:07,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408837955] [2023-02-18 07:43:07,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 07:43:07,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:07,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:07,555 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:07,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-18 07:43:07,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 07:43:07,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:43:07,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 07:43:07,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:07,896 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:43:07,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:43:08,863 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:43:08,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:08,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408837955] [2023-02-18 07:43:08,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408837955] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:43:08,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:43:08,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2023-02-18 07:43:08,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928775229] [2023-02-18 07:43:08,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:43:08,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-18 07:43:08,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:08,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-18 07:43:08,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2023-02-18 07:43:08,867 INFO L87 Difference]: Start difference. First operand 223 states and 252 transitions. Second operand has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:43:14,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:14,301 INFO L93 Difference]: Finished difference Result 686 states and 849 transitions. [2023-02-18 07:43:14,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-02-18 07:43:14,302 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 98 [2023-02-18 07:43:14,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:14,304 INFO L225 Difference]: With dead ends: 686 [2023-02-18 07:43:14,305 INFO L226 Difference]: Without dead ends: 626 [2023-02-18 07:43:14,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 188 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1327, Invalid=2705, Unknown=0, NotChecked=0, Total=4032 [2023-02-18 07:43:14,307 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 777 mSDsluCounter, 2309 mSDsCounter, 0 mSdLazyCounter, 2624 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 2451 SdHoareTripleChecker+Invalid, 2696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:14,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 2451 Invalid, 2696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2624 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-02-18 07:43:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2023-02-18 07:43:14,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 225. [2023-02-18 07:43:14,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 212 states have (on average 1.0896226415094339) internal successors, (231), 217 states have internal predecessors, (231), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:43:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 239 transitions. [2023-02-18 07:43:14,340 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 239 transitions. Word has length 98 [2023-02-18 07:43:14,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:14,340 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 239 transitions. [2023-02-18 07:43:14,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:43:14,340 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 239 transitions. [2023-02-18 07:43:14,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-02-18 07:43:14,341 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:14,341 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:14,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:14,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:14,545 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:43:14,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:14,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1070477702, now seen corresponding path program 4 times [2023-02-18 07:43:14,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:14,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859114094] [2023-02-18 07:43:14,546 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 07:43:14,546 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:14,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:14,547 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:14,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-18 07:43:14,616 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 07:43:14,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:43:14,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-18 07:43:14,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:14,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 2 proven. 1380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:43:14,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:43:17,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 2 proven. 1380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:43:17,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:17,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859114094] [2023-02-18 07:43:17,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859114094] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:43:17,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:43:17,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2023-02-18 07:43:17,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274114922] [2023-02-18 07:43:17,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:43:17,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-18 07:43:17,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:17,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-18 07:43:17,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=731, Invalid=2131, Unknown=0, NotChecked=0, Total=2862 [2023-02-18 07:43:17,074 INFO L87 Difference]: Start difference. First operand 225 states and 239 transitions. Second operand has 54 states, 53 states have (on average 4.886792452830188) internal successors, (259), 52 states have internal predecessors, (259), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:43:41,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:41,585 INFO L93 Difference]: Finished difference Result 461 states and 529 transitions. [2023-02-18 07:43:41,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-02-18 07:43:41,590 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 4.886792452830188) internal successors, (259), 52 states have internal predecessors, (259), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 136 [2023-02-18 07:43:41,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:41,592 INFO L225 Difference]: With dead ends: 461 [2023-02-18 07:43:41,592 INFO L226 Difference]: Without dead ends: 460 [2023-02-18 07:43:41,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=4535, Invalid=12235, Unknown=0, NotChecked=0, Total=16770 [2023-02-18 07:43:41,596 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 731 mSDsluCounter, 4329 mSDsCounter, 0 mSdLazyCounter, 4044 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 4436 SdHoareTripleChecker+Invalid, 4193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 4044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:41,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 4436 Invalid, 4193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 4044 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-02-18 07:43:41,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2023-02-18 07:43:41,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 343. [2023-02-18 07:43:41,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 330 states have (on average 1.1939393939393939) internal successors, (394), 335 states have internal predecessors, (394), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:43:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 402 transitions. [2023-02-18 07:43:41,655 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 402 transitions. Word has length 136 [2023-02-18 07:43:41,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:41,656 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 402 transitions. [2023-02-18 07:43:41,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 4.886792452830188) internal successors, (259), 52 states have internal predecessors, (259), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:43:41,656 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 402 transitions. [2023-02-18 07:43:41,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-02-18 07:43:41,657 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:41,658 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:41,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:41,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:41,862 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:43:41,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:41,863 INFO L85 PathProgramCache]: Analyzing trace with hash -518441817, now seen corresponding path program 1 times [2023-02-18 07:43:41,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:41,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053790878] [2023-02-18 07:43:41,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:41,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:41,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:41,865 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:41,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-18 07:43:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:41,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 07:43:41,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:41,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1385 trivial. 0 not checked. [2023-02-18 07:43:41,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:43:41,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:41,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053790878] [2023-02-18 07:43:41,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053790878] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:43:41,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:43:41,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 07:43:41,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500137583] [2023-02-18 07:43:41,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:43:41,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:43:41,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:41,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:43:41,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:43:41,969 INFO L87 Difference]: Start difference. First operand 343 states and 402 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:43:42,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:42,474 INFO L93 Difference]: Finished difference Result 355 states and 417 transitions. [2023-02-18 07:43:42,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:43:42,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 149 [2023-02-18 07:43:42,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:42,479 INFO L225 Difference]: With dead ends: 355 [2023-02-18 07:43:42,479 INFO L226 Difference]: Without dead ends: 354 [2023-02-18 07:43:42,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:43:42,480 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 52 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:42,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 148 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 07:43:42,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2023-02-18 07:43:42,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 345. [2023-02-18 07:43:42,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 332 states have (on average 1.1957831325301205) internal successors, (397), 337 states have internal predecessors, (397), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:43:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 405 transitions. [2023-02-18 07:43:42,537 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 405 transitions. Word has length 149 [2023-02-18 07:43:42,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:42,538 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 405 transitions. [2023-02-18 07:43:42,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:43:42,538 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 405 transitions. [2023-02-18 07:43:42,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-02-18 07:43:42,539 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:42,539 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 25, 23, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:42,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:42,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:42,749 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:43:42,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:42,749 INFO L85 PathProgramCache]: Analyzing trace with hash -356034331, now seen corresponding path program 1 times [2023-02-18 07:43:42,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:42,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588486754] [2023-02-18 07:43:42,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:42,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:42,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:42,751 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:42,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-18 07:43:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:42,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 07:43:42,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:43,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1513 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 1385 trivial. 0 not checked. [2023-02-18 07:43:43,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:43:43,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:43,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588486754] [2023-02-18 07:43:43,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588486754] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:43:43,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:43:43,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 07:43:43,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463796656] [2023-02-18 07:43:43,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:43:43,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 07:43:43,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:43,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 07:43:43,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:43:43,478 INFO L87 Difference]: Start difference. First operand 345 states and 405 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:43:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:46,186 INFO L93 Difference]: Finished difference Result 360 states and 424 transitions. [2023-02-18 07:43:46,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 07:43:46,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2023-02-18 07:43:46,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:46,189 INFO L225 Difference]: With dead ends: 360 [2023-02-18 07:43:46,189 INFO L226 Difference]: Without dead ends: 359 [2023-02-18 07:43:46,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-02-18 07:43:46,190 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 55 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:46,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 261 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-02-18 07:43:46,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2023-02-18 07:43:46,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 224. [2023-02-18 07:43:46,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 212 states have (on average 1.080188679245283) internal successors, (229), 216 states have internal predecessors, (229), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:43:46,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 237 transitions. [2023-02-18 07:43:46,220 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 237 transitions. Word has length 152 [2023-02-18 07:43:46,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:46,220 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 237 transitions. [2023-02-18 07:43:46,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:43:46,220 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 237 transitions. [2023-02-18 07:43:46,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-02-18 07:43:46,222 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:46,222 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:46,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:46,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:46,429 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:43:46,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:46,430 INFO L85 PathProgramCache]: Analyzing trace with hash 927872764, now seen corresponding path program 1 times [2023-02-18 07:43:46,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:46,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329156321] [2023-02-18 07:43:46,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:46,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:46,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:46,431 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:46,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-18 07:43:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:46,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 07:43:46,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:46,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1401 trivial. 0 not checked. [2023-02-18 07:43:46,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:43:46,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1401 trivial. 0 not checked. [2023-02-18 07:43:46,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:46,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329156321] [2023-02-18 07:43:46,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329156321] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:43:46,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:43:46,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2023-02-18 07:43:46,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011953513] [2023-02-18 07:43:46,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:43:46,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 07:43:46,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:46,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 07:43:46,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:43:46,550 INFO L87 Difference]: Start difference. First operand 224 states and 237 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:43:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:46,618 INFO L93 Difference]: Finished difference Result 256 states and 271 transitions. [2023-02-18 07:43:46,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 07:43:46,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 163 [2023-02-18 07:43:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:46,620 INFO L225 Difference]: With dead ends: 256 [2023-02-18 07:43:46,620 INFO L226 Difference]: Without dead ends: 230 [2023-02-18 07:43:46,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:43:46,621 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 33 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:46,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 278 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:43:46,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-02-18 07:43:46,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 224. [2023-02-18 07:43:46,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 212 states have (on average 1.0754716981132075) internal successors, (228), 216 states have internal predecessors, (228), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:43:46,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 236 transitions. [2023-02-18 07:43:46,652 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 236 transitions. Word has length 163 [2023-02-18 07:43:46,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:46,652 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 236 transitions. [2023-02-18 07:43:46,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:43:46,652 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 236 transitions. [2023-02-18 07:43:46,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-02-18 07:43:46,654 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:46,654 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:46,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:46,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:46,865 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:43:46,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:46,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1734463710, now seen corresponding path program 1 times [2023-02-18 07:43:46,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:46,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781330555] [2023-02-18 07:43:46,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:46,866 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:46,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:46,867 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:46,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-18 07:43:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:46,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 07:43:46,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:46,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1401 trivial. 0 not checked. [2023-02-18 07:43:46,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:43:46,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1401 trivial. 0 not checked. [2023-02-18 07:43:46,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:46,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781330555] [2023-02-18 07:43:46,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781330555] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:43:46,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:43:46,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2023-02-18 07:43:46,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423743730] [2023-02-18 07:43:46,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:43:46,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 07:43:46,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:46,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 07:43:46,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:43:46,975 INFO L87 Difference]: Start difference. First operand 224 states and 236 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:43:47,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:47,045 INFO L93 Difference]: Finished difference Result 289 states and 307 transitions. [2023-02-18 07:43:47,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 07:43:47,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 165 [2023-02-18 07:43:47,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:47,047 INFO L225 Difference]: With dead ends: 289 [2023-02-18 07:43:47,047 INFO L226 Difference]: Without dead ends: 262 [2023-02-18 07:43:47,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:43:47,048 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 31 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:47,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 316 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:43:47,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-02-18 07:43:47,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 232. [2023-02-18 07:43:47,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 218 states have (on average 1.073394495412844) internal successors, (234), 222 states have internal predecessors, (234), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-18 07:43:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 247 transitions. [2023-02-18 07:43:47,084 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 247 transitions. Word has length 165 [2023-02-18 07:43:47,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:47,085 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 247 transitions. [2023-02-18 07:43:47,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:43:47,085 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 247 transitions. [2023-02-18 07:43:47,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-02-18 07:43:47,086 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:47,087 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:47,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:47,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:47,297 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:43:47,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:47,297 INFO L85 PathProgramCache]: Analyzing trace with hash -2127490720, now seen corresponding path program 1 times [2023-02-18 07:43:47,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:47,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502475266] [2023-02-18 07:43:47,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:47,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:47,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:47,299 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:47,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-18 07:43:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:47,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 07:43:47,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1401 trivial. 0 not checked. [2023-02-18 07:43:47,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:43:47,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:47,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502475266] [2023-02-18 07:43:47,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [502475266] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:43:47,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:43:47,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 07:43:47,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726823380] [2023-02-18 07:43:47,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:43:47,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 07:43:47,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:47,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 07:43:47,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:43:47,406 INFO L87 Difference]: Start difference. First operand 232 states and 247 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:43:47,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:47,486 INFO L93 Difference]: Finished difference Result 269 states and 286 transitions. [2023-02-18 07:43:47,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 07:43:47,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 165 [2023-02-18 07:43:47,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:47,488 INFO L225 Difference]: With dead ends: 269 [2023-02-18 07:43:47,488 INFO L226 Difference]: Without dead ends: 235 [2023-02-18 07:43:47,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-18 07:43:47,489 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 6 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:47,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 381 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:43:47,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-02-18 07:43:47,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2023-02-18 07:43:47,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 218 states have (on average 1.073394495412844) internal successors, (234), 222 states have internal predecessors, (234), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 07:43:47,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 245 transitions. [2023-02-18 07:43:47,524 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 245 transitions. Word has length 165 [2023-02-18 07:43:47,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:47,525 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 245 transitions. [2023-02-18 07:43:47,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:43:47,525 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 245 transitions. [2023-02-18 07:43:47,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-02-18 07:43:47,527 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:47,527 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:47,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:47,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:47,737 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:43:47,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:47,738 INFO L85 PathProgramCache]: Analyzing trace with hash 634665935, now seen corresponding path program 1 times [2023-02-18 07:43:47,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:47,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307589265] [2023-02-18 07:43:47,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:47,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:47,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:47,739 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:47,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-18 07:43:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:47,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 07:43:47,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:47,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1411 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2023-02-18 07:43:47,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:43:47,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1411 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2023-02-18 07:43:47,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:47,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307589265] [2023-02-18 07:43:47,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307589265] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:43:47,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:43:47,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-02-18 07:43:47,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428647086] [2023-02-18 07:43:47,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:43:47,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 07:43:47,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:47,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 07:43:47,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-18 07:43:47,861 INFO L87 Difference]: Start difference. First operand 232 states and 245 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:43:47,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:47,967 INFO L93 Difference]: Finished difference Result 263 states and 277 transitions. [2023-02-18 07:43:47,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 07:43:47,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 169 [2023-02-18 07:43:47,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:47,969 INFO L225 Difference]: With dead ends: 263 [2023-02-18 07:43:47,970 INFO L226 Difference]: Without dead ends: 227 [2023-02-18 07:43:47,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 07:43:47,971 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 6 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:47,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 431 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:43:47,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-18 07:43:48,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2023-02-18 07:43:48,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 212 states have (on average 1.0660377358490567) internal successors, (226), 216 states have internal predecessors, (226), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:43:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 234 transitions. [2023-02-18 07:43:48,001 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 234 transitions. Word has length 169 [2023-02-18 07:43:48,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:48,002 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 234 transitions. [2023-02-18 07:43:48,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:43:48,002 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 234 transitions. [2023-02-18 07:43:48,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-02-18 07:43:48,005 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:48,005 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:48,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:48,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:48,215 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:43:48,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:48,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1885668414, now seen corresponding path program 1 times [2023-02-18 07:43:48,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:48,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311689559] [2023-02-18 07:43:48,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:48,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:48,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:48,218 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:48,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-18 07:43:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:48,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 07:43:48,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:48,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-02-18 07:43:48,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:43:48,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:48,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311689559] [2023-02-18 07:43:48,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311689559] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:43:48,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:43:48,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-18 07:43:48,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289153144] [2023-02-18 07:43:48,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:43:48,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 07:43:48,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:48,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 07:43:48,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-18 07:43:48,339 INFO L87 Difference]: Start difference. First operand 224 states and 234 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:43:48,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:48,476 INFO L93 Difference]: Finished difference Result 313 states and 330 transitions. [2023-02-18 07:43:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 07:43:48,477 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 173 [2023-02-18 07:43:48,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:48,478 INFO L225 Difference]: With dead ends: 313 [2023-02-18 07:43:48,478 INFO L226 Difference]: Without dead ends: 289 [2023-02-18 07:43:48,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-18 07:43:48,479 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 113 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:48,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 545 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:43:48,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-02-18 07:43:48,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 235. [2023-02-18 07:43:48,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 221 states have (on average 1.0678733031674208) internal successors, (236), 225 states have internal predecessors, (236), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-18 07:43:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 249 transitions. [2023-02-18 07:43:48,515 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 249 transitions. Word has length 173 [2023-02-18 07:43:48,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:48,515 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 249 transitions. [2023-02-18 07:43:48,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:43:48,516 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 249 transitions. [2023-02-18 07:43:48,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-02-18 07:43:48,518 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:48,518 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:48,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-02-18 07:43:48,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:48,727 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:43:48,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:48,728 INFO L85 PathProgramCache]: Analyzing trace with hash -110661052, now seen corresponding path program 1 times [2023-02-18 07:43:48,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:48,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749888591] [2023-02-18 07:43:48,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:48,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:48,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:48,729 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:48,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-02-18 07:43:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:48,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 07:43:48,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:48,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-02-18 07:43:48,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:43:48,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:48,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749888591] [2023-02-18 07:43:48,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749888591] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:43:48,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:43:48,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-18 07:43:48,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279418503] [2023-02-18 07:43:48,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:43:48,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 07:43:48,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:48,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 07:43:48,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-18 07:43:48,883 INFO L87 Difference]: Start difference. First operand 235 states and 249 transitions. Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:43:49,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:49,120 INFO L93 Difference]: Finished difference Result 289 states and 305 transitions. [2023-02-18 07:43:49,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 07:43:49,120 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 173 [2023-02-18 07:43:49,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:49,122 INFO L225 Difference]: With dead ends: 289 [2023-02-18 07:43:49,122 INFO L226 Difference]: Without dead ends: 287 [2023-02-18 07:43:49,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-02-18 07:43:49,123 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 107 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:49,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 502 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 07:43:49,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2023-02-18 07:43:49,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 242. [2023-02-18 07:43:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 228 states have (on average 1.0657894736842106) internal successors, (243), 232 states have internal predecessors, (243), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-18 07:43:49,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 256 transitions. [2023-02-18 07:43:49,156 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 256 transitions. Word has length 173 [2023-02-18 07:43:49,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:49,157 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 256 transitions. [2023-02-18 07:43:49,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:43:49,157 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 256 transitions. [2023-02-18 07:43:49,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-02-18 07:43:49,159 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:49,159 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:49,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:49,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:49,369 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:43:49,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:49,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1029742296, now seen corresponding path program 1 times [2023-02-18 07:43:49,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:49,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777477134] [2023-02-18 07:43:49,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:49,370 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:49,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:49,371 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:49,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-02-18 07:43:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:49,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 07:43:49,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:49,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1409 trivial. 0 not checked. [2023-02-18 07:43:49,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:43:49,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:49,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777477134] [2023-02-18 07:43:49,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777477134] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:43:49,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [39436746] [2023-02-18 07:43:49,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:49,574 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 07:43:49,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 07:43:49,575 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 07:43:49,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2023-02-18 07:43:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:49,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 07:43:49,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1409 trivial. 0 not checked. [2023-02-18 07:43:49,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:43:49,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1409 trivial. 0 not checked. [2023-02-18 07:43:49,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [39436746] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:43:49,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:43:49,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 9 [2023-02-18 07:43:49,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796134125] [2023-02-18 07:43:49,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:43:49,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 07:43:49,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:49,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 07:43:49,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2023-02-18 07:43:49,697 INFO L87 Difference]: Start difference. First operand 242 states and 256 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:43:49,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:49,823 INFO L93 Difference]: Finished difference Result 296 states and 312 transitions. [2023-02-18 07:43:49,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 07:43:49,823 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 175 [2023-02-18 07:43:49,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:49,825 INFO L225 Difference]: With dead ends: 296 [2023-02-18 07:43:49,825 INFO L226 Difference]: Without dead ends: 272 [2023-02-18 07:43:49,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-02-18 07:43:49,826 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 54 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:49,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 655 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:43:49,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2023-02-18 07:43:49,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 248. [2023-02-18 07:43:49,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 234 states have (on average 1.0683760683760684) internal successors, (250), 237 states have internal predecessors, (250), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-18 07:43:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 263 transitions. [2023-02-18 07:43:49,860 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 263 transitions. Word has length 175 [2023-02-18 07:43:49,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:49,861 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 263 transitions. [2023-02-18 07:43:49,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:43:49,861 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 263 transitions. [2023-02-18 07:43:49,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-02-18 07:43:49,867 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:49,868 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:49,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2023-02-18 07:43:50,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:50,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:50,270 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:43:50,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:50,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1490217638, now seen corresponding path program 1 times [2023-02-18 07:43:50,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:50,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209724816] [2023-02-18 07:43:50,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:50,271 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:50,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:50,272 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:50,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-02-18 07:43:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:50,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 07:43:50,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1409 trivial. 0 not checked. [2023-02-18 07:43:50,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:43:50,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:50,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209724816] [2023-02-18 07:43:50,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209724816] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:43:50,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1965180010] [2023-02-18 07:43:50,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:50,441 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 07:43:50,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 07:43:50,442 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 07:43:50,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-02-18 07:43:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:50,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 07:43:50,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:50,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1409 trivial. 0 not checked. [2023-02-18 07:43:50,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:43:50,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1965180010] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:43:50,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:43:50,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2023-02-18 07:43:50,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494720465] [2023-02-18 07:43:50,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:43:50,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 07:43:50,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:50,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 07:43:50,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-02-18 07:43:50,615 INFO L87 Difference]: Start difference. First operand 248 states and 263 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:43:50,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:50,839 INFO L93 Difference]: Finished difference Result 272 states and 287 transitions. [2023-02-18 07:43:50,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 07:43:50,840 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 175 [2023-02-18 07:43:50,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:50,841 INFO L225 Difference]: With dead ends: 272 [2023-02-18 07:43:50,841 INFO L226 Difference]: Without dead ends: 271 [2023-02-18 07:43:50,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-02-18 07:43:50,842 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 51 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:50,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 399 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 07:43:50,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-02-18 07:43:50,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 254. [2023-02-18 07:43:50,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 240 states have (on average 1.0666666666666667) internal successors, (256), 243 states have internal predecessors, (256), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-18 07:43:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 269 transitions. [2023-02-18 07:43:50,875 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 269 transitions. Word has length 175 [2023-02-18 07:43:50,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:50,876 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 269 transitions. [2023-02-18 07:43:50,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:43:50,876 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 269 transitions. [2023-02-18 07:43:50,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-02-18 07:43:50,877 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:50,877 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:50,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:51,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:51,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:51,281 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:43:51,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:51,281 INFO L85 PathProgramCache]: Analyzing trace with hash 979626668, now seen corresponding path program 2 times [2023-02-18 07:43:51,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:51,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778035118] [2023-02-18 07:43:51,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 07:43:51,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:51,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:51,283 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:51,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-02-18 07:43:51,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-18 07:43:51,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:43:51,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 07:43:51,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:51,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1418 trivial. 0 not checked. [2023-02-18 07:43:51,333 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:43:51,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:51,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778035118] [2023-02-18 07:43:51,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778035118] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:43:51,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:43:51,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 07:43:51,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502513063] [2023-02-18 07:43:51,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:43:51,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:43:51,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:51,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:43:51,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:43:51,335 INFO L87 Difference]: Start difference. First operand 254 states and 269 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:43:51,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:51,476 INFO L93 Difference]: Finished difference Result 254 states and 269 transitions. [2023-02-18 07:43:51,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:43:51,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 175 [2023-02-18 07:43:51,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:51,478 INFO L225 Difference]: With dead ends: 254 [2023-02-18 07:43:51,478 INFO L226 Difference]: Without dead ends: 252 [2023-02-18 07:43:51,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:43:51,479 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:51,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 116 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:43:51,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-02-18 07:43:51,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 233. [2023-02-18 07:43:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 221 states have (on average 1.0588235294117647) internal successors, (234), 223 states have internal predecessors, (234), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-18 07:43:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 247 transitions. [2023-02-18 07:43:51,523 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 247 transitions. Word has length 175 [2023-02-18 07:43:51,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:51,524 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 247 transitions. [2023-02-18 07:43:51,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:43:51,524 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 247 transitions. [2023-02-18 07:43:51,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-02-18 07:43:51,525 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:51,525 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:51,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:51,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:51,734 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:43:51,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:51,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1831634198, now seen corresponding path program 1 times [2023-02-18 07:43:51,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:51,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958537780] [2023-02-18 07:43:51,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:51,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:51,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:51,742 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:51,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-02-18 07:43:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:51,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-18 07:43:51,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:51,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-02-18 07:43:51,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:43:51,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:51,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958537780] [2023-02-18 07:43:51,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958537780] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:43:51,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:43:51,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-18 07:43:51,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299713243] [2023-02-18 07:43:51,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:43:51,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 07:43:51,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:51,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 07:43:51,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-02-18 07:43:51,937 INFO L87 Difference]: Start difference. First operand 233 states and 247 transitions. Second operand has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:43:52,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:52,248 INFO L93 Difference]: Finished difference Result 283 states and 298 transitions. [2023-02-18 07:43:52,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 07:43:52,248 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 176 [2023-02-18 07:43:52,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:52,250 INFO L225 Difference]: With dead ends: 283 [2023-02-18 07:43:52,250 INFO L226 Difference]: Without dead ends: 282 [2023-02-18 07:43:52,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-02-18 07:43:52,251 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 100 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:52,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 721 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 07:43:52,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-02-18 07:43:52,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 248. [2023-02-18 07:43:52,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 236 states have (on average 1.0593220338983051) internal successors, (250), 237 states have internal predecessors, (250), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-18 07:43:52,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 263 transitions. [2023-02-18 07:43:52,289 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 263 transitions. Word has length 176 [2023-02-18 07:43:52,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:52,289 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 263 transitions. [2023-02-18 07:43:52,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:43:52,290 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 263 transitions. [2023-02-18 07:43:52,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-02-18 07:43:52,291 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:52,291 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:52,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-02-18 07:43:52,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:52,502 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:43:52,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:52,502 INFO L85 PathProgramCache]: Analyzing trace with hash 2003436096, now seen corresponding path program 1 times [2023-02-18 07:43:52,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:52,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125432882] [2023-02-18 07:43:52,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:52,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:52,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:52,504 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:52,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-02-18 07:43:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:52,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-18 07:43:52,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1409 trivial. 0 not checked. [2023-02-18 07:43:52,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:43:52,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1418 trivial. 0 not checked. [2023-02-18 07:43:52,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:52,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125432882] [2023-02-18 07:43:52,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125432882] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 07:43:52,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:43:52,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2023-02-18 07:43:52,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60916028] [2023-02-18 07:43:52,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:43:52,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:43:52,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:52,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:43:52,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-02-18 07:43:52,777 INFO L87 Difference]: Start difference. First operand 248 states and 263 transitions. Second operand has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:43:52,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:52,989 INFO L93 Difference]: Finished difference Result 252 states and 266 transitions. [2023-02-18 07:43:52,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 07:43:52,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 178 [2023-02-18 07:43:52,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:52,990 INFO L225 Difference]: With dead ends: 252 [2023-02-18 07:43:52,991 INFO L226 Difference]: Without dead ends: 250 [2023-02-18 07:43:52,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 342 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-02-18 07:43:52,991 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 10 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:52,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 204 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:43:52,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-02-18 07:43:53,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 231. [2023-02-18 07:43:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 221 states have (on average 1.0497737556561086) internal successors, (232), 221 states have internal predecessors, (232), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-18 07:43:53,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 245 transitions. [2023-02-18 07:43:53,028 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 245 transitions. Word has length 178 [2023-02-18 07:43:53,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:53,028 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 245 transitions. [2023-02-18 07:43:53,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:43:53,028 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 245 transitions. [2023-02-18 07:43:53,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-02-18 07:43:53,029 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:53,030 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:53,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2023-02-18 07:43:53,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:53,240 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:43:53,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:53,240 INFO L85 PathProgramCache]: Analyzing trace with hash 552879231, now seen corresponding path program 1 times [2023-02-18 07:43:53,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:53,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349543804] [2023-02-18 07:43:53,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:53,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:53,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:53,242 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:53,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-02-18 07:43:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:53,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 07:43:53,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:53,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-02-18 07:43:53,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:43:53,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:53,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349543804] [2023-02-18 07:43:53,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349543804] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:43:53,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:43:53,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-18 07:43:53,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777849341] [2023-02-18 07:43:53,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:43:53,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 07:43:53,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:53,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 07:43:53,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2023-02-18 07:43:53,444 INFO L87 Difference]: Start difference. First operand 231 states and 245 transitions. Second operand has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:43:53,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:53,825 INFO L93 Difference]: Finished difference Result 277 states and 292 transitions. [2023-02-18 07:43:53,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 07:43:53,826 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 182 [2023-02-18 07:43:53,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:53,826 INFO L225 Difference]: With dead ends: 277 [2023-02-18 07:43:53,827 INFO L226 Difference]: Without dead ends: 251 [2023-02-18 07:43:53,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2023-02-18 07:43:53,827 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 62 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:53,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 693 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 07:43:53,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-02-18 07:43:53,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 231. [2023-02-18 07:43:53,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 221 states have (on average 1.0497737556561086) internal successors, (232), 221 states have internal predecessors, (232), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-18 07:43:53,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 244 transitions. [2023-02-18 07:43:53,856 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 244 transitions. Word has length 182 [2023-02-18 07:43:53,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:53,857 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 244 transitions. [2023-02-18 07:43:53,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:43:53,857 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 244 transitions. [2023-02-18 07:43:53,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2023-02-18 07:43:53,858 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:53,858 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:53,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2023-02-18 07:43:54,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:54,069 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:43:54,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:54,070 INFO L85 PathProgramCache]: Analyzing trace with hash -500843991, now seen corresponding path program 1 times [2023-02-18 07:43:54,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:54,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794725616] [2023-02-18 07:43:54,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:54,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:54,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:54,074 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:54,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-02-18 07:43:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:54,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 07:43:54,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1418 trivial. 0 not checked. [2023-02-18 07:43:54,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:43:54,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:54,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794725616] [2023-02-18 07:43:54,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794725616] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:43:54,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:43:54,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 07:43:54,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98240535] [2023-02-18 07:43:54,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:43:54,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:43:54,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:54,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:43:54,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:43:54,197 INFO L87 Difference]: Start difference. First operand 231 states and 244 transitions. Second operand has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:43:54,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:54,296 INFO L93 Difference]: Finished difference Result 235 states and 247 transitions. [2023-02-18 07:43:54,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:43:54,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 184 [2023-02-18 07:43:54,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:54,298 INFO L225 Difference]: With dead ends: 235 [2023-02-18 07:43:54,298 INFO L226 Difference]: Without dead ends: 231 [2023-02-18 07:43:54,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:43:54,298 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:54,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 154 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:43:54,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-02-18 07:43:54,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2023-02-18 07:43:54,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 221 states have (on average 1.0452488687782806) internal successors, (231), 221 states have internal predecessors, (231), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-18 07:43:54,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 243 transitions. [2023-02-18 07:43:54,331 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 243 transitions. Word has length 184 [2023-02-18 07:43:54,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:54,332 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 243 transitions. [2023-02-18 07:43:54,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:43:54,332 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 243 transitions. [2023-02-18 07:43:54,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2023-02-18 07:43:54,333 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:43:54,333 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:54,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2023-02-18 07:43:54,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:54,544 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-18 07:43:54,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:43:54,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1118208338, now seen corresponding path program 1 times [2023-02-18 07:43:54,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:43:54,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766009589] [2023-02-18 07:43:54,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:43:54,546 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:54,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:43:54,547 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:43:54,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-02-18 07:43:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:43:54,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 07:43:54,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:54,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1418 trivial. 0 not checked. [2023-02-18 07:43:54,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:43:54,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:43:54,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766009589] [2023-02-18 07:43:54,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766009589] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:43:54,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:43:54,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 07:43:54,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855492291] [2023-02-18 07:43:54,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:43:54,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:43:54,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:43:54,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:43:54,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:43:54,665 INFO L87 Difference]: Start difference. First operand 231 states and 243 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:43:54,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:43:54,782 INFO L93 Difference]: Finished difference Result 231 states and 243 transitions. [2023-02-18 07:43:54,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 07:43:54,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 188 [2023-02-18 07:43:54,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:43:54,783 INFO L225 Difference]: With dead ends: 231 [2023-02-18 07:43:54,783 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 07:43:54,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:43:54,784 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 9 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:43:54,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 150 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:43:54,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 07:43:54,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 07:43:54,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:43:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 07:43:54,785 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2023-02-18 07:43:54,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:43:54,785 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 07:43:54,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:43:54,785 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 07:43:54,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 07:43:54,788 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2023-02-18 07:43:54,788 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-02-18 07:43:54,788 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-02-18 07:43:54,788 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-02-18 07:43:54,788 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-02-18 07:43:54,788 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-02-18 07:43:54,789 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-02-18 07:43:54,789 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-02-18 07:43:54,789 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2023-02-18 07:43:54,789 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2023-02-18 07:43:54,789 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2023-02-18 07:43:54,789 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-02-18 07:43:54,789 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-02-18 07:43:54,789 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-02-18 07:43:54,789 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-02-18 07:43:54,789 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-02-18 07:43:54,790 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-02-18 07:43:54,790 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-02-18 07:43:54,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2023-02-18 07:43:54,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:43:54,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 07:43:55,033 INFO L899 garLoopResultBuilder]: For program point base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2023-02-18 07:43:55,033 INFO L899 garLoopResultBuilder]: For program point base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-02-18 07:43:55,034 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-02-18 07:43:55,034 INFO L899 garLoopResultBuilder]: For program point L77-1(line 77) no Hoare annotation was computed. [2023-02-18 07:43:55,037 INFO L895 garLoopResultBuilder]: At program point L73(lines 35 75) the Hoare annotation is: (let ((.cse150 (bvadd base2flt_~e (_ bv4294967295 32)))) (let ((.cse151 (bvadd (_ bv4294967295 32) .cse150))) (let ((.cse154 (bvadd (_ bv4294967295 32) .cse151))) (let ((.cse153 (bvadd (_ bv4294967295 32) .cse154))) (let ((.cse155 (bvadd (_ bv4294967295 32) .cse153))) (let ((.cse140 (bvadd (_ bv4294967295 32) .cse155))) (let ((.cse98 (bvadd (_ bv4294967295 32) .cse140))) (let ((.cse101 (bvadd (_ bv4294967295 32) .cse98))) (let ((.cse102 (bvadd (_ bv4294967295 32) .cse101))) (let ((.cse99 (bvadd (_ bv4294967295 32) .cse102))) (let ((.cse100 (bvadd .cse99 (_ bv4294967295 32)))) (let ((.cse103 (bvadd (_ bv4294967295 32) .cse100))) (let ((.cse104 (bvadd (_ bv4294967295 32) .cse103))) (let ((.cse81 (bvadd (_ bv4294967295 32) .cse104))) (let ((.cse161 (bvadd (_ bv4294967295 32) .cse81))) (let ((.cse164 (bvadd (_ bv4294967295 32) .cse161))) (let ((.cse168 (bvshl base2flt_~m (_ bv1 32))) (.cse160 (bvadd (_ bv4294967295 32) .cse164))) (let ((.cse163 (bvadd .cse160 (_ bv4294967295 32))) (.cse171 (bvshl .cse168 (_ bv1 32)))) (let ((.cse172 (bvshl .cse171 (_ bv1 32))) (.cse165 (bvadd (_ bv4294967295 32) .cse163))) (let ((.cse167 (bvadd (_ bv4294967295 32) .cse165)) (.cse170 (bvshl .cse172 (_ bv1 32)))) (let ((.cse169 (bvshl .cse170 (_ bv1 32))) (.cse162 (bvadd .cse167 (_ bv4294967295 32)))) (let ((.cse166 (bvadd (_ bv4294967295 32) .cse162)) (.cse26 (= |base2flt_#in~e| (_ bv0 32))) (.cse144 (bvshl .cse169 (_ bv1 32)))) (let ((.cse53 (not (bvsle base2flt_~e (_ bv4294967168 32)))) (.cse118 (bvult .cse144 (_ bv16777216 32))) (.cse49 (not .cse26)) (.cse157 (bvult .cse172 (_ bv16777216 32))) (.cse158 (bvult .cse171 (_ bv16777216 32))) (.cse156 (bvult .cse170 (_ bv16777216 32))) (.cse119 (bvult .cse169 (_ bv16777216 32))) (.cse159 (bvult .cse168 (_ bv16777216 32))) (.cse152 (not (bvult base2flt_~m (_ bv16777216 32)))) (.cse59 (bvadd (_ bv4294967295 32) .cse166)) (.cse148 ((_ sign_extend 1) .cse150)) (.cse149 ((_ sign_extend 1) base2flt_~e)) (.cse66 (bvadd base2flt_~e (_ bv1 32)))) (let ((.cse2 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|) .cse66))) (.cse47 (not (bvsle .cse66 (_ bv4294967168 32)))) (.cse48 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))) (.cse27 (bvsle (bvadd .cse149 (_ bv128 33)) (_ bv2147483647 33))) (.cse1 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|)))) (.cse12 (bvsle (bvadd ((_ sign_extend 1) .cse151) (_ bv128 33)) (_ bv2147483647 33))) (.cse18 (bvsle (bvadd .cse148 (_ bv128 33)) (_ bv2147483647 33))) (.cse20 (bvsle (bvadd ((_ sign_extend 1) .cse154) (_ bv128 33)) (_ bv2147483647 33))) (.cse4 (bvsle (bvadd ((_ sign_extend 1) .cse155) (_ bv128 33)) (_ bv2147483647 33))) (.cse6 (bvsle (bvadd ((_ sign_extend 1) .cse153) (_ bv128 33)) (_ bv2147483647 33))) (.cse7 (bvsle (bvadd ((_ sign_extend 1) .cse103) (_ bv128 33)) (_ bv2147483647 33))) (.cse10 (bvsle (bvadd ((_ sign_extend 1) .cse102) (_ bv128 33)) (_ bv2147483647 33))) (.cse14 (bvsle (bvadd ((_ sign_extend 1) .cse99) (_ bv128 33)) (_ bv2147483647 33))) (.cse15 (bvsle (bvadd ((_ sign_extend 1) .cse140) (_ bv128 33)) (_ bv2147483647 33))) (.cse19 (bvsle (bvadd ((_ sign_extend 1) .cse100) (_ bv128 33)) (_ bv2147483647 33))) (.cse21 (bvsle (bvadd ((_ sign_extend 1) .cse98) (_ bv128 33)) (_ bv2147483647 33))) (.cse22 (bvsle (bvadd ((_ sign_extend 1) .cse101) (_ bv128 33)) (_ bv2147483647 33))) (.cse3 (bvsle (bvadd ((_ sign_extend 1) .cse167) (_ bv128 33)) (_ bv2147483647 33))) (.cse5 (bvsle (bvadd ((_ sign_extend 1) .cse166) (_ bv128 33)) (_ bv2147483647 33))) (.cse8 (bvsle (bvadd ((_ sign_extend 1) .cse165) (_ bv128 33)) (_ bv2147483647 33))) (.cse9 (bvsle (bvadd ((_ sign_extend 1) .cse164) (_ bv128 33)) (_ bv2147483647 33))) (.cse11 (bvsle (bvadd ((_ sign_extend 1) .cse163) (_ bv128 33)) (_ bv2147483647 33))) (.cse13 (bvsle (bvadd ((_ sign_extend 1) .cse81) (_ bv128 33)) (_ bv2147483647 33))) (.cse16 (bvsle (bvadd ((_ sign_extend 1) .cse162) (_ bv128 33)) (_ bv2147483647 33))) (.cse17 (bvsle (bvadd ((_ sign_extend 1) .cse59) (_ bv128 33)) (_ bv2147483647 33))) (.cse24 (bvsle (bvadd ((_ sign_extend 1) .cse161) (_ bv128 33)) (_ bv2147483647 33))) (.cse25 (bvsle (bvadd ((_ sign_extend 1) .cse160) (_ bv128 33)) (_ bv2147483647 33))) (.cse28 (bvsle (bvadd ((_ sign_extend 1) .cse104) (_ bv128 33)) (_ bv2147483647 33))) (.cse41 (or .cse159 .cse152)) (.cse37 (or (not .cse156) .cse119)) (.cse39 (or (not .cse159) .cse158)) (.cse43 (or (not .cse158) .cse157)) (.cse44 (or .cse156 (not .cse157))) (.cse31 (or (not (bvsle .cse155 (_ bv4294967168 32))) .cse49)) (.cse32 (or (not (bvsle .cse154 (_ bv4294967168 32))) .cse49)) (.cse34 (or (not (bvsle .cse153 (_ bv4294967168 32))) .cse49)) (.cse42 (or .cse118 .cse152)) (.cse29 (or .cse49 (not (bvsle .cse151 (_ bv4294967168 32))))) (.cse30 (or .cse53 .cse49)) (.cse33 (or (not (bvsle .cse150 (_ bv4294967168 32))) .cse49)) (.cse45 (bvsle (_ bv6442450944 33) (bvadd (_ bv8589934591 33) .cse149))) (.cse46 (bvsle (_ bv6442450944 33) (bvadd .cse148 (_ bv8589934591 33)))) (.cse0 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|))))) (.cse50 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) (and (let ((.cse40 (= |base2flt_#in~m| (_ bv1 32)))) (or .cse0 (and .cse1 .cse2 (let ((.cse23 (let ((.cse38 (or (and .cse45 .cse40 .cse26) (and .cse45 .cse40 .cse46 .cse26)))) (let ((.cse35 (and .cse38 .cse40 .cse41 .cse42)) (.cse36 (and .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44))) (or (and .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 (or .cse35 .cse36)) .cse35 .cse36))))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse23 .cse26 (= base2flt_~e (bvadd (_ bv4294967295 32) (bvadd (bvadd (bvadd (_ bv4294967295 32) (_ bv4294967276 32)) (_ bv4294967295 32)) (_ bv4294967295 32))))))) .cse47 .cse48) .cse49 (not .cse40) .cse50)) (let ((.cse60 (bvadd (_ bv4294967295 32) |base2flt_#in~e|))) (let ((.cse56 (bvsle (_ bv6442450944 33) (bvadd ((_ sign_extend 1) .cse60) (_ bv8589934591 33))))) (let ((.cse57 (let ((.cse139 (bvshl .cse144 (_ bv1 32)))) (let ((.cse142 (bvshl .cse139 (_ bv1 32)))) (let ((.cse143 (bvshl .cse142 (_ bv1 32)))) (let ((.cse136 (bvshl .cse143 (_ bv1 32)))) (let ((.cse137 (bvshl .cse136 (_ bv1 32)))) (let ((.cse141 (bvadd (bvadd (_ bv4294967293 32) |base2flt_#in~e|) (_ bv4294967295 32))) (.cse138 (bvshl .cse137 (_ bv1 32)))) (let ((.cse115 (bvshl .cse138 (_ bv1 32))) (.cse97 (bvadd .cse141 (_ bv4294967295 32))) (.cse92 (bvadd (_ bv1 32) .cse66))) (let ((.cse117 (bvult .cse143 (_ bv16777216 32))) (.cse120 (bvult .cse142 (_ bv16777216 32))) (.cse78 (= (bvadd .cse92 (_ bv1 32)) |base2flt_#in~e|)) (.cse84 (= |base2flt_#in~e| .cse92)) (.cse82 (= base2flt_~e .cse141)) (.cse87 (= base2flt_~e .cse97)) (.cse85 (= |base2flt_#in~e| .cse66)) (.cse70 (or (not (bvsle .cse140 (_ bv4294967168 32))) .cse49)) (.cse96 (= base2flt_~e |base2flt_#in~e|)) (.cse121 (bvult .cse139 (_ bv16777216 32))) (.cse114 (bvult .cse115 (_ bv16777216 32))) (.cse134 (bvult .cse138 (_ bv16777216 32))) (.cse135 (bvult .cse137 (_ bv16777216 32))) (.cse116 (bvult .cse136 (_ bv16777216 32)))) (let ((.cse107 (or .cse135 (not .cse116))) (.cse112 (or .cse134 (not .cse135))) (.cse113 (or (not .cse134) .cse114)) (.cse106 (or (not .cse118) .cse121)) (.cse105 (let ((.cse123 (and .cse56 .cse46)) (.cse125 (and .cse56 .cse45)) (.cse132 (and .cse56 .cse45 .cse46))) (let ((.cse133 (or .cse123 .cse125 .cse132))) (let ((.cse124 (and .cse30 .cse33 .cse133)) (.cse127 (and .cse30 .cse133)) (.cse128 (and (= .cse60 .cse66) .cse133)) (.cse129 (and .cse96 .cse133)) (.cse130 (and (= base2flt_~e .cse60) .cse133)) (.cse131 (and .cse29 .cse30 .cse33 .cse133))) (let ((.cse126 (and .cse42 (or .cse123 .cse124 .cse125 .cse127 .cse128 .cse129 .cse130 .cse131 .cse132)))) (let ((.cse122 (or .cse123 .cse124 .cse125 .cse126 .cse127 .cse128 .cse129 .cse130 .cse131 .cse132))) (or (and .cse29 .cse30 .cse33 .cse122) .cse123 .cse124 (and .cse30 .cse122) (and .cse122 .cse78) (and .cse122 .cse96) .cse125 (and .cse84 .cse122) .cse126 .cse127 (and .cse122 .cse82) (and .cse122 .cse87) (and .cse122 .cse85) .cse128 .cse129 (and .cse29 .cse30 .cse32 .cse33 .cse122) .cse130 (and .cse29 .cse30 .cse31 .cse32 .cse33 .cse122 .cse34) .cse131 .cse132 (and .cse29 .cse30 .cse70 .cse31 .cse32 .cse33 .cse122 .cse34) (and .cse29 .cse30 .cse32 .cse33 .cse122 .cse34) (and .cse30 .cse33 .cse122) (and .cse122 (= .cse97 .cse66))))))))) (.cse108 (or .cse120 (not .cse121))) (.cse109 (or .cse117 (not .cse120))) (.cse110 (or .cse118 (not .cse119))) (.cse111 (or .cse116 (not .cse117)))) (let ((.cse61 (and .cse37 .cse106 .cse39 .cse105 .cse108 .cse43 .cse109 .cse110 .cse44 .cse111)) (.cse62 (and .cse39 .cse105 .cse43)) (.cse67 (and .cse39 .cse105 .cse43 .cse44)) (.cse76 (and .cse39 .cse105)) (.cse79 (and .cse37 .cse106 .cse39 .cse105 .cse43 .cse110 .cse44)) (.cse80 (and .cse37 .cse106 .cse39 .cse105 .cse108 .cse43 .cse109 .cse110 .cse44)) (.cse83 (and .cse37 .cse106 .cse39 .cse105 .cse108 .cse43 .cse110 .cse44)) (.cse86 (and .cse37 .cse106 .cse107 .cse39 .cse105 (or (not .cse114) (bvult (bvshl .cse115 (_ bv1 32)) (_ bv16777216 32))) .cse108 .cse43 .cse109 .cse112 .cse110 .cse44 .cse111 .cse113)) (.cse88 (and .cse37 .cse39 .cse105 .cse43 .cse110 .cse44)) (.cse90 (and .cse37 .cse106 .cse107 .cse39 .cse105 .cse108 .cse43 .cse109 .cse112 .cse110 .cse44 .cse111)) (.cse91 (and .cse41 .cse105)) (.cse93 (and .cse37 .cse106 .cse107 .cse39 .cse105 .cse108 .cse43 .cse109 .cse112 .cse110 .cse44 .cse111 .cse113)) (.cse94 (and .cse37 .cse106 .cse107 .cse39 .cse105 .cse108 .cse43 .cse109 .cse110 .cse44 .cse111)) (.cse95 (and .cse37 .cse39 .cse105 .cse43 .cse44)) (.cse77 (bvadd (bvadd (_ bv4294967289 32) |base2flt_#in~e|) (_ bv4294967295 32)))) (let ((.cse64 (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967285 32) |base2flt_#in~e|))) (.cse73 (or (not (bvsle .cse104 (_ bv4294967168 32))) .cse49)) (.cse74 (or (not (bvsle .cse103 (_ bv4294967168 32))) .cse49)) (.cse68 (or (not (bvsle .cse102 (_ bv4294967168 32))) .cse49)) (.cse69 (or (not (bvsle .cse101 (_ bv4294967168 32))) .cse49)) (.cse71 (or (not (bvsle .cse100 (_ bv4294967168 32))) .cse49)) (.cse72 (or (not (bvsle .cse99 (_ bv4294967168 32))) .cse49)) (.cse75 (or (not (bvsle .cse98 (_ bv4294967168 32))) .cse49)) (.cse65 (bvadd (_ bv4294967295 32) .cse77)) (.cse89 (bvadd (_ bv4294967295 32) .cse97)) (.cse63 (or .cse61 .cse62 .cse67 .cse76 .cse79 .cse80 .cse83 .cse86 .cse88 .cse90 .cse91 .cse93 .cse94 .cse95))) (or .cse61 .cse62 (and .cse63 (= base2flt_~e (bvadd (_ bv4294967295 32) (bvadd |base2flt_#in~e| (_ bv4294967283 32))))) (and .cse63 (= base2flt_~e .cse64)) (and .cse63 (= .cse65 .cse66)) .cse67 (and .cse63 .cse68 .cse29 .cse30 .cse69 .cse70 .cse31 .cse32 .cse33 .cse71 .cse72 .cse73 .cse74 .cse34 .cse75) .cse76 (and .cse63 (= base2flt_~e .cse77)) (and .cse63 .cse68 .cse29 .cse30 .cse69 .cse70 .cse31 .cse32 .cse33 .cse72 .cse34 .cse75) (and .cse63 (= .cse66 .cse64)) (and .cse63 .cse29 .cse30 .cse32 .cse33) (and .cse63 .cse78) (and .cse63 .cse29 .cse30 .cse33) (and .cse63 .cse30 .cse33) .cse79 .cse80 (and .cse63 .cse68 .cse29 .cse30 (or (not (bvsle .cse81 (_ bv4294967168 32))) .cse49) .cse69 .cse70 .cse31 .cse32 .cse33 .cse71 .cse72 .cse73 .cse74 .cse34 .cse75) (and .cse63 .cse82) (and .cse63 .cse68 .cse29 .cse30 .cse69 .cse70 .cse31 .cse32 .cse33 .cse71 .cse72 .cse74 .cse34 .cse75) .cse83 (and .cse63 .cse68 .cse29 .cse30 .cse69 .cse70 .cse31 .cse32 .cse33 .cse34 .cse75) (and .cse63 (= base2flt_~e .cse65)) (and .cse63 .cse84) (and .cse63 .cse85) (and .cse63 .cse29 .cse30 .cse69 .cse70 .cse31 .cse32 .cse33 .cse34 .cse75) (and .cse63 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) .cse86 (and .cse63 .cse29 .cse30 .cse70 .cse31 .cse32 .cse33 .cse34 .cse75) (and .cse63 .cse30) (and .cse63 .cse87) .cse88 (and .cse63 (= .cse89 .cse66)) .cse90 (and .cse63 .cse68 .cse29 .cse30 .cse69 .cse70 .cse31 .cse32 .cse33 .cse71 .cse72 .cse34 .cse75) .cse91 (and .cse63 .cse29 .cse30 .cse32 .cse33 .cse34) (and .cse63 (= .cse65 .cse92)) .cse93 (and .cse63 (= base2flt_~e .cse89)) .cse94 (and .cse63 .cse29 .cse30 .cse70 .cse31 .cse32 .cse33 .cse34) .cse95 (and .cse63 .cse96)))))))))))))) (.cse55 (bvsle (bvadd ((_ sign_extend 1) (bvadd (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) .cse60)))))) (_ bv4294967295 32))) (_ bv4294967295 32)))))) (_ bv4294967295 32)))) (_ bv4294967295 32)))))) (_ bv4294967295 32)) (_ bv4294967295 32))) (_ bv128 33)) (_ bv2147483647 33)))) (let ((.cse51 (let ((.cse58 (bvsle (bvadd ((_ sign_extend 1) (bvadd .cse59 (_ bv4294967295 32))) (_ bv128 33)) (_ bv2147483647 33)))) (or (and .cse3 .cse5 .cse8 .cse57 .cse16 .cse17 .cse55) (and .cse5 .cse57 .cse16 .cse17 .cse55) (and .cse57 .cse17 .cse55) (and .cse3 .cse5 .cse7 .cse8 .cse9 .cse11 .cse57 .cse13 .cse16 .cse17 .cse24 .cse25 .cse55 .cse28) (and .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse57 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22 .cse24 .cse25 .cse55 .cse28) (and .cse3 .cse5 .cse7 .cse8 .cse9 .cse11 .cse57 .cse13 .cse16 .cse17 .cse19 .cse24 .cse25 .cse55 .cse28) (and .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse57 .cse13 .cse14 .cse16 .cse17 .cse19 .cse22 .cse24 .cse25 .cse55 .cse28) (and .cse3 .cse5 .cse7 .cse8 .cse9 .cse11 .cse57 .cse13 .cse14 .cse16 .cse17 .cse19 .cse24 .cse25 .cse55 .cse28) (and .cse3 .cse5 .cse8 .cse11 .cse57 .cse16 .cse17 .cse55) (and .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse57 .cse13 .cse14 .cse16 .cse17 .cse19 .cse21 .cse22 .cse24 .cse25 .cse55 .cse28) (and .cse3 .cse5 .cse8 .cse11 .cse57 .cse16 .cse17 .cse25 .cse55) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse57 .cse12 .cse13 .cse14 .cse58 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse55 .cse28) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse57 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse55 .cse28) (and .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse57 .cse13 .cse14 .cse16 .cse17 .cse19 .cse24 .cse25 .cse55 .cse28) (and .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse57 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22 .cse24 .cse25 .cse55 .cse28) (and .cse5 .cse57 .cse17 .cse55) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse57 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse55 .cse28) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse57 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse55 .cse28) (and .cse3 .cse5 .cse8 .cse9 .cse11 .cse57 .cse16 .cse17 .cse24 .cse25 .cse55) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse57 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22 .cse24 .cse25 .cse55 .cse28) (and .cse3 .cse5 .cse8 .cse9 .cse11 .cse57 .cse13 .cse16 .cse17 .cse24 .cse25 .cse55) (and .cse3 .cse5 .cse57 .cse16 .cse17 .cse55) (and .cse3 .cse5 .cse8 .cse9 .cse11 .cse57 .cse16 .cse17 .cse25 .cse55) (and .cse3 .cse5 .cse8 .cse9 .cse11 .cse57 .cse13 .cse16 .cse17 .cse24 .cse25 .cse55 .cse28) (and .cse57 .cse58 .cse55))))) (let ((.cse54 (or (and .cse3 .cse4 .cse1 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse57 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse55 .cse27 .cse28) (and (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|))) .cse1 .cse51))) (.cse52 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|))))) (or (and .cse1 .cse51 .cse52 .cse53 .cse48) (and .cse2 .cse54 .cse47 .cse48) .cse0 (not .cse55) (and .cse1 .cse2 .cse51 .cse47 .cse48) (not .cse56) (and .cse54 .cse52 .cse48) .cse50)))))) (let ((.cse145 (bvshl (bvshl |base2flt_#in~m| (_ bv1 32)) (_ bv1 32)))) (let ((.cse146 (bvshl (bvshl (bvshl (bvshl .cse145 (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)))) (or (not (bvult .cse145 (_ bv16777216 32))) (and (not (bvult .cse146 (_ bv16777216 32))) (bvult |base2flt_#in~m| (_ bv16777216 32))) .cse0 (not (= |base2flt_#in~m| (_ bv0 32))) .cse49 (let ((.cse147 (bvshl (bvshl (bvshl (bvshl (bvshl (bvshl (bvshl .cse146 (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)))) (and (bvult .cse147 (_ bv16777216 32)) (not (bvult (bvshl .cse147 (_ bv1 32)) (_ bv16777216 32))))) .cse50)))))))))))))))))))))))))))) [2023-02-18 07:43:55,039 INFO L895 garLoopResultBuilder]: At program point L57-2(lines 57 72) the Hoare annotation is: (let ((.cse0 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|))))) (.cse34 (not (= |base2flt_#in~e| (_ bv0 32)))) (.cse8 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) (and (let ((.cse91 (bvadd (_ bv4294967295 32) |base2flt_#in~e|))) (let ((.cse6 (bvsle (bvadd ((_ sign_extend 1) (bvadd (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) .cse91)))))) (_ bv4294967295 32))) (_ bv4294967295 32)))))) (_ bv4294967295 32)))) (_ bv4294967295 32)))))) (_ bv4294967295 32)) (_ bv4294967295 32))) (_ bv128 33)) (_ bv2147483647 33))) (.cse7 (bvsle (_ bv6442450944 33) (bvadd ((_ sign_extend 1) .cse91) (_ bv8589934591 33)))) (.cse5 (not (bvsle base2flt_~e (_ bv4294967168 32))))) (let ((.cse1 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|)))) (.cse2 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))) (.cse3 (let ((.cse90 (bvadd base2flt_~e (_ bv4294967295 32)))) (let ((.cse18 (bvadd (_ bv4294967295 32) .cse90))) (let ((.cse28 (bvadd (_ bv4294967295 32) .cse18))) (let ((.cse12 (bvadd (_ bv4294967295 32) .cse28))) (let ((.cse10 (bvadd (_ bv4294967295 32) .cse12))) (let ((.cse23 (bvadd (_ bv4294967295 32) .cse10))) (let ((.cse29 (bvadd (_ bv4294967295 32) .cse23))) (let ((.cse30 (bvadd (_ bv4294967295 32) .cse29))) (let ((.cse16 (bvadd (_ bv4294967295 32) .cse30))) (let ((.cse21 (bvadd (_ bv4294967295 32) .cse16))) (let ((.cse27 (bvadd .cse21 (_ bv4294967295 32)))) (let ((.cse13 (bvadd (_ bv4294967295 32) .cse27))) (let ((.cse33 (bvadd (_ bv4294967295 32) .cse13))) (let ((.cse19 (bvadd (_ bv4294967295 32) .cse33))) (let ((.cse31 (bvadd (_ bv4294967295 32) .cse19))) (let ((.cse15 (bvadd (_ bv4294967295 32) .cse31))) (let ((.cse32 (bvadd (_ bv4294967295 32) .cse15))) (let ((.cse17 (bvadd .cse32 (_ bv4294967295 32)))) (let ((.cse14 (bvadd (_ bv4294967295 32) .cse17))) (let ((.cse9 (bvadd (_ bv4294967295 32) .cse14))) (let ((.cse24 (bvadd .cse9 (_ bv4294967295 32)))) (let ((.cse11 (bvadd (_ bv4294967295 32) .cse24))) (let ((.cse25 (bvadd (_ bv4294967295 32) .cse11)) (.cse26 ((_ sign_extend 1) .cse90))) (let ((.cse20 (let ((.cse37 (or (not (bvsle .cse23 (_ bv4294967168 32))) .cse34)) (.cse38 (or (not (bvsle .cse10 (_ bv4294967168 32))) .cse34)) (.cse39 (or (not (bvsle .cse28 (_ bv4294967168 32))) .cse34)) (.cse42 (or (not (bvsle .cse12 (_ bv4294967168 32))) .cse34)) (.cse35 (or .cse34 (not (bvsle .cse18 (_ bv4294967168 32))))) (.cse36 (or .cse5 .cse34)) (.cse41 (or (not (bvsle .cse90 (_ bv4294967168 32))) .cse34)) (.cse43 (= base2flt_~e |base2flt_#in~e|))) (let ((.cse40 (let ((.cse86 (bvshl base2flt_~m (_ bv1 32)))) (let ((.cse85 (bvshl .cse86 (_ bv1 32)))) (let ((.cse88 (bvshl .cse85 (_ bv1 32)))) (let ((.cse82 (bvshl .cse88 (_ bv1 32)))) (let ((.cse81 (bvshl .cse82 (_ bv1 32)))) (let ((.cse84 (bvshl .cse81 (_ bv1 32)))) (let ((.cse83 (bvshl .cse84 (_ bv1 32)))) (let ((.cse87 (bvshl .cse83 (_ bv1 32)))) (let ((.cse89 (bvshl .cse87 (_ bv1 32)))) (let ((.cse80 (bvshl .cse89 (_ bv1 32)))) (let ((.cse78 (bvshl .cse80 (_ bv1 32)))) (let ((.cse79 (bvshl .cse78 (_ bv1 32)))) (let ((.cse58 (bvshl .cse79 (_ bv1 32)))) (let ((.cse60 (not (bvult base2flt_~m (_ bv16777216 32)))) (.cse62 (bvult .cse89 (_ bv16777216 32))) (.cse64 (bvult .cse88 (_ bv16777216 32))) (.cse73 (bvult .cse87 (_ bv16777216 32))) (.cse59 (bvult .cse86 (_ bv16777216 32))) (.cse74 (bvult .cse85 (_ bv16777216 32))) (.cse65 (bvult .cse84 (_ bv16777216 32))) (.cse75 (bvult .cse83 (_ bv16777216 32))) (.cse63 (bvult .cse82 (_ bv16777216 32))) (.cse66 (bvult .cse81 (_ bv16777216 32))) (.cse61 (bvult .cse80 (_ bv16777216 32))) (.cse57 (bvult .cse58 (_ bv16777216 32))) (.cse77 (bvult .cse79 (_ bv16777216 32))) (.cse76 (bvult .cse78 (_ bv16777216 32)))) (let ((.cse52 (or .cse77 (not .cse76))) (.cse56 (or (not .cse77) .cse57)) (.cse46 (or .cse76 (not .cse61))) (.cse44 (or (not .cse63) .cse66)) (.cse45 (or (not .cse65) .cse75)) (.cse47 (or (not .cse59) .cse74)) (.cse48 (or .cse73 (not .cse75))) (.cse49 (or (not .cse74) .cse64)) (.cse50 (or .cse62 (not .cse73))) (.cse51 (let ((.cse67 (let ((.cse70 (let ((.cse72 (bvsle (_ bv6442450944 33) (bvadd (_ bv8589934591 33) ((_ sign_extend 1) base2flt_~e)))) (.cse71 (bvsle (_ bv6442450944 33) (bvadd .cse26 (_ bv8589934591 33))))) (or (and .cse7 .cse71) (and .cse7 .cse72) (and .cse7 .cse72 .cse71))))) (let ((.cse68 (and .cse43 .cse70)) (.cse69 (and .cse35 .cse36 .cse41 .cse70))) (or .cse68 .cse69 (and (or .cse68 .cse69) (or .cse65 .cse60))))))) (or (and .cse43 .cse67) (and .cse35 .cse36 .cse37 .cse38 .cse39 .cse41 .cse42 .cse67)))) (.cse53 (or .cse65 (not .cse66))) (.cse54 (or .cse63 (not .cse64))) (.cse55 (or .cse61 (not .cse62)))) (or (and .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56) (and .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55) (and .cse44 .cse47 .cse49 .cse51 .cse53 .cse54) (and .cse47 .cse49 .cse51) (and .cse44 .cse45 .cse46 .cse47 (or (not .cse57) (bvult (bvshl .cse58 (_ bv1 32)) (_ bv16777216 32))) .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56) (and .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse53 .cse54 .cse55) (and .cse44 .cse45 .cse47 .cse48 .cse49 .cse50 .cse51 .cse53 .cse54) (and .cse44 .cse47 .cse49 .cse51 .cse54) (and (or .cse59 .cse60) .cse51) (and .cse44 .cse45 .cse47 .cse48 .cse49 .cse51 .cse53 .cse54) (and .cse47 .cse51) (and .cse44 .cse45 .cse47 .cse49 .cse51 .cse53 .cse54) (and .cse47 .cse49 .cse51 .cse54) (and .cse44 .cse45 .cse47 .cse48 .cse49 .cse50 .cse51 .cse53 .cse54 .cse55))))))))))))))))))) (or (and (or (not (bvsle .cse16 (_ bv4294967168 32))) .cse34) .cse35 .cse36 (or (not (bvsle .cse19 (_ bv4294967168 32))) .cse34) (or (not (bvsle .cse30 (_ bv4294967168 32))) .cse34) .cse37 .cse38 .cse39 .cse40 .cse41 (or (not (bvsle .cse27 (_ bv4294967168 32))) .cse34) (or (not (bvsle .cse21 (_ bv4294967168 32))) .cse34) (or (not (bvsle .cse33 (_ bv4294967168 32))) .cse34) (or (not (bvsle .cse13 (_ bv4294967168 32))) .cse34) .cse42 (or (not (bvsle .cse29 (_ bv4294967168 32))) .cse34)) (and .cse40 .cse43))))) (.cse22 (bvsle (bvadd ((_ sign_extend 1) (bvadd .cse25 (_ bv4294967295 32))) (_ bv128 33)) (_ bv2147483647 33)))) (or (and (bvsle (bvadd ((_ sign_extend 1) .cse9) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse10) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse11) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse12) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse13) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse14) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse15) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse16) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse17) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse18) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse19) (_ bv128 33)) (_ bv2147483647 33)) .cse20 (bvsle (bvadd ((_ sign_extend 1) .cse21) (_ bv128 33)) (_ bv2147483647 33)) .cse22 (bvsle (bvadd ((_ sign_extend 1) .cse23) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse24) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse25) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd .cse26 (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse27) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse28) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse29) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse30) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse31) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse32) (_ bv128 33)) (_ bv2147483647 33)) .cse6 (bvsle (bvadd ((_ sign_extend 1) .cse33) (_ bv128 33)) (_ bv2147483647 33))) (and .cse20 .cse22 .cse6))))))))))))))))))))))))))) (.cse4 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|))))) (or .cse0 (and (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|))) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse3 .cse4) (not .cse6) (not .cse7) .cse8)))) (let ((.cse92 (bvshl (bvshl |base2flt_#in~m| (_ bv1 32)) (_ bv1 32)))) (let ((.cse93 (bvshl (bvshl (bvshl (bvshl .cse92 (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)))) (or (not (bvult .cse92 (_ bv16777216 32))) (and (not (bvult .cse93 (_ bv16777216 32))) (bvult |base2flt_#in~m| (_ bv16777216 32))) .cse0 (not (= |base2flt_#in~m| (_ bv0 32))) .cse34 (let ((.cse94 (bvshl (bvshl (bvshl (bvshl (bvshl (bvshl (bvshl .cse93 (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)))) (and (bvult .cse94 (_ bv16777216 32)) (not (bvult (bvshl .cse94 (_ bv1 32)) (_ bv16777216 32))))) .cse8))) (or .cse0 .cse34 (not (= |base2flt_#in~m| (_ bv1 32))) .cse8))) [2023-02-18 07:43:55,040 INFO L899 garLoopResultBuilder]: For program point base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 77) no Hoare annotation was computed. [2023-02-18 07:43:55,040 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2023-02-18 07:43:55,040 INFO L899 garLoopResultBuilder]: For program point L45-1(line 45) no Hoare annotation was computed. [2023-02-18 07:43:55,040 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-02-18 07:43:55,040 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2023-02-18 07:43:55,040 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 34) no Hoare annotation was computed. [2023-02-18 07:43:55,041 INFO L899 garLoopResultBuilder]: For program point L58(lines 57 72) no Hoare annotation was computed. [2023-02-18 07:43:55,041 INFO L899 garLoopResultBuilder]: For program point base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-02-18 07:43:55,043 INFO L895 garLoopResultBuilder]: At program point L79(lines 28 81) the Hoare annotation is: (let ((.cse249 (bvadd base2flt_~e (_ bv4294967295 32)))) (let ((.cse250 (bvadd (_ bv4294967295 32) .cse249))) (let ((.cse252 (bvadd (_ bv4294967295 32) .cse250))) (let ((.cse251 (bvadd (_ bv4294967295 32) .cse252))) (let ((.cse253 (bvadd (_ bv4294967295 32) .cse251))) (let ((.cse241 (bvadd (_ bv4294967295 32) .cse253))) (let ((.cse222 (bvadd (_ bv4294967295 32) .cse241))) (let ((.cse226 (bvadd (_ bv4294967295 32) .cse222))) (let ((.cse227 (bvadd (_ bv4294967295 32) .cse226))) (let ((.cse224 (bvadd (_ bv4294967295 32) .cse227)) (.cse281 (bvshl base2flt_~m (_ bv1 32)))) (let ((.cse280 (bvshl .cse281 (_ bv1 32))) (.cse225 (bvadd .cse224 (_ bv4294967295 32)))) (let ((.cse223 (bvadd (_ bv4294967295 32) .cse225)) (.cse282 (bvshl .cse280 (_ bv1 32)))) (let ((.cse277 (bvshl .cse282 (_ bv1 32))) (.cse228 (bvadd (_ bv4294967295 32) .cse223))) (let ((.cse207 (bvadd (_ bv4294967295 32) .cse228)) (.cse276 (bvshl .cse277 (_ bv1 32)))) (let ((.cse279 (bvshl .cse276 (_ bv1 32))) (.cse264 (bvadd (_ bv4294967295 32) .cse207))) (let ((.cse267 (bvadd (_ bv4294967295 32) .cse264)) (.cse278 (bvshl .cse279 (_ bv1 32)))) (let ((.cse274 (bvshl .cse278 (_ bv1 32))) (.cse263 (bvadd (_ bv4294967295 32) .cse267))) (let ((.cse266 (bvadd .cse263 (_ bv4294967295 32))) (.cse275 (bvshl .cse274 (_ bv1 32)))) (let ((.cse272 (bvshl .cse275 (_ bv1 32))) (.cse268 (bvadd (_ bv4294967295 32) .cse266))) (let ((.cse270 (bvadd (_ bv4294967295 32) .cse268)) (.cse273 (bvshl .cse272 (_ bv1 32)))) (let ((.cse271 (bvshl .cse273 (_ bv1 32))) (.cse265 (bvadd .cse270 (_ bv4294967295 32)))) (let ((.cse269 (bvadd (_ bv4294967295 32) .cse265)) (.cse261 (bvshl .cse271 (_ bv1 32))) (.cse240 (bvadd (bvadd (_ bv4294967293 32) |base2flt_#in~e|) (_ bv4294967295 32))) (.cse35 (= |base2flt_#in~e| (_ bv0 32)))) (let ((.cse131 (not (bvsle base2flt_~e (_ bv4294967168 32)))) (.cse44 (not .cse35)) (.cse235 (bvadd .cse240 (_ bv4294967295 32))) (.cse229 (bvadd base2flt_~e (_ bv1 32))) (.cse39 (bvult .cse282 (_ bv16777216 32))) (.cse16 (bvult .cse281 (_ bv16777216 32))) (.cse24 (bvult .cse280 (_ bv16777216 32))) (.cse23 (bvult .cse279 (_ bv16777216 32))) (.cse255 (bvult .cse278 (_ bv16777216 32))) (.cse21 (bvult .cse277 (_ bv16777216 32))) (.cse22 (bvult .cse276 (_ bv16777216 32))) (.cse257 (bvult .cse275 (_ bv16777216 32))) (.cse254 (bvult .cse274 (_ bv16777216 32))) (.cse259 (bvult .cse273 (_ bv16777216 32))) (.cse256 (bvult .cse272 (_ bv16777216 32))) (.cse258 (bvult .cse271 (_ bv16777216 32))) (.cse260 (bvult .cse261 (_ bv16777216 32))) (.cse262 (bvadd (_ bv4294967295 32) (bvadd |base2flt_#in~e| (_ bv4294967283 32)))) (.cse245 (bvadd (_ bv4294967295 32) |base2flt_#in~e|)) (.cse248 ((_ sign_extend 1) base2flt_~e)) (.cse247 ((_ sign_extend 1) .cse249)) (.cse135 (bvadd (_ bv4294967295 32) .cse269))) (let ((.cse15 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|)))) (.cse18 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|)))) (.cse65 (bvsle (bvadd ((_ sign_extend 1) .cse270) (_ bv128 33)) (_ bv2147483647 33))) (.cse66 (bvsle (bvadd ((_ sign_extend 1) .cse253) (_ bv128 33)) (_ bv2147483647 33))) (.cse67 (bvsle (bvadd ((_ sign_extend 1) .cse269) (_ bv128 33)) (_ bv2147483647 33))) (.cse68 (bvsle (bvadd ((_ sign_extend 1) .cse251) (_ bv128 33)) (_ bv2147483647 33))) (.cse69 (bvsle (bvadd ((_ sign_extend 1) .cse223) (_ bv128 33)) (_ bv2147483647 33))) (.cse70 (bvsle (bvadd ((_ sign_extend 1) .cse268) (_ bv128 33)) (_ bv2147483647 33))) (.cse71 (bvsle (bvadd ((_ sign_extend 1) .cse267) (_ bv128 33)) (_ bv2147483647 33))) (.cse72 (bvsle (bvadd ((_ sign_extend 1) .cse227) (_ bv128 33)) (_ bv2147483647 33))) (.cse74 (bvsle (bvadd ((_ sign_extend 1) .cse266) (_ bv128 33)) (_ bv2147483647 33))) (.cse75 (bvsle (bvadd ((_ sign_extend 1) .cse250) (_ bv128 33)) (_ bv2147483647 33))) (.cse76 (bvsle (bvadd ((_ sign_extend 1) .cse207) (_ bv128 33)) (_ bv2147483647 33))) (.cse77 (bvsle (bvadd ((_ sign_extend 1) .cse224) (_ bv128 33)) (_ bv2147483647 33))) (.cse78 (bvsle (bvadd ((_ sign_extend 1) .cse241) (_ bv128 33)) (_ bv2147483647 33))) (.cse79 (bvsle (bvadd ((_ sign_extend 1) .cse265) (_ bv128 33)) (_ bv2147483647 33))) (.cse80 (bvsle (bvadd ((_ sign_extend 1) .cse135) (_ bv128 33)) (_ bv2147483647 33))) (.cse81 (bvsle (bvadd .cse247 (_ bv128 33)) (_ bv2147483647 33))) (.cse82 (bvsle (bvadd ((_ sign_extend 1) .cse225) (_ bv128 33)) (_ bv2147483647 33))) (.cse83 (bvsle (bvadd ((_ sign_extend 1) .cse252) (_ bv128 33)) (_ bv2147483647 33))) (.cse84 (bvsle (bvadd ((_ sign_extend 1) .cse222) (_ bv128 33)) (_ bv2147483647 33))) (.cse85 (bvsle (bvadd ((_ sign_extend 1) .cse226) (_ bv128 33)) (_ bv2147483647 33))) (.cse86 (bvsle (bvadd ((_ sign_extend 1) .cse264) (_ bv128 33)) (_ bv2147483647 33))) (.cse87 (bvsle (bvadd ((_ sign_extend 1) .cse263) (_ bv128 33)) (_ bv2147483647 33))) (.cse88 (bvsle (bvadd .cse248 (_ bv128 33)) (_ bv2147483647 33))) (.cse89 (bvsle (bvadd ((_ sign_extend 1) .cse228) (_ bv128 33)) (_ bv2147483647 33))) (.cse129 (bvsle (bvadd ((_ sign_extend 1) (bvadd (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) .cse245)))))) (_ bv4294967295 32))) (_ bv4294967295 32)))))) (_ bv4294967295 32)))) (_ bv4294967295 32)))))) (_ bv4294967295 32)) (_ bv4294967295 32))) (_ bv128 33)) (_ bv2147483647 33))) (.cse60 (bvsle .cse262 (_ bv4294967168 32))) (.cse59 (= base2flt_~e .cse262)) (.cse29 (or (not .cse260) (bvult (bvshl .cse261 (_ bv1 32)) (_ bv16777216 32)))) (.cse43 (or (not .cse258) .cse260)) (.cse19 (or .cse259 (not .cse256))) (.cse34 (or .cse257 (not .cse254))) (.cse36 (or .cse258 (not .cse259))) (.cse42 (or .cse256 (not .cse257))) (.cse14 (or (not .cse21) .cse22)) (.cse17 (or (not .cse23) .cse255)) (.cse20 (or (not .cse16) .cse24)) (.cse30 (or .cse254 (not .cse255))) (.cse31 (or (not .cse24) .cse39)) (.cse37 (or .cse23 (not .cse22))) (.cse38 (or .cse21 (not .cse39))) (.cse57 (bvsle (bvadd (_ bv4294967290 32) |base2flt_#in~e|) (_ bv4294967168 32))) (.cse58 (= .cse235 .cse229)) (.cse101 (or (not (bvsle .cse253 (_ bv4294967168 32))) .cse44)) (.cse102 (or (not (bvsle .cse252 (_ bv4294967168 32))) .cse44)) (.cse104 (or (not (bvsle .cse251 (_ bv4294967168 32))) .cse44)) (.cse118 (not (bvsge base2flt_~e (_ bv127 32)))) (.cse52 (bvsle (bvadd |base2flt_#in~e| (_ bv4294967294 32)) (_ bv4294967168 32))) (.cse99 (or .cse44 (not (bvsle .cse250 (_ bv4294967168 32))))) (.cse103 (or (not (bvsle .cse249 (_ bv4294967168 32))) .cse44)) (.cse50 (= .cse245 .cse229)) (.cse100 (or .cse131 .cse44)) (.cse25 (= base2flt_~e |base2flt_#in~e|)) (.cse33 (bvult base2flt_~m (_ bv16777216 32))) (.cse124 (bvsle (_ bv6442450944 33) (bvadd (_ bv8589934591 33) .cse248))) (.cse128 (bvsle (_ bv6442450944 33) (bvadd ((_ sign_extend 1) .cse245) (_ bv8589934591 33)))) (.cse126 (bvsle (_ bv6442450944 33) (bvadd .cse247 (_ bv8589934591 33))))) (let ((.cse62 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|) .cse229))) (.cse64 (not (bvsle .cse229 (_ bv4294967168 32)))) (.cse130 (let ((.cse132 (let ((.cse133 (let ((.cse140 (and .cse128 .cse126)) (.cse160 (and .cse128 .cse124)) (.cse195 (and .cse128 .cse124 .cse126))) (let ((.cse246 (or .cse140 .cse160 .cse195))) (let ((.cse206 (and .cse246 .cse33)) (.cse213 (and .cse16 .cse24 .cse246 .cse33))) (let ((.cse244 (= base2flt_~e .cse245)) (.cse243 (or .cse140 .cse160 .cse195 .cse206 .cse213))) (let ((.cse143 (and .cse244 .cse243)) (.cse145 (and .cse243 .cse44)) (.cse146 (and .cse243 .cse25 .cse44)) (.cse162 (and .cse100 .cse243)) (.cse173 (and .cse50 .cse243)) (.cse179 (and .cse244 .cse243 .cse44)) (.cse184 (and .cse99 .cse100 .cse103 .cse243)) (.cse199 (and .cse100 .cse103 .cse243)) (.cse204 (and .cse50 .cse243 .cse52)) (.cse205 (and .cse243 .cse25))) (let ((.cse238 (not .cse33)) (.cse242 (or .cse140 .cse143 .cse145 .cse146 .cse160 .cse162 .cse173 .cse179 .cse184 .cse195 .cse199 .cse204 .cse205 .cse206 .cse213))) (let ((.cse177 (and .cse242 .cse33)) (.cse183 (and .cse16 .cse242 .cse21 .cse22 .cse23 .cse24 .cse33 .cse39)) (.cse211 (and .cse242 (or .cse23 .cse238)))) (let ((.cse197 (and .cse118 (or .cse140 .cse143 .cse145 .cse146 .cse160 .cse162 .cse173 .cse177 .cse179 .cse183 .cse184 .cse195 .cse199 .cse204 .cse205 .cse206 .cse211 .cse213))) (.cse234 (bvadd (_ bv1 32) .cse229))) (let ((.cse188 (= |base2flt_#in~e| .cse229)) (.cse150 (or (not (bvsle .cse241 (_ bv4294967168 32))) .cse44)) (.cse157 (= (bvadd .cse234 (_ bv1 32)) |base2flt_#in~e|)) (.cse186 (= base2flt_~e .cse235)) (.cse154 (= |base2flt_#in~e| .cse234)) (.cse239 (or .cse140 .cse143 .cse145 .cse146 .cse160 .cse162 .cse173 .cse177 .cse179 .cse183 .cse184 .cse195 .cse197 .cse199 .cse204 .cse205 .cse206 .cse211 .cse213)) (.cse193 (= base2flt_~e .cse240))) (let ((.cse144 (and .cse239 .cse193)) (.cse159 (and .cse154 .cse239 .cse44)) (.cse161 (and .cse100 .cse103 .cse239)) (.cse163 (and .cse239 .cse186)) (.cse166 (and .cse239 .cse157)) (.cse170 (and .cse239 .cse25)) (.cse174 (and .cse239 .cse186 .cse44)) (.cse176 (and .cse239 .cse157 .cse44)) (.cse180 (and .cse99 .cse100 .cse102 .cse103 .cse239 .cse104)) (.cse182 (and .cse99 .cse100 .cse103 .cse239)) (.cse189 (and .cse99 .cse100 .cse150 .cse101 .cse102 .cse103 .cse239 .cse104)) (.cse191 (and .cse239 .cse58)) (.cse192 (and .cse239 .cse25 .cse44)) (.cse194 (and .cse239 .cse188)) (.cse200 (and .cse99 .cse100 .cse101 .cse102 .cse103 .cse239 .cse104)) (.cse203 (and .cse100 .cse239)) (.cse212 (and .cse239 .cse188 .cse44)) (.cse214 (and .cse57 .cse239 .cse58)) (.cse215 (and .cse99 .cse100 .cse102 .cse103 .cse239)) (.cse217 (and .cse239 .cse193 .cse44)) (.cse218 (and .cse239 .cse44)) (.cse221 (and .cse154 .cse239))) (let ((.cse232 (bvadd (bvadd (_ bv4294967289 32) |base2flt_#in~e|) (_ bv4294967295 32))) (.cse237 (or .cse16 .cse238)) (.cse236 (or .cse140 .cse143 .cse144 .cse145 .cse146 .cse159 .cse160 .cse161 .cse162 .cse163 .cse166 .cse170 .cse173 .cse174 .cse176 .cse177 .cse179 .cse180 .cse182 .cse183 .cse184 .cse189 .cse191 .cse192 .cse194 .cse195 .cse197 .cse199 .cse200 .cse203 .cse204 .cse205 .cse206 .cse211 .cse212 .cse213 .cse214 .cse215 .cse217 .cse218 .cse221))) (let ((.cse136 (and .cse14 .cse17 .cse20 .cse237 .cse236 .cse30 .cse31 .cse37 .cse38)) (.cse139 (and .cse236 .cse33)) (.cse142 (and .cse20 .cse237 .cse236 .cse31)) (.cse147 (and .cse14 .cse17 .cse19 .cse20 .cse237 .cse236 .cse30 .cse31 .cse34 .cse36 .cse37 .cse38 .cse42)) (.cse153 (and .cse14 .cse17 .cse20 .cse237 .cse236 .cse30 .cse31 .cse34 .cse37 .cse38)) (.cse156 (and .cse20 .cse237 .cse236 .cse31 .cse38)) (.cse164 (and .cse14 .cse17 .cse20 .cse237 .cse236 .cse30 .cse31 .cse34 .cse37 .cse38 .cse42)) (.cse165 (and .cse14 .cse17 .cse20 .cse237 .cse236 .cse31 .cse37 .cse38)) (.cse167 (and .cse14 .cse20 .cse237 .cse236 .cse31 .cse38)) (.cse169 (and .cse20 .cse237 .cse236)) (.cse171 (and .cse14 .cse16 .cse17 .cse19 .cse20 .cse236 .cse29 .cse30 .cse31 .cse33 .cse34 .cse36 .cse37 .cse38 .cse42 .cse43)) (.cse175 (and .cse236 .cse34)) (.cse181 (and .cse14 .cse17 .cse19 .cse20 .cse237 .cse236 .cse30 .cse31 .cse34 .cse36 .cse37 .cse38 .cse42 .cse43)) (.cse187 (and .cse14 .cse20 .cse237 .cse236 .cse31 .cse37 .cse38)) (.cse190 (and .cse19 .cse236 .cse29 .cse34 .cse36 .cse42 .cse43)) (.cse198 (and .cse14 .cse17 .cse19 .cse20 .cse237 .cse236 .cse30 .cse31 .cse34 .cse37 .cse38 .cse42)) (.cse201 (and .cse236 .cse34 .cse42)) (.cse202 (and .cse19 .cse236 .cse34 .cse36 .cse42)) (.cse210 (and .cse14 .cse17 .cse19 .cse20 .cse237 .cse236 .cse29 .cse30 .cse31 .cse34 .cse36 .cse37 .cse38 .cse42 .cse43)) (.cse216 (and .cse237 .cse236)) (.cse219 (and .cse19 .cse236 .cse34 .cse42)) (.cse220 (and .cse19 .cse236 .cse34 .cse36 .cse42 .cse43)) (.cse231 (bvadd (_ bv4294967295 32) .cse235)) (.cse230 (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967285 32) |base2flt_#in~e|))) (.cse233 (bvadd (_ bv4294967295 32) .cse232))) (let ((.cse141 (= .cse233 .cse229)) (.cse155 (= .cse233 .cse234)) (.cse172 (= base2flt_~e .cse233)) (.cse185 (= base2flt_~e .cse232)) (.cse138 (= base2flt_~e .cse230)) (.cse168 (= .cse231 .cse229)) (.cse178 (= base2flt_~e .cse231)) (.cse158 (= .cse229 .cse230)) (.cse208 (or (not (bvsle .cse228 (_ bv4294967168 32))) .cse44)) (.cse148 (or (not (bvsle .cse227 (_ bv4294967168 32))) .cse44)) (.cse149 (or (not (bvsle .cse226 (_ bv4294967168 32))) .cse44)) (.cse196 (or (not (bvsle .cse225 (_ bv4294967168 32))) .cse44)) (.cse151 (or (not (bvsle .cse224 (_ bv4294967168 32))) .cse44)) (.cse209 (or (not (bvsle .cse223 (_ bv4294967168 32))) .cse44)) (.cse152 (or (not (bvsle .cse222 (_ bv4294967168 32))) .cse44)) (.cse137 (or .cse136 .cse139 .cse140 .cse142 .cse143 .cse144 .cse145 .cse146 .cse147 .cse153 .cse156 .cse159 .cse160 .cse161 .cse162 .cse163 .cse164 .cse165 .cse166 .cse167 .cse169 .cse170 .cse171 .cse173 .cse174 .cse175 .cse176 .cse177 .cse179 .cse180 .cse181 .cse182 .cse183 .cse184 .cse187 .cse189 .cse190 .cse191 .cse192 .cse194 .cse195 .cse197 .cse198 .cse199 .cse200 .cse201 .cse202 .cse203 .cse204 .cse205 .cse206 .cse210 .cse211 .cse212 .cse213 .cse214 .cse215 .cse216 .cse217 .cse218 .cse219 .cse220 .cse221))) (or .cse136 (and .cse137 .cse138) .cse139 .cse140 (and .cse99 .cse100 .cse102 .cse103 .cse137) (and .cse141 .cse137 .cse44) .cse142 .cse143 .cse144 (and .cse99 .cse100 .cse103 .cse137) .cse145 (and .cse137 .cse44) (and .cse141 .cse137) .cse146 .cse147 (and .cse148 .cse99 .cse100 .cse149 .cse150 .cse101 .cse102 .cse103 .cse151 .cse137 .cse104 .cse152) .cse153 (and .cse154 .cse137) (and .cse155 .cse137) .cse156 (and .cse157 .cse137) (and .cse137 .cse158 .cse44) .cse159 .cse160 .cse161 (and .cse25 .cse137 .cse44) .cse162 .cse163 .cse164 (and .cse100 .cse137) .cse165 .cse166 (and .cse148 .cse99 .cse100 .cse149 .cse150 .cse101 .cse102 .cse103 .cse137 .cse104 .cse152) .cse167 (and .cse59 .cse137 .cse60) (and .cse137 .cse168) .cse169 .cse170 (and .cse99 .cse100 .cse150 .cse101 .cse102 .cse103 .cse137 .cse104 .cse152) .cse171 (and .cse155 .cse137 .cse44) (and .cse172 .cse137) .cse173 .cse174 .cse175 .cse176 .cse177 (and .cse178 .cse137 .cse44) .cse179 .cse180 (and .cse25 .cse137) (and .cse172 .cse137 .cse44) .cse181 .cse182 .cse183 .cse184 (and .cse137 .cse185 .cse44) (and .cse186 .cse137) (and .cse99 .cse100 .cse101 .cse102 .cse103 .cse137 .cse104) .cse187 (and .cse137 .cse188) .cse189 .cse190 (and .cse137 .cse185) (and .cse137 .cse44 .cse138) (and .cse99 .cse100 .cse150 .cse101 .cse102 .cse103 .cse137 .cse104) .cse191 .cse192 (and .cse137 .cse193) .cse194 .cse195 (and .cse137 .cse168 .cse44) (and .cse148 .cse99 .cse100 .cse149 .cse150 .cse101 .cse102 .cse103 .cse196 .cse151 .cse137 .cse104 .cse152) (and .cse99 .cse100 .cse149 .cse150 .cse101 .cse102 .cse103 .cse137 .cse104 .cse152) .cse197 (and .cse99 .cse100 .cse102 .cse103 .cse137 .cse104) .cse198 (and .cse157 .cse137 .cse44) (and .cse154 .cse137 .cse44) .cse199 .cse200 .cse201 .cse202 (and .cse178 .cse137) .cse203 .cse204 .cse205 (and .cse137 .cse158) .cse206 (and .cse148 .cse99 .cse100 (or (not (bvsle .cse207 (_ bv4294967168 32))) .cse44) .cse149 .cse150 .cse101 .cse102 .cse103 .cse196 .cse151 .cse208 .cse137 .cse209 .cse104 .cse152) .cse210 .cse211 (and .cse186 .cse137 .cse44) .cse212 .cse213 (and .cse148 .cse99 .cse100 .cse149 .cse150 .cse101 .cse102 .cse103 .cse196 .cse151 .cse208 .cse137 .cse209 .cse104 .cse152) (and .cse100 .cse103 .cse137) .cse214 .cse215 .cse216 (and .cse148 .cse99 .cse100 .cse149 .cse150 .cse101 .cse102 .cse103 .cse196 .cse151 .cse137 .cse209 .cse104 .cse152) (and .cse59 .cse137) .cse217 (and .cse137 .cse193 .cse44) (and .cse137 .cse188 .cse44) .cse218 .cse219 .cse220 .cse221))))))))))))))) (.cse134 (bvsle (bvadd ((_ sign_extend 1) (bvadd .cse135 (_ bv4294967295 32))) (_ bv128 33)) (_ bv2147483647 33)))) (or (and .cse65 .cse66 .cse133 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse74 .cse75 .cse76 .cse77 .cse134 .cse78 .cse79 .cse80 .cse81 .cse82 .cse83 .cse84 .cse85 .cse86 .cse87 .cse129 .cse89) (and .cse65 .cse66 .cse133 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse74 .cse75 .cse76 .cse77 .cse78 .cse79 .cse80 .cse81 .cse82 .cse83 .cse84 .cse85 .cse86 .cse87 .cse129 .cse88 .cse89) (and .cse65 .cse66 .cse133 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse74 .cse75 .cse76 .cse77 .cse134 .cse78 .cse79 .cse80 .cse81 .cse82 .cse83 .cse84 .cse85 .cse86 .cse87 .cse129 .cse88 .cse89) (and .cse133 .cse134 .cse129))))) (or (and .cse15 .cse18 .cse132) (and .cse18 .cse132)))) (.cse27 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))) (.cse32 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|))))) (let ((.cse26 (= base2flt_~__retres4~0 (_ bv0 32))) (.cse0 (and .cse130 .cse27 .cse131 .cse32)) (.cse1 (and .cse62 .cse130 .cse64 .cse32)) (.cse3 (and .cse130 .cse27 .cse32))) (let ((.cse5 (and .cse26 (or .cse0 .cse1 .cse3)))) (let ((.cse7 (or .cse0 .cse1 .cse3 .cse5))) (let ((.cse4 (not .cse129)) (.cse6 (and .cse7 .cse26)) (.cse8 (not .cse128)) (.cse2 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|))))) (.cse9 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|))))) (.cse28 (= base2flt_~e (_ bv0 32)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 (= (_ bv4294967295 32) base2flt_~__retres4~0)) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9) (let ((.cse46 (bvshl (bvshl |base2flt_#in~m| (_ bv1 32)) (_ bv1 32)))) (let ((.cse47 (bvshl (bvshl (bvshl (bvshl .cse46 (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)))) (let ((.cse45 (bvshl (bvshl (bvshl (bvshl (bvshl (bvshl (bvshl .cse47 (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)))) (let ((.cse12 (bvult |base2flt_#in~m| (_ bv16777216 32))) (.cse11 (bvult .cse47 (_ bv16777216 32))) (.cse10 (bvult .cse46 (_ bv16777216 32))) (.cse13 (= |base2flt_#in~m| (_ bv0 32))) (.cse40 (bvult .cse45 (_ bv16777216 32))) (.cse41 (bvult (bvshl .cse45 (_ bv1 32)) (_ bv16777216 32)))) (or (not .cse10) (and (not .cse11) .cse12) .cse2 (not .cse13) (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= base2flt_~m (_ bv0 32)) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (or (not .cse12) .cse11) .cse27 .cse10 .cse13 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 (or (not .cse40) .cse41) .cse42 .cse43) .cse44 (and .cse40 (not .cse41)) .cse9))))) (let ((.cse61 (= |base2flt_#in~m| (_ bv1 32)))) (let ((.cse51 (let ((.cse123 (let ((.cse125 (let ((.cse127 (or (and .cse28 .cse35) .cse35))) (or (and (= base2flt_~m (_ bv2 32)) .cse61 .cse127) (and .cse61 .cse127))))) (or (and .cse124 .cse125 .cse35) (and .cse124 .cse125 .cse126 .cse35))))) (or (and .cse16 .cse61 .cse24 .cse33 .cse123) (and .cse16 .cse61 .cse33 .cse123) (and .cse61 .cse33 .cse123) (and .cse61 .cse123) (and (= base2flt_~m (_ bv4 32)) .cse61 .cse123))))) (let ((.cse54 (let ((.cse113 (and .cse61 .cse51 .cse33)) (.cse114 (and .cse61 .cse51)) (.cse115 (and .cse16 .cse21 .cse61 .cse24 .cse51 .cse33 .cse39)) (.cse116 (and .cse16 .cse21 .cse22 .cse23 .cse61 .cse24 .cse51 .cse33 .cse39)) (.cse117 (and .cse16 .cse21 .cse22 .cse61 .cse24 .cse51 .cse33 .cse39)) (.cse119 (and .cse16 .cse61 .cse51 .cse33)) (.cse120 (and (= base2flt_~m (_ bv64 32)) .cse61 .cse51)) (.cse121 (and .cse16 .cse61 .cse24 .cse51 .cse33 .cse39)) (.cse122 (and .cse16 .cse61 .cse24 .cse51 .cse33))) (or .cse113 .cse114 .cse115 .cse116 .cse117 (and .cse118 (or .cse113 .cse114 .cse115 .cse116 .cse117 .cse119 .cse120 .cse121 .cse122)) .cse119 .cse120 .cse121 .cse122)))) (let ((.cse90 (and .cse61 .cse54)) (.cse91 (and .cse14 .cse16 .cse17 .cse19 .cse20 .cse61 .cse29 .cse30 .cse31 .cse33 .cse36 .cse37 .cse38 .cse54 .cse42 .cse43)) (.cse92 (and .cse14 .cse16 .cse17 .cse19 .cse20 .cse61 .cse30 .cse31 .cse33 .cse34 .cse38 .cse54 .cse42)) (.cse93 (and .cse16 .cse20 .cse61 .cse33 .cse54)) (.cse94 (and .cse16 .cse61 .cse33 .cse54)) (.cse95 (and .cse14 .cse16 .cse17 .cse61 .cse31 .cse33 .cse37 .cse38 .cse54)) (.cse96 (and .cse16 .cse20 .cse61 .cse31 .cse33 .cse54)) (.cse97 (and .cse61 .cse33 .cse54)) (.cse98 (and .cse14 .cse20 .cse61 .cse31 .cse33 .cse37 .cse38 .cse54)) (.cse105 (and .cse14 .cse16 .cse17 .cse20 .cse61 .cse30 .cse33 .cse37 .cse38 .cse54)) (.cse106 (and .cse14 .cse16 .cse17 .cse20 .cse61 .cse30 .cse31 .cse33 .cse34 .cse37 .cse54)) (.cse107 (and .cse16 .cse17 .cse20 .cse61 .cse30 .cse31 .cse33 .cse34 .cse37 .cse38 .cse54 .cse42)) (.cse108 (and .cse16 .cse20 .cse61 .cse31 .cse33 .cse38 .cse54)) (.cse109 (and .cse14 .cse16 .cse20 .cse61 .cse31 .cse33 .cse38 .cse54)) (.cse110 (and .cse14 .cse16 .cse17 .cse19 .cse20 .cse61 .cse31 .cse33 .cse34 .cse36 .cse37 .cse38 .cse54 .cse42 .cse43)) (.cse111 (and .cse14 .cse16 .cse19 .cse20 .cse61 .cse30 .cse31 .cse33 .cse34 .cse36 .cse37 .cse38 .cse54 .cse42)) (.cse112 (and .cse61 .cse54 (= base2flt_~m (_ bv16384 32))))) (let ((.cse53 (or .cse90 .cse91 .cse92 .cse93 .cse94 .cse95 .cse96 .cse97 .cse98 .cse105 .cse106 .cse107 .cse108 .cse109 .cse110 .cse111 .cse112))) (let ((.cse63 (let ((.cse73 (or .cse90 .cse91 .cse92 .cse93 .cse94 .cse95 .cse96 .cse97 .cse98 (and .cse99 .cse100 .cse101 .cse102 .cse103 .cse53 .cse104) .cse105 .cse106 .cse107 .cse108 .cse109 .cse110 .cse111 .cse112))) (or (and .cse65 .cse66 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse73 .cse74 .cse75 .cse76 .cse77 .cse78 .cse79 .cse80 .cse81 .cse82 .cse83 .cse84 .cse85 .cse86 .cse87 .cse35 .cse88 .cse89) (and .cse73 .cse35 (= base2flt_~e (bvadd (_ bv4294967295 32) (bvadd (bvadd (bvadd (_ bv4294967295 32) (_ bv4294967276 32)) (_ bv4294967295 32)) (_ bv4294967295 32))))))))) (let ((.cse49 (and .cse18 .cse62 .cse63 .cse64 .cse32)) (.cse56 (and .cse18 .cse62 .cse26 .cse63 .cse64 .cse32))) (let ((.cse55 (and .cse26 (or .cse49 .cse56)))) (let ((.cse48 (and (or .cse49 .cse55 .cse56) .cse26))) (or .cse48 .cse49 .cse2 (and .cse50 .cse51 .cse52) (and .cse53 .cse44) (and .cse44 .cse54) .cse55 (and (or .cse48 .cse49 .cse55 .cse56) .cse26) (and .cse57 .cse58 .cse54) (and .cse59 .cse53 .cse60) .cse44 (not .cse61) (and .cse51 .cse44) .cse56 .cse9)))))))))))))))))))))))))))))))))))))))) [2023-02-18 07:43:55,044 INFO L899 garLoopResultBuilder]: For program point base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 77) no Hoare annotation was computed. [2023-02-18 07:43:55,044 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 24 82) the Hoare annotation is: true [2023-02-18 07:43:55,044 INFO L899 garLoopResultBuilder]: For program point L38(lines 37 52) no Hoare annotation was computed. [2023-02-18 07:43:55,044 INFO L899 garLoopResultBuilder]: For program point base2fltFINAL(lines 24 82) no Hoare annotation was computed. [2023-02-18 07:43:55,044 INFO L899 garLoopResultBuilder]: For program point L59(lines 57 72) no Hoare annotation was computed. [2023-02-18 07:43:55,044 INFO L899 garLoopResultBuilder]: For program point base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2023-02-18 07:43:55,045 INFO L899 garLoopResultBuilder]: For program point base2fltEXIT(lines 24 82) no Hoare annotation was computed. [2023-02-18 07:43:55,045 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-02-18 07:43:55,060 INFO L895 garLoopResultBuilder]: At program point L47-1(lines 37 52) the Hoare annotation is: (let ((.cse141 (bvadd base2flt_~e (_ bv4294967295 32)))) (let ((.cse144 (bvadd (_ bv4294967295 32) .cse141))) (let ((.cse142 (bvadd (_ bv4294967295 32) .cse144))) (let ((.cse140 (bvadd (_ bv4294967295 32) .cse142))) (let ((.cse162 (bvadd (_ bv4294967295 32) .cse140))) (let ((.cse153 (bvadd (_ bv4294967295 32) .cse162))) (let ((.cse149 (bvadd (_ bv4294967295 32) .cse153))) (let ((.cse148 (bvadd (_ bv4294967295 32) .cse149))) (let ((.cse157 (bvadd (_ bv4294967295 32) .cse148))) (let ((.cse154 (bvadd (_ bv4294967295 32) .cse157))) (let ((.cse150 (bvadd .cse154 (_ bv4294967295 32)))) (let ((.cse160 (bvadd (_ bv4294967295 32) .cse150))) (let ((.cse145 (bvadd (_ bv4294967295 32) .cse160))) (let ((.cse155 (bvadd (_ bv4294967295 32) .cse145))) (let ((.cse147 (bvadd (_ bv4294967295 32) .cse155))) (let ((.cse158 (bvadd (_ bv4294967295 32) .cse147))) (let ((.cse146 (bvadd (_ bv4294967295 32) .cse158))) (let ((.cse156 (bvadd .cse146 (_ bv4294967295 32)))) (let ((.cse159 (bvadd (_ bv4294967295 32) .cse156))) (let ((.cse163 (bvadd (_ bv4294967295 32) .cse159))) (let ((.cse152 (bvadd .cse163 (_ bv4294967295 32))) (.cse94 (bvadd base2flt_~e (_ bv1 32))) (.cse168 (bvadd (bvadd (_ bv4294967293 32) |base2flt_#in~e|) (_ bv4294967295 32)))) (let ((.cse164 (bvadd .cse168 (_ bv4294967295 32))) (.cse77 (bvadd (_ bv1 32) .cse94)) (.cse161 (bvadd (_ bv4294967295 32) .cse152)) (.cse80 (= |base2flt_#in~e| (_ bv0 32))) (.cse167 (bvadd (bvadd (_ bv4294967289 32) |base2flt_#in~e|) (_ bv4294967295 32)))) (let ((.cse138 ((_ sign_extend 1) base2flt_~e)) (.cse139 ((_ sign_extend 1) .cse141)) (.cse143 (bvadd (_ bv4294967295 32) .cse167)) (.cse166 (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967285 32) |base2flt_#in~e|))) (.cse114 (not .cse80)) (.cse151 (bvadd (_ bv4294967295 32) .cse161)) (.cse99 (bvadd .cse77 (_ bv1 32))) (.cse36 (bvadd (_ bv4294967295 32) |base2flt_#in~e|)) (.cse165 (bvadd (_ bv4294967295 32) .cse164))) (let ((.cse68 (= base2flt_~e .cse165)) (.cse70 (= .cse164 .cse94)) (.cse66 (= base2flt_~e (bvadd (_ bv4294967295 32) (bvadd |base2flt_#in~e| (_ bv4294967283 32))))) (.cse53 (= |base2flt_#in~e| .cse77)) (.cse73 (= .cse36 .cse94)) (.cse54 (= .cse99 |base2flt_#in~e|)) (.cse30 (bvsle (bvadd ((_ sign_extend 1) (bvadd .cse151 (_ bv4294967295 32))) (_ bv128 33)) (_ bv2147483647 33))) (.cse61 (or (not (bvsle .cse155 (_ bv4294967168 32))) .cse114)) (.cse62 (or (not (bvsle .cse145 (_ bv4294967168 32))) .cse114)) (.cse63 (or (not (bvsle .cse160 (_ bv4294967168 32))) .cse114)) (.cse48 (= base2flt_~e .cse166)) (.cse56 (= base2flt_~e .cse168)) (.cse57 (or (not (bvsle .cse150 (_ bv4294967168 32))) .cse114)) (.cse49 (= .cse143 .cse94)) (.cse72 (= base2flt_~e .cse36)) (.cse59 (= |base2flt_#in~e| .cse94)) (.cse55 (= base2flt_~e .cse167)) (.cse52 (= .cse94 .cse166)) (.cse60 (= .cse165 .cse94)) (.cse50 (= .cse143 .cse77)) (.cse67 (= base2flt_~e .cse164)) (.cse29 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|)))) (.cse65 (= base2flt_~e |base2flt_#in~e|)) (.cse31 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))) (.cse58 (or (not (bvsle .cse154 (_ bv4294967168 32))) .cse114)) (.cse51 (or (not (bvsle .cse157 (_ bv4294967168 32))) .cse114)) (.cse39 (or (not (bvsle .cse148 (_ bv4294967168 32))) .cse114)) (.cse40 (or (not (bvsle .cse153 (_ bv4294967168 32))) .cse114)) (.cse41 (or (not (bvsle .cse162 (_ bv4294967168 32))) .cse114)) (.cse46 (or (not (bvsle .cse149 (_ bv4294967168 32))) .cse114)) (.cse0 (bvsle (bvadd ((_ sign_extend 1) .cse163) (_ bv128 33)) (_ bv2147483647 33))) (.cse22 (bvsle (bvadd ((_ sign_extend 1) .cse162) (_ bv128 33)) (_ bv2147483647 33))) (.cse2 (bvsle (bvadd ((_ sign_extend 1) .cse161) (_ bv128 33)) (_ bv2147483647 33))) (.cse23 (bvsle (bvadd ((_ sign_extend 1) .cse140) (_ bv128 33)) (_ bv2147483647 33))) (.cse3 (bvsle (bvadd ((_ sign_extend 1) .cse160) (_ bv128 33)) (_ bv2147483647 33))) (.cse4 (bvsle (bvadd ((_ sign_extend 1) .cse159) (_ bv128 33)) (_ bv2147483647 33))) (.cse6 (bvsle (bvadd ((_ sign_extend 1) .cse158) (_ bv128 33)) (_ bv2147483647 33))) (.cse20 (bvsle (bvadd ((_ sign_extend 1) .cse157) (_ bv128 33)) (_ bv2147483647 33))) (.cse7 (bvsle (bvadd ((_ sign_extend 1) .cse156) (_ bv128 33)) (_ bv2147483647 33))) (.cse24 (bvsle (bvadd ((_ sign_extend 1) .cse144) (_ bv128 33)) (_ bv2147483647 33))) (.cse8 (bvsle (bvadd ((_ sign_extend 1) .cse155) (_ bv128 33)) (_ bv2147483647 33))) (.cse9 (bvsle (bvadd ((_ sign_extend 1) .cse154) (_ bv128 33)) (_ bv2147483647 33))) (.cse25 (bvsle (bvadd ((_ sign_extend 1) .cse153) (_ bv128 33)) (_ bv2147483647 33))) (.cse10 (bvsle (bvadd ((_ sign_extend 1) .cse152) (_ bv128 33)) (_ bv2147483647 33))) (.cse11 (bvsle (bvadd ((_ sign_extend 1) .cse151) (_ bv128 33)) (_ bv2147483647 33))) (.cse32 (bvsle (bvadd .cse139 (_ bv128 33)) (_ bv2147483647 33))) (.cse12 (bvsle (bvadd ((_ sign_extend 1) .cse150) (_ bv128 33)) (_ bv2147483647 33))) (.cse26 (bvsle (bvadd ((_ sign_extend 1) .cse142) (_ bv128 33)) (_ bv2147483647 33))) (.cse27 (bvsle (bvadd ((_ sign_extend 1) .cse149) (_ bv128 33)) (_ bv2147483647 33))) (.cse21 (bvsle (bvadd ((_ sign_extend 1) .cse148) (_ bv128 33)) (_ bv2147483647 33))) (.cse13 (bvsle (bvadd ((_ sign_extend 1) .cse147) (_ bv128 33)) (_ bv2147483647 33))) (.cse17 (bvsle (bvadd ((_ sign_extend 1) .cse146) (_ bv128 33)) (_ bv2147483647 33))) (.cse33 (bvsle (bvadd .cse138 (_ bv128 33)) (_ bv2147483647 33))) (.cse19 (bvsle (bvadd ((_ sign_extend 1) .cse145) (_ bv128 33)) (_ bv2147483647 33))) (.cse37 (or .cse114 (not (bvsle .cse144 (_ bv4294967168 32))))) (.cse38 (or (not (bvsle base2flt_~e (_ bv4294967168 32))) .cse114)) (.cse64 (= base2flt_~e .cse143)) (.cse1 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|)))) (.cse42 (or (not (bvsle .cse142 (_ bv4294967168 32))) .cse114)) (.cse43 (or (not (bvsle .cse141 (_ bv4294967168 32))) .cse114)) (.cse5 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|) .cse94))) (.cse44 (or (not (bvsle .cse140 (_ bv4294967168 32))) .cse114)) (.cse14 (not (bvsle .cse94 (_ bv4294967168 32)))) (.cse16 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))) (.cse47 (bvult base2flt_~m (_ bv16777216 32))) (.cse74 (bvsle (_ bv6442450944 33) (bvadd .cse139 (_ bv8589934591 33)))) (.cse75 (bvsle (_ bv6442450944 33) (bvadd (_ bv8589934591 33) .cse138))) (.cse28 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|))))) (.cse35 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) (and (let ((.cse34 (bvsle (_ bv6442450944 33) (bvadd ((_ sign_extend 1) .cse36) (_ bv8589934591 33))))) (let ((.cse15 (let ((.cse45 (let ((.cse69 (let ((.cse71 (or (and .cse34 .cse74) (and .cse34 .cse75)))) (or (and .cse65 .cse71 .cse47) (and .cse38 .cse71 .cse47) (and .cse37 .cse38 .cse43 .cse71 .cse47) (and .cse72 .cse71 .cse47) (and .cse71 .cse47) (and .cse73 .cse71 .cse47) (and .cse38 .cse43 .cse71 .cse47))))) (or (and .cse38 .cse43 .cse69 .cse47) (and .cse38 .cse69 .cse47) (and .cse37 .cse38 .cse43 .cse69 .cse47) (and .cse69 .cse70 .cse47) (and .cse67 .cse69 .cse47) (and .cse37 .cse38 .cse40 .cse41 .cse42 .cse43 .cse44 .cse69 .cse47) (and .cse59 .cse69 .cse47) (and .cse69 .cse47) (and .cse54 .cse69 .cse47) (and .cse53 .cse69 .cse47) (and .cse37 .cse38 .cse42 .cse43 .cse44 .cse69 .cse47) (and .cse65 .cse69 .cse47) (and .cse37 .cse38 .cse42 .cse43 .cse69 .cse47) (and .cse56 .cse69 .cse47) (and .cse37 .cse38 .cse41 .cse42 .cse43 .cse44 .cse69 .cse47))))) (or (and .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse45 .cse47 .cse48) (and .cse49 .cse45 .cse47) (and .cse50 .cse45 .cse47) (and .cse37 .cse38 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse47) (and .cse51 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse37 .cse38 .cse42 .cse43 .cse45 .cse47) (and .cse52 .cse45 .cse47) (and .cse53 .cse45 .cse47) (and .cse54 .cse45 .cse47) (and .cse45 .cse55 .cse47) (and .cse56 .cse45 .cse47) (and .cse51 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse57 .cse58 .cse44 .cse45 .cse46 .cse47) (and .cse37 .cse38 .cse43 .cse45 .cse47) (and .cse59 .cse45 .cse47) (and .cse45 .cse60 .cse47) (and .cse38 .cse45 .cse47) (and .cse51 .cse37 .cse38 .cse61 .cse39 .cse40 .cse41 .cse42 .cse43 .cse57 .cse58 .cse62 .cse63 .cse44 .cse45 .cse46 .cse47) (and .cse37 .cse38 .cse41 .cse42 .cse43 .cse44 .cse45 .cse47) (and .cse64 .cse45 .cse47) (and .cse65 .cse45 .cse47) (and .cse66 .cse45 .cse47) (and .cse51 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse57 .cse58 .cse62 .cse63 .cse44 .cse45 .cse46 .cse47) (and .cse51 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse57 .cse58 .cse63 .cse44 .cse45 .cse46 .cse47) (and .cse67 .cse45 .cse47) (and .cse68 .cse45 .cse47) (and .cse38 .cse43 .cse45 .cse47) (and .cse37 .cse38 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse45 .cse47) (and .cse51 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse58 .cse44 .cse45 .cse46 .cse47) (and .cse37 .cse38 .cse42 .cse43 .cse44 .cse45 .cse47)))) (.cse18 (bvsle (bvadd ((_ sign_extend 1) (bvadd (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) .cse36)))))) (_ bv4294967295 32))) (_ bv4294967295 32)))))) (_ bv4294967295 32)))) (_ bv4294967295 32)))))) (_ bv4294967295 32)) (_ bv4294967295 32))) (_ bv128 33)) (_ bv2147483647 33)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10 .cse11 .cse14 .cse15 .cse16 .cse18) (and .cse0 .cse1 .cse2 .cse5 .cse10 .cse11 .cse14 .cse15 .cse16 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse22 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse24 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse26 .cse27 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse5 .cse10 .cse11 .cse14 .cse15 .cse16 .cse18) (and .cse0 .cse22 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse26 .cse27 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse5 .cse11 .cse14 .cse15 .cse16 .cse18) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse10 .cse11 .cse14 .cse15 .cse16 .cse18) .cse28 (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse29 .cse1 .cse30 .cse31 .cse15 .cse16 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse27 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse22 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse27 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse5 (or (and .cse0 .cse22 .cse2 .cse23 .cse3 .cse4 .cse6 .cse20 .cse7 .cse24 .cse8 .cse9 .cse25 .cse10 .cse11 .cse32 .cse12 .cse26 .cse27 .cse21 .cse13 .cse15 .cse17 .cse18 .cse33 .cse19) (and .cse0 .cse22 .cse2 .cse23 .cse3 .cse4 .cse6 .cse20 .cse7 .cse24 .cse8 .cse9 .cse25 .cse10 .cse11 .cse32 .cse12 .cse26 .cse27 .cse21 .cse13 .cse15 .cse17 .cse18 .cse19)) .cse14 .cse16) (not .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse5 .cse11 .cse14 .cse15 .cse16 .cse18) (not .cse34) (and .cse0 .cse22 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse27 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse35))) (let ((.cse134 (bvshl base2flt_~m (_ bv1 32)))) (let ((.cse128 (bvshl .cse134 (_ bv1 32)))) (let ((.cse127 (bvshl .cse128 (_ bv1 32)))) (let ((.cse131 (bvshl .cse127 (_ bv1 32)))) (let ((.cse130 (bvshl .cse131 (_ bv1 32)))) (let ((.cse133 (bvshl .cse130 (_ bv1 32)))) (let ((.cse132 (bvshl .cse133 (_ bv1 32)))) (let ((.cse129 (bvshl .cse132 (_ bv1 32)))) (let ((.cse126 (bvshl .cse129 (_ bv1 32)))) (let ((.cse125 (bvshl .cse126 (_ bv1 32)))) (let ((.cse123 (bvshl .cse125 (_ bv1 32)))) (let ((.cse124 (bvshl .cse123 (_ bv1 32)))) (let ((.cse101 (bvshl .cse124 (_ bv1 32))) (.cse116 (bvadd (_ bv4294967295 32) (_ bv4294967276 32))) (.cse106 (= base2flt_~m (_ bv2 32))) (.cse76 (= |base2flt_#in~m| (_ bv1 32)))) (let ((.cse105 (or (and .cse106 .cse76 .cse80) (and .cse76 .cse80))) (.cse111 (bvadd (_ bv4294967295 32) (_ bv4294967290 32))) (.cse82 (bvult .cse134 (_ bv16777216 32))) (.cse110 (bvult .cse133 (_ bv16777216 32))) (.cse118 (bvult .cse132 (_ bv16777216 32))) (.cse108 (bvult .cse131 (_ bv16777216 32))) (.cse109 (bvult .cse130 (_ bv16777216 32))) (.cse117 (bvult .cse129 (_ bv16777216 32))) (.cse98 (bvult .cse128 (_ bv16777216 32))) (.cse104 (bvult .cse127 (_ bv16777216 32))) (.cse119 (bvult .cse126 (_ bv16777216 32))) (.cse102 (bvadd .cse116 (_ bv4294967295 32))) (.cse112 (bvadd (_ bv4294967286 32) (_ bv4294967295 32))) (.cse120 (bvult .cse125 (_ bv16777216 32))) (.cse100 (bvult .cse101 (_ bv16777216 32))) (.cse122 (bvult .cse124 (_ bv16777216 32))) (.cse121 (bvult .cse123 (_ bv16777216 32))) (.cse107 (bvadd (_ bv4294967295 32) (_ bv0 32)))) (let ((.cse97 (bvadd (_ bv4294967295 32) .cse107)) (.cse89 (or .cse122 (not .cse121))) (.cse93 (or (not .cse122) .cse100)) (.cse84 (or .cse121 (not .cse120))) (.cse86 (bvadd (_ bv4294967295 32) (_ bv4294967281 32))) (.cse96 (bvadd .cse112 (_ bv4294967295 32))) (.cse78 (bvadd (_ bv4294967295 32) (_ bv4294967293 32))) (.cse113 (bvadd .cse102 (_ bv4294967295 32))) (.cse92 (or .cse120 (not .cse119))) (.cse115 (bvadd (_ bv4294967295 32) (_ bv4294967278 32))) (.cse87 (or (not .cse98) .cse104)) (.cse88 (or .cse119 (not .cse117))) (.cse81 (or (not .cse108) .cse109)) (.cse83 (or (not .cse110) .cse118)) (.cse95 (or .cse117 (not .cse118))) (.cse90 (or .cse110 (not .cse109))) (.cse91 (or .cse108 (not .cse104))) (.cse85 (or (not .cse82) .cse98)) (.cse103 (bvadd (_ bv4294967295 32) .cse111)) (.cse79 (or (and .cse105 .cse75 .cse74 .cse80) (and .cse105 .cse75 .cse80)))) (or (and (= base2flt_~m (_ bv64 32)) .cse1 .cse5 .cse76 .cse68 (= .cse77 .cse78) .cse79 .cse14 .cse16 .cse70 .cse47 .cse80) (and .cse81 .cse51 .cse37 .cse38 .cse82 .cse39 .cse83 .cse1 .cse84 .cse40 .cse85 .cse41 .cse42 .cse43 .cse5 .cse76 .cse57 .cse58 .cse62 .cse63 .cse44 .cse79 (= base2flt_~e .cse86) .cse14 .cse87 .cse16 .cse46 .cse47 .cse88 .cse80 .cse89 .cse90 .cse91 .cse92 .cse93) (and .cse81 .cse51 .cse37 .cse38 .cse82 .cse39 .cse1 .cse84 .cse40 .cse85 .cse41 .cse42 .cse43 .cse5 .cse76 .cse57 .cse58 .cse63 .cse44 (= .cse86 .cse94) .cse79 .cse95 .cse14 .cse87 .cse16 .cse46 .cse47 .cse88 .cse80 .cse89 .cse90 .cse91 .cse92) (and .cse66 .cse1 .cse5 .cse76 .cse79 .cse14 .cse16 .cse47 .cse80 (= .cse96 .cse77) (= base2flt_~m (_ bv16384 32))) (and (= base2flt_~m (_ bv4 32)) .cse53 .cse73 .cse1 .cse5 .cse76 .cse79 .cse14 .cse16 .cse80 (= base2flt_~e .cse97)) (and .cse37 (= .cse97 .cse94) .cse38 .cse82 .cse1 .cse43 .cse5 .cse76 .cse54 .cse98 (= base2flt_~m (_ bv8 32)) .cse79 .cse14 .cse16 .cse47 .cse80) (and .cse37 .cse0 .cse38 .cse82 .cse22 .cse1 .cse2 .cse23 .cse3 .cse85 .cse42 .cse43 .cse4 .cse5 .cse6 .cse20 .cse76 .cse7 .cse24 .cse8 .cse9 .cse30 .cse25 .cse10 .cse11 .cse32 .cse12 .cse26 .cse27 .cse44 .cse21 .cse79 .cse13 .cse14 .cse87 .cse16 .cse17 .cse47 .cse80 .cse33 .cse19 .cse91) (and .cse81 .cse51 .cse37 .cse38 .cse61 .cse82 .cse39 .cse83 .cse1 .cse84 .cse40 .cse85 .cse41 .cse42 .cse43 .cse5 .cse76 .cse57 .cse58 .cse62 .cse63 (= .cse99 .cse96) .cse44 .cse79 (or (not .cse100) (bvult (bvshl .cse101 (_ bv1 32)) (_ bv16777216 32))) .cse95 .cse14 .cse87 .cse16 .cse46 .cse47 .cse80 .cse89 .cse90 .cse91 .cse92 .cse93) (and .cse81 .cse37 .cse38 .cse82 .cse83 .cse1 .cse40 .cse41 .cse42 .cse43 .cse5 .cse76 .cse44 .cse79 .cse14 .cse87 .cse16 .cse46 .cse47 .cse80 (= base2flt_~e .cse102) .cse90 .cse91) .cse28 (and .cse38 .cse82 .cse1 (= base2flt_~m (_ bv4096 32)) .cse43 .cse5 .cse76 .cse79 .cse14 .cse16 .cse47 .cse80 (= base2flt_~e .cse96) .cse48) (and .cse38 .cse82 .cse1 .cse43 .cse5 .cse76 (= base2flt_~m (_ bv16 32)) (= base2flt_~e .cse78) .cse56 .cse79 .cse14 .cse16 .cse47 .cse80) (and .cse0 .cse22 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse20 .cse76 .cse7 .cse24 .cse8 .cse9 .cse25 .cse10 .cse11 .cse32 .cse12 .cse26 .cse27 .cse21 .cse79 .cse13 .cse14 .cse16 .cse17 .cse47 .cse80 .cse33 .cse19) (and .cse81 .cse51 .cse37 .cse38 .cse82 .cse39 .cse83 .cse1 .cse84 .cse40 (= .cse86 .cse77) .cse85 .cse41 .cse42 .cse43 .cse5 .cse76 .cse57 .cse58 .cse44 .cse79 .cse95 .cse14 .cse87 .cse16 .cse46 .cse47 .cse88 .cse80 .cse91 .cse92) (and .cse37 .cse38 .cse82 .cse49 (= .cse103 .cse77) .cse1 .cse42 .cse43 .cse5 .cse76 .cse98 (= base2flt_~m (_ bv1024 32)) .cse79 .cse14 .cse16 .cse47 .cse80 .cse104) (and .cse105 .cse1 .cse106 (= base2flt_~e .cse107) .cse5 .cse76 .cse72 .cse59 .cse14 .cse16 .cse80 (= .cse94 (_ bv0 32))) (and .cse37 (= base2flt_~m (_ bv256 32)) .cse38 (= base2flt_~e .cse103) .cse82 .cse1 .cse41 .cse42 .cse108 .cse109 .cse43 .cse5 .cse76 .cse98 .cse44 .cse55 .cse79 .cse14 .cse16 .cse47 .cse80 .cse104) (and .cse38 .cse1 (= base2flt_~m (_ bv8192 32)) .cse5 .cse76 .cse52 .cse79 .cse14 .cse16 .cse47 .cse80 (= .cse96 .cse94)) (and .cse0 .cse38 .cse82 .cse22 .cse1 .cse2 .cse23 .cse3 .cse43 .cse4 .cse5 .cse6 .cse20 .cse76 .cse7 .cse24 .cse8 .cse9 .cse25 .cse10 .cse11 .cse32 .cse12 .cse26 .cse27 .cse21 .cse79 .cse13 .cse14 .cse16 .cse17 .cse47 .cse80 .cse33 .cse19) (and .cse37 .cse38 .cse82 (= base2flt_~m (_ bv128 32)) .cse1 .cse40 .cse41 .cse42 .cse108 .cse109 .cse43 .cse110 .cse5 .cse76 .cse98 (= base2flt_~e .cse111) .cse44 .cse79 .cse14 .cse16 .cse60 .cse47 .cse80 .cse104) (and .cse37 .cse0 .cse38 .cse82 .cse22 .cse1 .cse2 .cse23 .cse3 .cse85 .cse42 .cse43 .cse4 .cse5 .cse6 .cse20 .cse76 .cse7 .cse24 .cse8 .cse9 .cse25 .cse10 .cse11 .cse32 .cse12 .cse26 .cse27 .cse21 .cse79 .cse13 .cse14 .cse87 .cse16 .cse17 .cse47 .cse80 .cse33 .cse19) (and .cse37 .cse38 .cse82 .cse50 .cse1 .cse43 .cse5 .cse76 (= base2flt_~e .cse112) .cse98 (= base2flt_~m (_ bv2048 32)) .cse79 .cse14 .cse16 .cse47 .cse80) (and .cse81 .cse37 .cse38 .cse82 .cse1 .cse85 .cse41 .cse42 .cse43 .cse5 .cse76 .cse44 .cse79 .cse14 .cse87 .cse16 .cse47 .cse80 .cse91 (= base2flt_~e (bvadd (_ bv4294967295 32) .cse113))) (and .cse38 .cse1 .cse5 .cse76 (= base2flt_~m (_ bv32 32)) .cse67 .cse79 .cse14 .cse16 (= .cse94 .cse78) .cse47 .cse80) (and .cse29 .cse1 (= base2flt_~m (_ bv1 32)) .cse76 .cse65 .cse31 (= base2flt_~e (_ bv0 32)) .cse16 .cse80) (and .cse81 .cse37 .cse38 .cse1 .cse40 .cse85 .cse41 .cse42 .cse43 .cse5 .cse76 (= base2flt_~e .cse113) .cse44 .cse79 .cse14 .cse87 .cse16 .cse47 .cse80 .cse90 .cse91) .cse114 (not .cse76) (and .cse51 .cse37 .cse38 .cse82 .cse39 .cse83 .cse1 .cse40 .cse85 .cse41 .cse42 .cse43 .cse5 .cse76 .cse58 (= base2flt_~e .cse115) .cse44 .cse79 .cse95 .cse14 .cse87 .cse16 .cse46 .cse47 .cse88 .cse80 .cse90 .cse91 .cse92) (and .cse81 .cse51 .cse37 .cse38 .cse82 .cse39 .cse83 .cse1 (= .cse115 .cse94) .cse40 .cse85 .cse41 .cse42 .cse43 .cse5 .cse76 .cse44 .cse79 .cse95 .cse14 .cse87 .cse16 .cse46 .cse47 .cse88 .cse80 .cse90) (and .cse0 .cse38 .cse22 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse20 .cse76 .cse7 .cse24 .cse8 .cse9 .cse25 .cse10 .cse11 .cse32 .cse12 .cse26 .cse27 .cse21 .cse79 .cse13 .cse14 .cse16 .cse17 .cse47 .cse80 .cse33 .cse19) (and .cse81 .cse37 .cse38 .cse82 .cse39 .cse83 .cse1 .cse40 .cse85 .cse41 .cse42 .cse43 .cse5 .cse76 (= .cse116 base2flt_~e) .cse44 .cse79 .cse95 .cse14 .cse16 .cse46 .cse47 .cse80 .cse90 .cse91) (and .cse37 .cse0 .cse38 .cse82 .cse22 .cse1 .cse2 .cse23 .cse3 .cse85 .cse43 .cse4 .cse5 .cse6 .cse20 .cse76 .cse7 .cse24 .cse8 .cse9 .cse25 .cse10 .cse11 .cse32 .cse12 .cse26 .cse27 .cse21 .cse79 .cse13 .cse14 .cse16 .cse17 .cse47 .cse80 .cse33 .cse19) .cse35 (and .cse37 .cse38 .cse82 .cse64 .cse1 (= .cse103 .cse94) .cse42 .cse108 .cse43 .cse5 (= base2flt_~m (_ bv512 32)) .cse76 .cse98 .cse44 .cse79 .cse14 .cse16 .cse47 .cse80 .cse104))))))))))))))))) (let ((.cse135 (bvshl (bvshl |base2flt_#in~m| (_ bv1 32)) (_ bv1 32)))) (let ((.cse136 (bvshl (bvshl (bvshl (bvshl .cse135 (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)))) (or (not (bvult .cse135 (_ bv16777216 32))) (and (not (bvult .cse136 (_ bv16777216 32))) (bvult |base2flt_#in~m| (_ bv16777216 32))) .cse28 (not (= |base2flt_#in~m| (_ bv0 32))) .cse114 (let ((.cse137 (bvshl (bvshl (bvshl (bvshl (bvshl (bvshl (bvshl .cse136 (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)))) (and (bvult .cse137 (_ bv16777216 32)) (not (bvult (bvshl .cse137 (_ bv1 32)) (_ bv16777216 32))))) .cse35)))))))))))))))))))))))))))) [2023-02-18 07:43:55,061 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 75) no Hoare annotation was computed. [2023-02-18 07:43:55,061 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 175) no Hoare annotation was computed. [2023-02-18 07:43:55,061 INFO L899 garLoopResultBuilder]: For program point L201(line 201) no Hoare annotation was computed. [2023-02-18 07:43:55,061 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 220 276) the Hoare annotation is: true [2023-02-18 07:43:55,061 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 178) no Hoare annotation was computed. [2023-02-18 07:43:55,062 INFO L899 garLoopResultBuilder]: For program point L201-1(line 201) no Hoare annotation was computed. [2023-02-18 07:43:55,062 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 172) no Hoare annotation was computed. [2023-02-18 07:43:55,062 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 07:43:55,062 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 190) no Hoare annotation was computed. [2023-02-18 07:43:55,062 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 252) no Hoare annotation was computed. [2023-02-18 07:43:55,062 INFO L899 garLoopResultBuilder]: For program point L243-2(lines 243 252) no Hoare annotation was computed. [2023-02-18 07:43:55,062 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2023-02-18 07:43:55,063 INFO L899 garLoopResultBuilder]: For program point L177-1(line 177) no Hoare annotation was computed. [2023-02-18 07:43:55,063 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 201) no Hoare annotation was computed. [2023-02-18 07:43:55,063 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2023-02-18 07:43:55,063 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 211) no Hoare annotation was computed. [2023-02-18 07:43:55,063 INFO L899 garLoopResultBuilder]: For program point L260-2(lines 260 264) no Hoare annotation was computed. [2023-02-18 07:43:55,063 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 172) no Hoare annotation was computed. [2023-02-18 07:43:55,063 INFO L899 garLoopResultBuilder]: For program point L194-2(lines 194 211) no Hoare annotation was computed. [2023-02-18 07:43:55,064 INFO L902 garLoopResultBuilder]: At program point mulflt_returnLabel#1(lines 147 219) the Hoare annotation is: true [2023-02-18 07:43:55,064 INFO L899 garLoopResultBuilder]: For program point L178(line 178) no Hoare annotation was computed. [2023-02-18 07:43:55,064 INFO L899 garLoopResultBuilder]: For program point L178-1(line 178) no Hoare annotation was computed. [2023-02-18 07:43:55,064 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 201) no Hoare annotation was computed. [2023-02-18 07:43:55,064 INFO L899 garLoopResultBuilder]: For program point L203(lines 203 208) no Hoare annotation was computed. [2023-02-18 07:43:55,064 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 07:43:55,065 INFO L899 garLoopResultBuilder]: For program point L195(lines 195 200) no Hoare annotation was computed. [2023-02-18 07:43:55,065 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 184) no Hoare annotation was computed. [2023-02-18 07:43:55,065 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 214) no Hoare annotation was computed. [2023-02-18 07:43:55,065 INFO L899 garLoopResultBuilder]: For program point L246(lines 246 250) no Hoare annotation was computed. [2023-02-18 07:43:55,065 INFO L899 garLoopResultBuilder]: For program point L246-2(lines 246 250) no Hoare annotation was computed. [2023-02-18 07:43:55,065 INFO L902 garLoopResultBuilder]: At program point L238(line 238) the Hoare annotation is: true [2023-02-18 07:43:55,065 INFO L899 garLoopResultBuilder]: For program point L238-1(line 238) no Hoare annotation was computed. [2023-02-18 07:43:55,066 INFO L899 garLoopResultBuilder]: For program point L172(line 172) no Hoare annotation was computed. [2023-02-18 07:43:55,066 INFO L899 garLoopResultBuilder]: For program point L172-1(line 172) no Hoare annotation was computed. [2023-02-18 07:43:55,066 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 214) no Hoare annotation was computed. [2023-02-18 07:43:55,066 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 07:43:55,066 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 177) no Hoare annotation was computed. [2023-02-18 07:43:55,066 INFO L899 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2023-02-18 07:43:55,066 INFO L899 garLoopResultBuilder]: For program point L214-1(line 214) no Hoare annotation was computed. [2023-02-18 07:43:55,067 INFO L895 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: (= (_ bv0 32) |ULTIMATE.start_main_~zero~0#1|) [2023-02-18 07:43:55,067 INFO L899 garLoopResultBuilder]: For program point L239-1(line 239) no Hoare annotation was computed. [2023-02-18 07:43:55,067 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 07:43:55,067 INFO L899 garLoopResultBuilder]: For program point L256(lines 256 272) no Hoare annotation was computed. [2023-02-18 07:43:55,067 INFO L899 garLoopResultBuilder]: For program point L256-1(lines 256 272) no Hoare annotation was computed. [2023-02-18 07:43:55,067 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 177) no Hoare annotation was computed. [2023-02-18 07:43:55,067 INFO L895 garLoopResultBuilder]: At program point L240(line 240) the Hoare annotation is: (= (_ bv0 32) |ULTIMATE.start_main_~zero~0#1|) [2023-02-18 07:43:55,068 INFO L899 garLoopResultBuilder]: For program point L240-1(line 240) no Hoare annotation was computed. [2023-02-18 07:43:55,068 INFO L899 garLoopResultBuilder]: For program point L257(lines 257 266) no Hoare annotation was computed. [2023-02-18 07:43:55,069 INFO L902 garLoopResultBuilder]: At program point L257-2(lines 257 266) the Hoare annotation is: true [2023-02-18 07:43:55,069 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 164) no Hoare annotation was computed. [2023-02-18 07:43:55,069 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 175) no Hoare annotation was computed. [2023-02-18 07:43:55,069 INFO L899 garLoopResultBuilder]: For program point L158-2(lines 157 218) no Hoare annotation was computed. [2023-02-18 07:43:55,069 INFO L902 garLoopResultBuilder]: At program point L216(lines 157 218) the Hoare annotation is: true [2023-02-18 07:43:55,069 INFO L895 garLoopResultBuilder]: At program point L241(line 241) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |ULTIMATE.start_main_~zero~0#1|))) (or (and (= |ULTIMATE.start_main_~a~0#1| (_ bv0 32)) .cse0) (and (= (_ bv4294967295 32) |ULTIMATE.start_main_~a~0#1|) .cse0) .cse0)) [2023-02-18 07:43:55,070 INFO L899 garLoopResultBuilder]: For program point L241-1(line 241) no Hoare annotation was computed. [2023-02-18 07:43:55,070 INFO L899 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2023-02-18 07:43:55,070 INFO L899 garLoopResultBuilder]: For program point L175-1(line 175) no Hoare annotation was computed. [2023-02-18 07:43:55,070 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 178) no Hoare annotation was computed. [2023-02-18 07:43:55,071 INFO L899 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2023-02-18 07:43:55,071 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 18) no Hoare annotation was computed. [2023-02-18 07:43:55,071 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 15 20) no Hoare annotation was computed. [2023-02-18 07:43:55,071 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 15 20) no Hoare annotation was computed. [2023-02-18 07:43:55,071 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 15 20) the Hoare annotation is: true [2023-02-18 07:43:55,074 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:43:55,076 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 07:43:55,103 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-18 07:43:55,107 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-18 07:43:55,107 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-18 07:43:55,111 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-18 07:43:55,111 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-18 07:43:55,111 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-18 07:44:07,640 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-18 07:44:07,641 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-18 07:44:07,641 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-18 07:44:07,641 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-18 07:44:08,441 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-18 07:44:08,442 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED]