./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_3.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e8d55036 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_3.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 aa6f3ffe66f40e883b6b9462d3d92566e122af5c88e351ce665cbb8a404d0554 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:45:17,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:45:17,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:45:17,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:45:17,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:45:17,881 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:45:17,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:45:17,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:45:17,886 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:45:17,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:45:17,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:45:17,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:45:17,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:45:17,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:45:17,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:45:17,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:45:17,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:45:17,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:45:17,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:45:17,909 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:45:17,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:45:17,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:45:17,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:45:17,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:45:17,918 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:45:17,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:45:17,919 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:45:17,920 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:45:17,920 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:45:17,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:45:17,921 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:45:17,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:45:17,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:45:17,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:45:17,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:45:17,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:45:17,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:45:17,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:45:17,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:45:17,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:45:17,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:45:17,928 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-02-15 22:45:17,955 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:45:17,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:45:17,955 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:45:17,955 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:45:17,956 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:45:17,956 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:45:17,957 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:45:17,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:45:17,957 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:45:17,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:45:17,957 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:45:17,958 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:45:17,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:45:17,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:45:17,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:45:17,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 22:45:17,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:45:17,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 22:45:17,958 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-15 22:45:17,958 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:45:17,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 22:45:17,959 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:45:17,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 22:45:17,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:45:17,959 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:45:17,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:45:17,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:45:17,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:45:17,960 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:45:17,960 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 22:45:17,960 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:45:17,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:45:17,960 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:45:17,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 22:45:17,961 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:45:17,961 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:45:17,961 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:45:17,961 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 -> aa6f3ffe66f40e883b6b9462d3d92566e122af5c88e351ce665cbb8a404d0554 [2023-02-15 22:45:18,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:45:18,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:45:18,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:45:18,169 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:45:18,169 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:45:18,170 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_3.c.cil.c [2023-02-15 22:45:19,156 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:45:19,287 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:45:19,287 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_3.c.cil.c [2023-02-15 22:45:19,292 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce07186d2/31286a4c73c744cd891169d9882b9469/FLAG26ac8c2dd [2023-02-15 22:45:19,302 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce07186d2/31286a4c73c744cd891169d9882b9469 [2023-02-15 22:45:19,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:45:19,305 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:45:19,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:45:19,306 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:45:19,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:45:19,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:45:19" (1/1) ... [2023-02-15 22:45:19,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52c2a88e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:19, skipping insertion in model container [2023-02-15 22:45:19,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:45:19" (1/1) ... [2023-02-15 22:45:19,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:45:19,333 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:45:19,450 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_3.c.cil.c[727,740] [2023-02-15 22:45:19,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:45:19,506 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:45:19,514 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_3.c.cil.c[727,740] [2023-02-15 22:45:19,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:45:19,573 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:45:19,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:19 WrapperNode [2023-02-15 22:45:19,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:45:19,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:45:19,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:45:19,574 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:45:19,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:19" (1/1) ... [2023-02-15 22:45:19,584 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:19" (1/1) ... [2023-02-15 22:45:19,618 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 181 [2023-02-15 22:45:19,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:45:19,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:45:19,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:45:19,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:45:19,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:19" (1/1) ... [2023-02-15 22:45:19,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:19" (1/1) ... [2023-02-15 22:45:19,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:19" (1/1) ... [2023-02-15 22:45:19,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:19" (1/1) ... [2023-02-15 22:45:19,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:19" (1/1) ... [2023-02-15 22:45:19,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:19" (1/1) ... [2023-02-15 22:45:19,661 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:19" (1/1) ... [2023-02-15 22:45:19,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:19" (1/1) ... [2023-02-15 22:45:19,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:45:19,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:45:19,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:45:19,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:45:19,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:19" (1/1) ... [2023-02-15 22:45:19,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:45:19,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:19,688 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-15 22:45:19,692 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-15 22:45:19,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:45:19,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 22:45:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-15 22:45:19,716 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-15 22:45:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:45:19,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:45:19,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 22:45:19,717 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 22:45:19,774 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:45:19,776 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:45:20,076 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:45:20,081 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:45:20,081 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 22:45:20,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:45:20 BoogieIcfgContainer [2023-02-15 22:45:20,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:45:20,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:45:20,084 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:45:20,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:45:20,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:45:19" (1/3) ... [2023-02-15 22:45:20,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@873ae23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:45:20, skipping insertion in model container [2023-02-15 22:45:20,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:19" (2/3) ... [2023-02-15 22:45:20,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@873ae23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:45:20, skipping insertion in model container [2023-02-15 22:45:20,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:45:20" (3/3) ... [2023-02-15 22:45:20,088 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_3.c.cil.c [2023-02-15 22:45:20,100 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:45:20,100 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-02-15 22:45:20,151 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:45:20,156 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;@192abe49, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:45:20,157 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-02-15 22:45:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 89 states have (on average 1.7078651685393258) internal successors, (152), 114 states have internal predecessors, (152), 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-15 22:45:20,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 22:45:20,165 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:20,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:20,166 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:45:20,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:20,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1859144894, now seen corresponding path program 1 times [2023-02-15 22:45:20,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:20,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929799120] [2023-02-15 22:45:20,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:20,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:20,355 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-15 22:45:20,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:20,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929799120] [2023-02-15 22:45:20,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929799120] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:20,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:20,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:45:20,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382867358] [2023-02-15 22:45:20,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:20,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:45:20,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:20,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:45:20,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:45:20,386 INFO L87 Difference]: Start difference. First operand has 121 states, 89 states have (on average 1.7078651685393258) internal successors, (152), 114 states have internal predecessors, (152), 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-15 22:45:20,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:20,517 INFO L93 Difference]: Finished difference Result 294 states and 413 transitions. [2023-02-15 22:45:20,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:45:20,521 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-15 22:45:20,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:20,527 INFO L225 Difference]: With dead ends: 294 [2023-02-15 22:45:20,527 INFO L226 Difference]: Without dead ends: 154 [2023-02-15 22:45:20,530 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-15 22:45:20,532 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 87 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:20,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 409 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:20,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-02-15 22:45:20,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2023-02-15 22:45:20,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 113 states have (on average 1.5575221238938053) internal successors, (176), 134 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-15 22:45:20,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 184 transitions. [2023-02-15 22:45:20,563 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 184 transitions. Word has length 9 [2023-02-15 22:45:20,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:20,563 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 184 transitions. [2023-02-15 22:45:20,564 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-15 22:45:20,564 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 184 transitions. [2023-02-15 22:45:20,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 22:45:20,565 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:20,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:20,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 22:45:20,566 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:45:20,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:20,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1257825762, now seen corresponding path program 1 times [2023-02-15 22:45:20,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:20,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265453603] [2023-02-15 22:45:20,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:20,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:20,625 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-15 22:45:20,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:20,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265453603] [2023-02-15 22:45:20,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265453603] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:20,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:20,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:45:20,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855870513] [2023-02-15 22:45:20,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:20,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:45:20,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:20,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:45:20,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:45:20,629 INFO L87 Difference]: Start difference. First operand 141 states and 184 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-15 22:45:20,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:20,715 INFO L93 Difference]: Finished difference Result 313 states and 407 transitions. [2023-02-15 22:45:20,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:45:20,716 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-15 22:45:20,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:20,717 INFO L225 Difference]: With dead ends: 313 [2023-02-15 22:45:20,717 INFO L226 Difference]: Without dead ends: 175 [2023-02-15 22:45:20,718 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-15 22:45:20,719 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 140 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:20,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 399 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:20,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-02-15 22:45:20,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 155. [2023-02-15 22:45:20,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 127 states have (on average 1.5354330708661417) internal successors, (195), 148 states have internal predecessors, (195), 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-15 22:45:20,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 203 transitions. [2023-02-15 22:45:20,731 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 203 transitions. Word has length 14 [2023-02-15 22:45:20,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:20,731 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 203 transitions. [2023-02-15 22:45:20,731 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-15 22:45:20,732 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 203 transitions. [2023-02-15 22:45:20,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 22:45:20,732 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:20,732 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:20,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 22:45:20,733 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:45:20,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:20,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1301603374, now seen corresponding path program 1 times [2023-02-15 22:45:20,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:20,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698808318] [2023-02-15 22:45:20,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:20,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:20,795 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-15 22:45:20,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:20,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698808318] [2023-02-15 22:45:20,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698808318] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:20,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:20,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:45:20,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236476690] [2023-02-15 22:45:20,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:20,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:45:20,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:20,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:45:20,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:45:20,797 INFO L87 Difference]: Start difference. First operand 155 states and 203 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-15 22:45:20,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:20,829 INFO L93 Difference]: Finished difference Result 312 states and 408 transitions. [2023-02-15 22:45:20,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:45:20,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-15 22:45:20,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:20,830 INFO L225 Difference]: With dead ends: 312 [2023-02-15 22:45:20,831 INFO L226 Difference]: Without dead ends: 160 [2023-02-15 22:45:20,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-15 22:45:20,832 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 7 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:20,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 327 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:20,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-15 22:45:20,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2023-02-15 22:45:20,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 131 states have (on average 1.5190839694656488) internal successors, (199), 152 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-15 22:45:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 207 transitions. [2023-02-15 22:45:20,842 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 207 transitions. Word has length 15 [2023-02-15 22:45:20,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:20,843 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 207 transitions. [2023-02-15 22:45:20,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-15 22:45:20,843 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 207 transitions. [2023-02-15 22:45:20,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 22:45:20,844 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:20,844 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:20,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 22:45:20,844 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:45:20,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:20,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1755668256, now seen corresponding path program 1 times [2023-02-15 22:45:20,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:20,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777272300] [2023-02-15 22:45:20,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:20,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:20,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:20,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:20,884 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 22:45:20,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:20,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777272300] [2023-02-15 22:45:20,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777272300] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:20,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:20,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:45:20,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631276179] [2023-02-15 22:45:20,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:20,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:45:20,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:20,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:45:20,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:45:20,886 INFO L87 Difference]: Start difference. First operand 160 states and 207 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, (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-15 22:45:20,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:20,911 INFO L93 Difference]: Finished difference Result 166 states and 214 transitions. [2023-02-15 22:45:20,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:45:20,911 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, (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 23 [2023-02-15 22:45:20,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:20,912 INFO L225 Difference]: With dead ends: 166 [2023-02-15 22:45:20,912 INFO L226 Difference]: Without dead ends: 165 [2023-02-15 22:45:20,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:45:20,914 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 4 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:20,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 215 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:20,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-15 22:45:20,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 158. [2023-02-15 22:45:20,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 130 states have (on average 1.5076923076923077) internal successors, (196), 150 states have internal predecessors, (196), 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-15 22:45:20,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 204 transitions. [2023-02-15 22:45:20,927 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 204 transitions. Word has length 23 [2023-02-15 22:45:20,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:20,927 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 204 transitions. [2023-02-15 22:45:20,927 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, (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-15 22:45:20,927 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 204 transitions. [2023-02-15 22:45:20,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 22:45:20,928 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:20,928 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, 1] [2023-02-15 22:45:20,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 22:45:20,929 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:45:20,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:20,929 INFO L85 PathProgramCache]: Analyzing trace with hash -319173109, now seen corresponding path program 1 times [2023-02-15 22:45:20,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:20,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726212037] [2023-02-15 22:45:20,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:20,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:21,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:21,013 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-15 22:45:21,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:21,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726212037] [2023-02-15 22:45:21,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726212037] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:21,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:21,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:45:21,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900942520] [2023-02-15 22:45:21,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:21,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:45:21,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:21,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:45:21,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:45:21,024 INFO L87 Difference]: Start difference. First operand 158 states and 204 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-15 22:45:21,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:21,055 INFO L93 Difference]: Finished difference Result 269 states and 334 transitions. [2023-02-15 22:45:21,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:45:21,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 22 [2023-02-15 22:45:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:21,056 INFO L225 Difference]: With dead ends: 269 [2023-02-15 22:45:21,056 INFO L226 Difference]: Without dead ends: 146 [2023-02-15 22:45:21,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-15 22:45:21,058 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 41 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:21,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 327 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:21,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-15 22:45:21,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2023-02-15 22:45:21,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 112 states have (on average 1.5178571428571428) internal successors, (170), 132 states have internal predecessors, (170), 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-15 22:45:21,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 178 transitions. [2023-02-15 22:45:21,072 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 178 transitions. Word has length 22 [2023-02-15 22:45:21,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:21,072 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 178 transitions. [2023-02-15 22:45:21,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-15 22:45:21,073 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 178 transitions. [2023-02-15 22:45:21,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 22:45:21,073 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:21,073 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, 1] [2023-02-15 22:45:21,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 22:45:21,074 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:45:21,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:21,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1320323335, now seen corresponding path program 1 times [2023-02-15 22:45:21,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:21,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764323827] [2023-02-15 22:45:21,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:21,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:21,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:21,154 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-15 22:45:21,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:21,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764323827] [2023-02-15 22:45:21,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764323827] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:21,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:21,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:45:21,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827804426] [2023-02-15 22:45:21,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:21,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:45:21,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:21,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:45:21,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:45:21,155 INFO L87 Difference]: Start difference. First operand 140 states and 178 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-15 22:45:21,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:21,243 INFO L93 Difference]: Finished difference Result 149 states and 182 transitions. [2023-02-15 22:45:21,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:45:21,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 22 [2023-02-15 22:45:21,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:21,244 INFO L225 Difference]: With dead ends: 149 [2023-02-15 22:45:21,244 INFO L226 Difference]: Without dead ends: 146 [2023-02-15 22:45:21,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-15 22:45:21,252 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 69 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:21,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 398 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:21,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-15 22:45:21,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2023-02-15 22:45:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 112 states have (on average 1.4732142857142858) internal successors, (165), 132 states have internal predecessors, (165), 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-15 22:45:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 173 transitions. [2023-02-15 22:45:21,258 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 173 transitions. Word has length 22 [2023-02-15 22:45:21,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:21,258 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 173 transitions. [2023-02-15 22:45:21,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-15 22:45:21,258 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 173 transitions. [2023-02-15 22:45:21,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 22:45:21,259 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:21,259 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-15 22:45:21,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 22:45:21,266 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:45:21,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:21,267 INFO L85 PathProgramCache]: Analyzing trace with hash 807932041, now seen corresponding path program 1 times [2023-02-15 22:45:21,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:21,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863854511] [2023-02-15 22:45:21,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:21,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:21,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 22:45:21,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:21,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863854511] [2023-02-15 22:45:21,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863854511] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:21,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:21,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:45:21,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209876247] [2023-02-15 22:45:21,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:21,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:45:21,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:21,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:45:21,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:45:21,333 INFO L87 Difference]: Start difference. First operand 140 states and 173 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 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-15 22:45:21,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:21,367 INFO L93 Difference]: Finished difference Result 161 states and 200 transitions. [2023-02-15 22:45:21,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:45:21,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 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 26 [2023-02-15 22:45:21,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:21,369 INFO L225 Difference]: With dead ends: 161 [2023-02-15 22:45:21,369 INFO L226 Difference]: Without dead ends: 158 [2023-02-15 22:45:21,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-15 22:45:21,372 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 24 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:21,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 215 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:21,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-02-15 22:45:21,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 145. [2023-02-15 22:45:21,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 118 states have (on average 1.4406779661016949) internal successors, (170), 137 states have internal predecessors, (170), 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-15 22:45:21,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 178 transitions. [2023-02-15 22:45:21,386 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 178 transitions. Word has length 26 [2023-02-15 22:45:21,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:21,387 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 178 transitions. [2023-02-15 22:45:21,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 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-15 22:45:21,387 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 178 transitions. [2023-02-15 22:45:21,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 22:45:21,388 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:21,388 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] [2023-02-15 22:45:21,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 22:45:21,388 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:45:21,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:21,389 INFO L85 PathProgramCache]: Analyzing trace with hash 800615145, now seen corresponding path program 1 times [2023-02-15 22:45:21,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:21,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685765991] [2023-02-15 22:45:21,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:21,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:21,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:21,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:21,471 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-15 22:45:21,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:21,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685765991] [2023-02-15 22:45:21,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685765991] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:21,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934276393] [2023-02-15 22:45:21,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:21,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:21,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:21,475 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-15 22:45:21,475 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-15 22:45:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:21,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:45:21,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:21,613 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-15 22:45:21,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:21,740 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-15 22:45:21,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934276393] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:21,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:45:21,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-02-15 22:45:21,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495599047] [2023-02-15 22:45:21,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:21,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 22:45:21,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:21,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 22:45:21,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:45:21,742 INFO L87 Difference]: Start difference. First operand 145 states and 178 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 22:45:22,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:22,058 INFO L93 Difference]: Finished difference Result 497 states and 638 transitions. [2023-02-15 22:45:22,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 22:45:22,058 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2023-02-15 22:45:22,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:22,060 INFO L225 Difference]: With dead ends: 497 [2023-02-15 22:45:22,060 INFO L226 Difference]: Without dead ends: 393 [2023-02-15 22:45:22,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=334, Unknown=0, NotChecked=0, Total=552 [2023-02-15 22:45:22,065 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 355 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:22,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 651 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:45:22,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2023-02-15 22:45:22,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 165. [2023-02-15 22:45:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 138 states have (on average 1.4057971014492754) internal successors, (194), 157 states have internal predecessors, (194), 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-15 22:45:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 202 transitions. [2023-02-15 22:45:22,087 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 202 transitions. Word has length 37 [2023-02-15 22:45:22,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:22,088 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 202 transitions. [2023-02-15 22:45:22,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 22:45:22,088 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 202 transitions. [2023-02-15 22:45:22,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 22:45:22,092 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:22,092 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2023-02-15 22:45:22,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 22:45:22,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:22,296 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:45:22,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:22,297 INFO L85 PathProgramCache]: Analyzing trace with hash -645266335, now seen corresponding path program 1 times [2023-02-15 22:45:22,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:22,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012452028] [2023-02-15 22:45:22,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:22,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:22,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:22,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:22,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:45:22,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:22,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012452028] [2023-02-15 22:45:22,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012452028] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:22,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:22,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:45:22,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615471659] [2023-02-15 22:45:22,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:22,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:45:22,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:22,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:45:22,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:45:22,356 INFO L87 Difference]: Start difference. First operand 165 states and 202 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-15 22:45:22,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:22,420 INFO L93 Difference]: Finished difference Result 216 states and 266 transitions. [2023-02-15 22:45:22,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:45:22,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 39 [2023-02-15 22:45:22,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:22,423 INFO L225 Difference]: With dead ends: 216 [2023-02-15 22:45:22,423 INFO L226 Difference]: Without dead ends: 213 [2023-02-15 22:45:22,424 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-15 22:45:22,425 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 149 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:22,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 326 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:22,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-02-15 22:45:22,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 192. [2023-02-15 22:45:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 164 states have (on average 1.4268292682926829) internal successors, (234), 183 states have internal predecessors, (234), 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-15 22:45:22,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 242 transitions. [2023-02-15 22:45:22,433 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 242 transitions. Word has length 39 [2023-02-15 22:45:22,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:22,433 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 242 transitions. [2023-02-15 22:45:22,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-15 22:45:22,433 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 242 transitions. [2023-02-15 22:45:22,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 22:45:22,436 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:22,436 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 22:45:22,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 22:45:22,437 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:45:22,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:22,437 INFO L85 PathProgramCache]: Analyzing trace with hash -673893691, now seen corresponding path program 1 times [2023-02-15 22:45:22,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:22,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945500158] [2023-02-15 22:45:22,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:22,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:22,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:22,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:45:22,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:22,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945500158] [2023-02-15 22:45:22,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945500158] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:22,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:22,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:45:22,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054385508] [2023-02-15 22:45:22,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:22,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:45:22,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:22,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:45:22,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:45:22,503 INFO L87 Difference]: Start difference. First operand 192 states and 242 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-15 22:45:22,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:22,568 INFO L93 Difference]: Finished difference Result 214 states and 265 transitions. [2023-02-15 22:45:22,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:45:22,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 39 [2023-02-15 22:45:22,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:22,570 INFO L225 Difference]: With dead ends: 214 [2023-02-15 22:45:22,570 INFO L226 Difference]: Without dead ends: 211 [2023-02-15 22:45:22,570 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-15 22:45:22,571 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 156 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:22,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 314 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:22,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-02-15 22:45:22,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 198. [2023-02-15 22:45:22,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 171 states have (on average 1.409356725146199) internal successors, (241), 189 states have internal predecessors, (241), 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-15 22:45:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 249 transitions. [2023-02-15 22:45:22,582 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 249 transitions. Word has length 39 [2023-02-15 22:45:22,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:22,583 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 249 transitions. [2023-02-15 22:45:22,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-15 22:45:22,583 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2023-02-15 22:45:22,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 22:45:22,588 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:22,588 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 22:45:22,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 22:45:22,588 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:45:22,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:22,589 INFO L85 PathProgramCache]: Analyzing trace with hash 161766024, now seen corresponding path program 1 times [2023-02-15 22:45:22,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:22,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704629956] [2023-02-15 22:45:22,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:22,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:22,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:22,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:45:22,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:22,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704629956] [2023-02-15 22:45:22,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704629956] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:22,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:22,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:45:22,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943551996] [2023-02-15 22:45:22,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:22,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:45:22,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:22,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:45:22,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:45:22,706 INFO L87 Difference]: Start difference. First operand 198 states and 249 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:45:22,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:22,760 INFO L93 Difference]: Finished difference Result 424 states and 537 transitions. [2023-02-15 22:45:22,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:45:22,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2023-02-15 22:45:22,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:22,761 INFO L225 Difference]: With dead ends: 424 [2023-02-15 22:45:22,761 INFO L226 Difference]: Without dead ends: 281 [2023-02-15 22:45:22,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:45:22,762 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 88 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:22,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 214 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:22,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-02-15 22:45:22,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 198. [2023-02-15 22:45:22,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 171 states have (on average 1.4035087719298245) internal successors, (240), 189 states have internal predecessors, (240), 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-15 22:45:22,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 248 transitions. [2023-02-15 22:45:22,771 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 248 transitions. Word has length 44 [2023-02-15 22:45:22,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:22,771 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 248 transitions. [2023-02-15 22:45:22,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:45:22,771 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 248 transitions. [2023-02-15 22:45:22,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 22:45:22,771 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:22,771 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 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] [2023-02-15 22:45:22,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 22:45:22,771 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:45:22,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:22,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1469984120, now seen corresponding path program 1 times [2023-02-15 22:45:22,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:22,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795810517] [2023-02-15 22:45:22,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:22,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:22,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:22,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:22,871 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:45:22,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:22,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795810517] [2023-02-15 22:45:22,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795810517] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:22,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19423390] [2023-02-15 22:45:22,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:22,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:22,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:22,873 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-15 22:45:22,875 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-15 22:45:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:22,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:45:22,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:45:22,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:23,099 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:45:23,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19423390] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:23,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:45:23,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-02-15 22:45:23,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983279190] [2023-02-15 22:45:23,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:23,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 22:45:23,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:23,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 22:45:23,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:45:23,102 INFO L87 Difference]: Start difference. First operand 198 states and 248 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 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-15 22:45:23,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:23,538 INFO L93 Difference]: Finished difference Result 526 states and 665 transitions. [2023-02-15 22:45:23,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 22:45:23,538 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 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 49 [2023-02-15 22:45:23,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:23,540 INFO L225 Difference]: With dead ends: 526 [2023-02-15 22:45:23,540 INFO L226 Difference]: Without dead ends: 369 [2023-02-15 22:45:23,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=186, Unknown=0, NotChecked=0, Total=306 [2023-02-15 22:45:23,540 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 184 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:23,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 633 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:23,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2023-02-15 22:45:23,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 188. [2023-02-15 22:45:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 161 states have (on average 1.3850931677018634) internal successors, (223), 179 states have internal predecessors, (223), 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-15 22:45:23,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 231 transitions. [2023-02-15 22:45:23,553 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 231 transitions. Word has length 49 [2023-02-15 22:45:23,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:23,553 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 231 transitions. [2023-02-15 22:45:23,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 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-15 22:45:23,553 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 231 transitions. [2023-02-15 22:45:23,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-15 22:45:23,554 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:23,554 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, 1, 1, 1, 1] [2023-02-15 22:45:23,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 22:45:23,758 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,SelfDestructingSolverStorable11 [2023-02-15 22:45:23,759 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:45:23,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:23,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1370409216, now seen corresponding path program 1 times [2023-02-15 22:45:23,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:23,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924494489] [2023-02-15 22:45:23,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:23,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:23,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:23,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:23,886 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-15 22:45:23,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:23,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924494489] [2023-02-15 22:45:23,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924494489] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:23,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159774474] [2023-02-15 22:45:23,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:23,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:23,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:23,889 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-15 22:45:23,891 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-15 22:45:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:23,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:45:23,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:24,042 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-15 22:45:24,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:24,247 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-15 22:45:24,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159774474] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:24,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:45:24,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2023-02-15 22:45:24,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879016574] [2023-02-15 22:45:24,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:24,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 22:45:24,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:24,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 22:45:24,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2023-02-15 22:45:24,252 INFO L87 Difference]: Start difference. First operand 188 states and 231 transitions. Second operand has 26 states, 26 states have (on average 5.038461538461538) internal successors, (131), 26 states have internal predecessors, (131), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 22:45:24,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:24,764 INFO L93 Difference]: Finished difference Result 1144 states and 1479 transitions. [2023-02-15 22:45:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-15 22:45:24,765 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.038461538461538) internal successors, (131), 26 states have internal predecessors, (131), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2023-02-15 22:45:24,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:24,768 INFO L225 Difference]: With dead ends: 1144 [2023-02-15 22:45:24,768 INFO L226 Difference]: Without dead ends: 1007 [2023-02-15 22:45:24,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=740, Invalid=1152, Unknown=0, NotChecked=0, Total=1892 [2023-02-15 22:45:24,769 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 873 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:24,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 583 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:45:24,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2023-02-15 22:45:24,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 238. [2023-02-15 22:45:24,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 211 states have (on average 1.3459715639810426) internal successors, (284), 229 states have internal predecessors, (284), 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-15 22:45:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 292 transitions. [2023-02-15 22:45:24,808 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 292 transitions. Word has length 62 [2023-02-15 22:45:24,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:24,808 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 292 transitions. [2023-02-15 22:45:24,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.038461538461538) internal successors, (131), 26 states have internal predecessors, (131), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 22:45:24,808 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 292 transitions. [2023-02-15 22:45:24,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-02-15 22:45:24,809 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:24,809 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 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] [2023-02-15 22:45:24,816 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-15 22:45:25,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:25,014 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:45:25,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:25,014 INFO L85 PathProgramCache]: Analyzing trace with hash 680252040, now seen corresponding path program 2 times [2023-02-15 22:45:25,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:25,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081129453] [2023-02-15 22:45:25,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:25,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:25,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:25,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:25,185 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:45:25,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:25,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081129453] [2023-02-15 22:45:25,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081129453] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:25,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969477341] [2023-02-15 22:45:25,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:45:25,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:25,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:25,187 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-15 22:45:25,189 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-15 22:45:25,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:45:25,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:45:25,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 22:45:25,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:25,354 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:45:25,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:25,560 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:45:25,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969477341] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:25,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:45:25,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-02-15 22:45:25,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246726718] [2023-02-15 22:45:25,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:25,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 22:45:25,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:25,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 22:45:25,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2023-02-15 22:45:25,562 INFO L87 Difference]: Start difference. First operand 238 states and 292 transitions. Second operand has 25 states, 25 states have (on average 5.64) internal successors, (141), 25 states have internal predecessors, (141), 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-15 22:45:36,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:36,702 INFO L93 Difference]: Finished difference Result 726 states and 917 transitions. [2023-02-15 22:45:36,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 22:45:36,703 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.64) internal successors, (141), 25 states have internal predecessors, (141), 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 69 [2023-02-15 22:45:36,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:36,704 INFO L225 Difference]: With dead ends: 726 [2023-02-15 22:45:36,705 INFO L226 Difference]: Without dead ends: 569 [2023-02-15 22:45:36,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=503, Invalid=902, Unknown=1, NotChecked=0, Total=1406 [2023-02-15 22:45:36,706 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 338 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:36,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1611 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 22:45:36,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2023-02-15 22:45:36,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 228. [2023-02-15 22:45:36,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 201 states have (on average 1.308457711442786) internal successors, (263), 219 states have internal predecessors, (263), 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-15 22:45:36,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 271 transitions. [2023-02-15 22:45:36,721 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 271 transitions. Word has length 69 [2023-02-15 22:45:36,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:36,721 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 271 transitions. [2023-02-15 22:45:36,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.64) internal successors, (141), 25 states have internal predecessors, (141), 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-15 22:45:36,721 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 271 transitions. [2023-02-15 22:45:36,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-02-15 22:45:36,722 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:36,722 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, 1, 1, 1, 1] [2023-02-15 22:45:36,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-15 22:45:36,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:36,927 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:45:36,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:36,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1831155456, now seen corresponding path program 2 times [2023-02-15 22:45:36,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:36,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181105166] [2023-02-15 22:45:36,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:36,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:37,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:37,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:37,329 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-15 22:45:37,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:37,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181105166] [2023-02-15 22:45:37,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181105166] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:37,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323095357] [2023-02-15 22:45:37,329 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:45:37,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:37,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:37,333 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-15 22:45:37,335 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-15 22:45:37,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:45:37,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:45:37,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 22:45:37,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:37,617 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-15 22:45:37,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:38,288 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-15 22:45:38,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323095357] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:38,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:45:38,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2023-02-15 22:45:38,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413477336] [2023-02-15 22:45:38,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:38,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-15 22:45:38,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:38,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-15 22:45:38,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2023-02-15 22:45:38,291 INFO L87 Difference]: Start difference. First operand 228 states and 271 transitions. Second operand has 50 states, 50 states have (on average 5.02) internal successors, (251), 50 states have internal predecessors, (251), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 22:45:39,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:39,717 INFO L93 Difference]: Finished difference Result 2032 states and 2647 transitions. [2023-02-15 22:45:39,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-02-15 22:45:39,725 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.02) internal successors, (251), 50 states have internal predecessors, (251), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 102 [2023-02-15 22:45:39,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:39,735 INFO L225 Difference]: With dead ends: 2032 [2023-02-15 22:45:39,735 INFO L226 Difference]: Without dead ends: 1895 [2023-02-15 22:45:39,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1826 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2696, Invalid=4276, Unknown=0, NotChecked=0, Total=6972 [2023-02-15 22:45:39,737 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 2351 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 682 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2351 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 682 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:39,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2351 Valid, 1362 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [682 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 22:45:39,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2023-02-15 22:45:39,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 318. [2023-02-15 22:45:39,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 291 states have (on average 1.2783505154639174) internal successors, (372), 309 states have internal predecessors, (372), 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-15 22:45:39,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 380 transitions. [2023-02-15 22:45:39,762 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 380 transitions. Word has length 102 [2023-02-15 22:45:39,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:39,762 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 380 transitions. [2023-02-15 22:45:39,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.02) internal successors, (251), 50 states have internal predecessors, (251), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 22:45:39,763 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 380 transitions. [2023-02-15 22:45:39,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-02-15 22:45:39,763 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:39,763 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 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] [2023-02-15 22:45:39,771 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-15 22:45:39,968 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,SelfDestructingSolverStorable14 [2023-02-15 22:45:39,969 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:45:39,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:39,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2111820424, now seen corresponding path program 3 times [2023-02-15 22:45:39,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:39,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869567812] [2023-02-15 22:45:39,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:39,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:40,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:40,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:40,429 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 16 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:45:40,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:40,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869567812] [2023-02-15 22:45:40,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869567812] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:40,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595336341] [2023-02-15 22:45:40,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 22:45:40,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:40,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:40,431 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-15 22:45:40,433 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-15 22:45:40,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2023-02-15 22:45:40,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:45:40,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-15 22:45:40,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:40,976 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 16 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:45:40,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 16 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:45:41,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595336341] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:41,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:45:41,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 49 [2023-02-15 22:45:41,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271641762] [2023-02-15 22:45:41,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:41,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-15 22:45:41,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:41,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-15 22:45:41,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=617, Invalid=1735, Unknown=0, NotChecked=0, Total=2352 [2023-02-15 22:45:41,653 INFO L87 Difference]: Start difference. First operand 318 states and 380 transitions. Second operand has 49 states, 49 states have (on average 5.326530612244898) internal successors, (261), 49 states have internal predecessors, (261), 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-15 22:46:06,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:46:06,794 INFO L93 Difference]: Finished difference Result 1046 states and 1320 transitions. [2023-02-15 22:46:06,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-15 22:46:06,796 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 5.326530612244898) internal successors, (261), 49 states have internal predecessors, (261), 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 109 [2023-02-15 22:46:06,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:46:06,798 INFO L225 Difference]: With dead ends: 1046 [2023-02-15 22:46:06,798 INFO L226 Difference]: Without dead ends: 889 [2023-02-15 22:46:06,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1223 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=1619, Invalid=3632, Unknown=5, NotChecked=0, Total=5256 [2023-02-15 22:46:06,800 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 842 mSDsluCounter, 3606 mSDsCounter, 0 mSdLazyCounter, 3053 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 3820 SdHoareTripleChecker+Invalid, 3100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 3053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:46:06,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 3820 Invalid, 3100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 3053 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-02-15 22:46:06,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2023-02-15 22:46:06,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 318. [2023-02-15 22:46:06,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 291 states have (on average 1.2439862542955327) internal successors, (362), 309 states have internal predecessors, (362), 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-15 22:46:06,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 370 transitions. [2023-02-15 22:46:06,820 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 370 transitions. Word has length 109 [2023-02-15 22:46:06,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:46:06,820 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 370 transitions. [2023-02-15 22:46:06,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 5.326530612244898) internal successors, (261), 49 states have internal predecessors, (261), 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-15 22:46:06,820 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 370 transitions. [2023-02-15 22:46:06,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-02-15 22:46:06,821 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:46:06,821 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 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] [2023-02-15 22:46:06,828 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-15 22:46:07,026 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,SelfDestructingSolverStorable15 [2023-02-15 22:46:07,026 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:46:07,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:46:07,027 INFO L85 PathProgramCache]: Analyzing trace with hash 803787400, now seen corresponding path program 4 times [2023-02-15 22:46:07,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:46:07,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894062918] [2023-02-15 22:46:07,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:46:07,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:46:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:46:07,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 22:46:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:46:07,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 22:46:07,098 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 22:46:07,099 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2023-02-15 22:46:07,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2023-02-15 22:46:07,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2023-02-15 22:46:07,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2023-02-15 22:46:07,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2023-02-15 22:46:07,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2023-02-15 22:46:07,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2023-02-15 22:46:07,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2023-02-15 22:46:07,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2023-02-15 22:46:07,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2023-02-15 22:46:07,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2023-02-15 22:46:07,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2023-02-15 22:46:07,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2023-02-15 22:46:07,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2023-02-15 22:46:07,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2023-02-15 22:46:07,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2023-02-15 22:46:07,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2023-02-15 22:46:07,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2023-02-15 22:46:07,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2023-02-15 22:46:07,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2023-02-15 22:46:07,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2023-02-15 22:46:07,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2023-02-15 22:46:07,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2023-02-15 22:46:07,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2023-02-15 22:46:07,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 22:46:07,106 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:46:07,109 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 22:46:07,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:46:07 BoogieIcfgContainer [2023-02-15 22:46:07,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 22:46:07,172 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 22:46:07,172 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 22:46:07,173 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 22:46:07,173 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:45:20" (3/4) ... [2023-02-15 22:46:07,175 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 22:46:07,175 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 22:46:07,175 INFO L158 Benchmark]: Toolchain (without parser) took 47870.28ms. Allocated memory was 203.4MB in the beginning and 310.4MB in the end (delta: 107.0MB). Free memory was 164.4MB in the beginning and 170.5MB in the end (delta: -6.1MB). Peak memory consumption was 101.6MB. Max. memory is 16.1GB. [2023-02-15 22:46:07,176 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:46:07,176 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.52ms. Allocated memory is still 203.4MB. Free memory was 164.4MB in the beginning and 150.4MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 22:46:07,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.81ms. Allocated memory is still 203.4MB. Free memory was 150.4MB in the beginning and 148.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 22:46:07,176 INFO L158 Benchmark]: Boogie Preprocessor took 44.59ms. Allocated memory is still 203.4MB. Free memory was 148.3MB in the beginning and 146.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 22:46:07,177 INFO L158 Benchmark]: RCFGBuilder took 418.53ms. Allocated memory is still 203.4MB. Free memory was 146.6MB in the beginning and 124.2MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-02-15 22:46:07,178 INFO L158 Benchmark]: TraceAbstraction took 47087.84ms. Allocated memory was 203.4MB in the beginning and 310.4MB in the end (delta: 107.0MB). Free memory was 123.6MB in the beginning and 170.5MB in the end (delta: -46.9MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. [2023-02-15 22:46:07,178 INFO L158 Benchmark]: Witness Printer took 2.61ms. Allocated memory is still 310.4MB. Free memory is still 170.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:46:07,180 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.14ms. Allocated memory is still 134.2MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.52ms. Allocated memory is still 203.4MB. Free memory was 164.4MB in the beginning and 150.4MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.81ms. Allocated memory is still 203.4MB. Free memory was 150.4MB in the beginning and 148.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.59ms. Allocated memory is still 203.4MB. Free memory was 148.3MB in the beginning and 146.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 418.53ms. Allocated memory is still 203.4MB. Free memory was 146.6MB in the beginning and 124.2MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 47087.84ms. Allocated memory was 203.4MB in the beginning and 310.4MB in the end (delta: 107.0MB). Free memory was 123.6MB in the beginning and 170.5MB in the end (delta: -46.9MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. * Witness Printer took 2.61ms. Allocated memory is still 310.4MB. Free memory is still 170.5MB. 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: 77]: 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. 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 sb ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; VAL [ea=0, eb=0] [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=0, eb=0] [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] EXPR (e + 128) << 24U 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=0, eb=0, zero=0] [L239] one = base2flt(1, 0) [L240] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] - 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: 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: 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. - 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. - 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, 121 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 47.0s, OverallIterations: 17, TraceHistogramMax: 24, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 39.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5714 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5708 mSDsluCounter, 11804 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9909 mSDsCounter, 1078 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6213 IncrementalHoareTripleChecker+Invalid, 7291 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1078 mSolverCounterUnsat, 1895 mSDtfsCounter, 6213 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1176 GetRequests, 870 SyntacticMatches, 3 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4069 ImplicationChecksByTransitivity, 36.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=15, InterpolantAutomatonStates: 252, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 3849 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1268 NumberOfCodeBlocks, 1268 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1509 ConstructedInterpolants, 0 QuantifiedInterpolants, 7845 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1009 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 28 InterpolantComputations, 10 PerfectInterpolantSequences, 304/3646 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-15 22:46:07,246 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_3.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 aa6f3ffe66f40e883b6b9462d3d92566e122af5c88e351ce665cbb8a404d0554 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:46:08,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:46:08,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:46:08,997 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:46:08,997 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:46:08,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:46:09,000 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:46:09,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:46:09,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:46:09,008 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:46:09,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:46:09,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:46:09,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:46:09,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:46:09,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:46:09,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:46:09,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:46:09,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:46:09,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:46:09,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:46:09,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:46:09,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:46:09,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:46:09,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:46:09,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:46:09,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:46:09,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:46:09,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:46:09,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:46:09,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:46:09,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:46:09,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:46:09,033 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:46:09,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:46:09,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:46:09,034 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:46:09,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:46:09,035 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:46:09,035 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:46:09,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:46:09,036 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:46:09,037 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2023-02-15 22:46:09,069 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:46:09,069 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:46:09,070 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:46:09,070 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:46:09,071 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:46:09,071 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:46:09,071 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:46:09,072 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:46:09,072 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:46:09,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:46:09,072 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:46:09,073 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:46:09,073 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:46:09,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:46:09,073 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 22:46:09,073 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:46:09,073 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 22:46:09,073 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:46:09,073 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 22:46:09,073 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-15 22:46:09,073 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 22:46:09,073 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:46:09,074 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 22:46:09,074 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:46:09,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 22:46:09,074 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:46:09,074 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:46:09,074 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:46:09,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:46:09,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:46:09,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:46:09,074 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 22:46:09,075 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 22:46:09,075 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 22:46:09,075 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:46:09,075 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 22:46:09,075 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:46:09,075 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:46:09,075 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 22:46:09,075 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:46:09,075 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 -> aa6f3ffe66f40e883b6b9462d3d92566e122af5c88e351ce665cbb8a404d0554 [2023-02-15 22:46:09,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:46:09,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:46:09,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:46:09,343 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:46:09,344 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:46:09,345 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_3.c.cil.c [2023-02-15 22:46:10,280 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:46:10,458 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:46:10,459 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_3.c.cil.c [2023-02-15 22:46:10,464 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7bf327f7/497479028feb405990f747e79becddc5/FLAG9f10ad9dc [2023-02-15 22:46:10,473 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7bf327f7/497479028feb405990f747e79becddc5 [2023-02-15 22:46:10,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:46:10,475 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:46:10,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:46:10,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:46:10,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:46:10,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:46:10" (1/1) ... [2023-02-15 22:46:10,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4707d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:46:10, skipping insertion in model container [2023-02-15 22:46:10,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:46:10" (1/1) ... [2023-02-15 22:46:10,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:46:10,502 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:46:10,602 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_3.c.cil.c[727,740] [2023-02-15 22:46:10,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:46:10,665 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:46:10,675 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_3.c.cil.c[727,740] [2023-02-15 22:46:10,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:46:10,723 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:46:10,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:46:10 WrapperNode [2023-02-15 22:46:10,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:46:10,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:46:10,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:46:10,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:46:10,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:46:10" (1/1) ... [2023-02-15 22:46:10,745 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:46:10" (1/1) ... [2023-02-15 22:46:10,768 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 125 [2023-02-15 22:46:10,769 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:46:10,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:46:10,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:46:10,770 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:46:10,776 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:46:10" (1/1) ... [2023-02-15 22:46:10,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:46:10" (1/1) ... [2023-02-15 22:46:10,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:46:10" (1/1) ... [2023-02-15 22:46:10,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:46:10" (1/1) ... [2023-02-15 22:46:10,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:46:10" (1/1) ... [2023-02-15 22:46:10,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:46:10" (1/1) ... [2023-02-15 22:46:10,810 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:46:10" (1/1) ... [2023-02-15 22:46:10,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:46:10" (1/1) ... [2023-02-15 22:46:10,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:46:10,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:46:10,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:46:10,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:46:10,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:46:10" (1/1) ... [2023-02-15 22:46:10,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:46:10,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:46:10,845 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-15 22:46:10,864 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-15 22:46:10,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:46:10,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 22:46:10,884 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-15 22:46:10,884 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-15 22:46:10,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:46:10,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:46:10,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 22:46:10,884 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 22:46:10,951 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:46:10,953 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:46:11,262 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:46:11,267 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:46:11,267 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 22:46:11,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:46:11 BoogieIcfgContainer [2023-02-15 22:46:11,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:46:11,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:46:11,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:46:11,271 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:46:11,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:46:10" (1/3) ... [2023-02-15 22:46:11,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ead08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:46:11, skipping insertion in model container [2023-02-15 22:46:11,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:46:10" (2/3) ... [2023-02-15 22:46:11,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ead08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:46:11, skipping insertion in model container [2023-02-15 22:46:11,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:46:11" (3/3) ... [2023-02-15 22:46:11,273 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_3.c.cil.c [2023-02-15 22:46:11,283 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:46:11,284 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-02-15 22:46:11,313 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:46:11,316 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;@4e902c39, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:46:11,317 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-02-15 22:46:11,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 66 states have (on average 1.7121212121212122) internal successors, (113), 91 states have internal predecessors, (113), 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-15 22:46:11,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 22:46:11,325 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:46:11,325 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:46:11,326 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:46:11,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:46:11,332 INFO L85 PathProgramCache]: Analyzing trace with hash 638430033, now seen corresponding path program 1 times [2023-02-15 22:46:11,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:46:11,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610959151] [2023-02-15 22:46:11,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:46:11,340 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-15 22:46:11,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:46:11,342 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-15 22:46:11,343 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-15 22:46:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:11,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 22:46:11,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:46:11,407 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-15 22:46:11,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:46:11,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:46:11,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610959151] [2023-02-15 22:46:11,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610959151] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:46:11,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:46:11,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-15 22:46:11,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919287033] [2023-02-15 22:46:11,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:46:11,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 22:46:11,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:46:11,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 22:46:11,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 22:46:11,446 INFO L87 Difference]: Start difference. First operand has 98 states, 66 states have (on average 1.7121212121212122) internal successors, (113), 91 states have internal predecessors, (113), 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-15 22:46:11,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:46:11,479 INFO L93 Difference]: Finished difference Result 183 states and 247 transitions. [2023-02-15 22:46:11,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 22:46:11,481 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-15 22:46:11,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:46:11,486 INFO L225 Difference]: With dead ends: 183 [2023-02-15 22:46:11,486 INFO L226 Difference]: Without dead ends: 69 [2023-02-15 22:46:11,488 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-15 22:46:11,490 INFO L413 NwaCegarLoop]: 108 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, 108 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-15 22:46:11,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:46:11,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-15 22:46:11,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-02-15 22:46:11,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.42) internal successors, (71), 63 states have internal predecessors, (71), 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-15 22:46:11,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2023-02-15 22:46:11,517 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 9 [2023-02-15 22:46:11,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:46:11,517 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2023-02-15 22:46:11,518 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-15 22:46:11,518 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2023-02-15 22:46:11,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 22:46:11,519 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:46:11,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:46:11,526 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-15 22:46:11,720 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-15 22:46:11,720 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:46:11,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:46:11,721 INFO L85 PathProgramCache]: Analyzing trace with hash 637488767, now seen corresponding path program 1 times [2023-02-15 22:46:11,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:46:11,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012461194] [2023-02-15 22:46:11,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:46:11,722 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-15 22:46:11,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:46:11,723 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-15 22:46:11,725 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-15 22:46:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:11,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 22:46:11,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:46:11,797 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-15 22:46:11,797 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:46:11,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:46:11,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012461194] [2023-02-15 22:46:11,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012461194] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:46:11,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:46:11,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:46:11,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81835625] [2023-02-15 22:46:11,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:46:11,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:46:11,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:46:11,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:46:11,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:46:11,800 INFO L87 Difference]: Start difference. First operand 69 states and 79 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-15 22:46:11,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:46:11,860 INFO L93 Difference]: Finished difference Result 143 states and 165 transitions. [2023-02-15 22:46:11,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:46:11,861 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-15 22:46:11,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:46:11,863 INFO L225 Difference]: With dead ends: 143 [2023-02-15 22:46:11,865 INFO L226 Difference]: Without dead ends: 77 [2023-02-15 22:46:11,866 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-15 22:46:11,867 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 9 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 214 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-15 22:46:11,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 214 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:46:11,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-15 22:46:11,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2023-02-15 22:46:11,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 67 states have internal predecessors, (75), 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-15 22:46:11,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2023-02-15 22:46:11,878 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 9 [2023-02-15 22:46:11,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:46:11,878 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2023-02-15 22:46:11,878 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-15 22:46:11,878 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2023-02-15 22:46:11,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 22:46:11,879 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:46:11,879 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:46:11,889 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-15 22:46:12,089 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-15 22:46:12,089 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:46:12,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:46:12,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1499029201, now seen corresponding path program 1 times [2023-02-15 22:46:12,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:46:12,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471667444] [2023-02-15 22:46:12,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:46:12,091 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-15 22:46:12,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:46:12,092 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-15 22:46:12,093 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-15 22:46:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:12,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 22:46:12,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:46:12,168 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-15 22:46:12,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:46:12,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:46:12,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471667444] [2023-02-15 22:46:12,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471667444] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:46:12,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:46:12,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:46:12,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106796146] [2023-02-15 22:46:12,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:46:12,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:46:12,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:46:12,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:46:12,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:46:12,170 INFO L87 Difference]: Start difference. First operand 74 states and 83 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-15 22:46:12,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:46:12,245 INFO L93 Difference]: Finished difference Result 185 states and 216 transitions. [2023-02-15 22:46:12,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:46:12,246 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-15 22:46:12,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:46:12,247 INFO L225 Difference]: With dead ends: 185 [2023-02-15 22:46:12,247 INFO L226 Difference]: Without dead ends: 121 [2023-02-15 22:46:12,248 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-15 22:46:12,248 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 67 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:46:12,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 196 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:46:12,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-15 22:46:12,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 110. [2023-02-15 22:46:12,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 89 states have (on average 1.3820224719101124) internal successors, (123), 102 states have internal predecessors, (123), 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-15 22:46:12,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 131 transitions. [2023-02-15 22:46:12,259 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 131 transitions. Word has length 16 [2023-02-15 22:46:12,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:46:12,259 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 131 transitions. [2023-02-15 22:46:12,259 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-15 22:46:12,259 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 131 transitions. [2023-02-15 22:46:12,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 22:46:12,260 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:46:12,260 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-15 22:46:12,269 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-15 22:46:12,464 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-15 22:46:12,465 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:46:12,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:46:12,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1438968756, now seen corresponding path program 1 times [2023-02-15 22:46:12,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:46:12,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757298677] [2023-02-15 22:46:12,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:46:12,466 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-15 22:46:12,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:46:12,469 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-15 22:46:12,470 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-15 22:46:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:12,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 22:46:12,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:46:12,565 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-15 22:46:12,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:46:12,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:46:12,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757298677] [2023-02-15 22:46:12,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757298677] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:46:12,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:46:12,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:46:12,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927666109] [2023-02-15 22:46:12,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:46:12,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:46:12,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:46:12,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:46:12,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:46:12,569 INFO L87 Difference]: Start difference. First operand 110 states and 131 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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-15 22:46:12,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:46:12,629 INFO L93 Difference]: Finished difference Result 189 states and 217 transitions. [2023-02-15 22:46:12,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:46:12,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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-15 22:46:12,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:46:12,631 INFO L225 Difference]: With dead ends: 189 [2023-02-15 22:46:12,631 INFO L226 Difference]: Without dead ends: 100 [2023-02-15 22:46:12,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-15 22:46:12,632 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 31 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:46:12,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 217 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:46:12,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-15 22:46:12,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2023-02-15 22:46:12,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 86 states have internal predecessors, (101), 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-15 22:46:12,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2023-02-15 22:46:12,638 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 21 [2023-02-15 22:46:12,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:46:12,638 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2023-02-15 22:46:12,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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-15 22:46:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2023-02-15 22:46:12,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 22:46:12,638 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:46:12,639 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-15 22:46:12,648 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-15 22:46:12,849 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-15 22:46:12,852 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:46:12,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:46:12,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1597331601, now seen corresponding path program 1 times [2023-02-15 22:46:12,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:46:12,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807325143] [2023-02-15 22:46:12,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:46:12,853 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-15 22:46:12,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:46:12,855 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-15 22:46:12,857 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-15 22:46:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:12,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:46:12,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:46:12,924 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-15 22:46:12,924 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:46:12,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:46:12,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807325143] [2023-02-15 22:46:12,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807325143] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:46:12,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:46:12,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:46:12,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300241044] [2023-02-15 22:46:12,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:46:12,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:46:12,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:46:12,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:46:12,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:46:12,926 INFO L87 Difference]: Start difference. First operand 94 states and 109 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-15 22:46:12,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:46:12,982 INFO L93 Difference]: Finished difference Result 182 states and 206 transitions. [2023-02-15 22:46:12,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:46:12,983 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-15 22:46:12,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:46:12,985 INFO L225 Difference]: With dead ends: 182 [2023-02-15 22:46:12,985 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 22:46:12,987 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-15 22:46:12,991 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 44 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:46:12,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 286 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:46:12,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 22:46:13,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 96. [2023-02-15 22:46:13,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 88 states have internal predecessors, (103), 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-15 22:46:13,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2023-02-15 22:46:13,008 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 21 [2023-02-15 22:46:13,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:46:13,008 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2023-02-15 22:46:13,008 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-15 22:46:13,008 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2023-02-15 22:46:13,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 22:46:13,009 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:46:13,009 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-15 22:46:13,018 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-15 22:46:13,209 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-15 22:46:13,210 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:46:13,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:46:13,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1597440705, now seen corresponding path program 1 times [2023-02-15 22:46:13,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:46:13,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619276079] [2023-02-15 22:46:13,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:46:13,210 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-15 22:46:13,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:46:13,211 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-15 22:46:13,212 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-15 22:46:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:13,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:46:13,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:46:13,265 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-15 22:46:13,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:46:13,385 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-15 22:46:13,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:46:13,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619276079] [2023-02-15 22:46:13,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619276079] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:46:13,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:46:13,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-02-15 22:46:13,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009156147] [2023-02-15 22:46:13,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:46:13,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:46:13,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:46:13,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:46:13,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:46:13,387 INFO L87 Difference]: Start difference. First operand 96 states and 111 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-15 22:46:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:46:13,774 INFO L93 Difference]: Finished difference Result 209 states and 245 transitions. [2023-02-15 22:46:13,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:46:13,775 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-15 22:46:13,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:46:13,776 INFO L225 Difference]: With dead ends: 209 [2023-02-15 22:46:13,776 INFO L226 Difference]: Without dead ends: 142 [2023-02-15 22:46:13,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2023-02-15 22:46:13,777 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 195 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:46:13,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 287 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:46:13,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-02-15 22:46:13,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 97. [2023-02-15 22:46:13,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 89 states have internal predecessors, (103), 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-15 22:46:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2023-02-15 22:46:13,784 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 21 [2023-02-15 22:46:13,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:46:13,784 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2023-02-15 22:46:13,784 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-15 22:46:13,785 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2023-02-15 22:46:13,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 22:46:13,785 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:46:13,785 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-15 22:46:13,800 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-15 22:46:13,991 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-15 22:46:13,991 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:46:13,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:46:13,992 INFO L85 PathProgramCache]: Analyzing trace with hash -988850849, now seen corresponding path program 1 times [2023-02-15 22:46:13,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:46:13,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200032527] [2023-02-15 22:46:13,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:46:13,992 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-15 22:46:13,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:46:13,993 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-15 22:46:13,994 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-15 22:46:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:14,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:46:14,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:46:14,056 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-15 22:46:14,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:46:14,105 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-15 22:46:14,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:46:14,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200032527] [2023-02-15 22:46:14,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200032527] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:46:14,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:46:14,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-15 22:46:14,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248406657] [2023-02-15 22:46:14,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:46:14,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:46:14,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:46:14,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:46:14,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:46:14,107 INFO L87 Difference]: Start difference. First operand 97 states and 111 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-15 22:46:14,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:46:14,252 INFO L93 Difference]: Finished difference Result 209 states and 240 transitions. [2023-02-15 22:46:14,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 22:46:14,252 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-15 22:46:14,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:46:14,253 INFO L225 Difference]: With dead ends: 209 [2023-02-15 22:46:14,253 INFO L226 Difference]: Without dead ends: 137 [2023-02-15 22:46:14,253 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-15 22:46:14,254 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 158 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:46:14,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 417 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:46:14,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-15 22:46:14,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 115. [2023-02-15 22:46:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.305263157894737) internal successors, (124), 107 states have internal predecessors, (124), 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-15 22:46:14,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2023-02-15 22:46:14,276 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 26 [2023-02-15 22:46:14,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:46:14,277 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2023-02-15 22:46:14,277 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-15 22:46:14,277 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2023-02-15 22:46:14,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 22:46:14,278 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:46:14,278 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-15 22:46:14,287 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 (8)] Forceful destruction successful, exit code 0 [2023-02-15 22:46:14,484 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-15 22:46:14,484 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:46:14,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:46:14,485 INFO L85 PathProgramCache]: Analyzing trace with hash 411281957, now seen corresponding path program 1 times [2023-02-15 22:46:14,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:46:14,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191473168] [2023-02-15 22:46:14,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:46:14,485 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-15 22:46:14,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:46:14,486 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-15 22:46:14,487 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-15 22:46:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:14,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:46:14,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:46:14,580 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-15 22:46:14,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:46:14,757 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-15 22:46:14,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:46:14,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191473168] [2023-02-15 22:46:14,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191473168] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:46:14,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:46:14,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-15 22:46:14,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017112415] [2023-02-15 22:46:14,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:46:14,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:46:14,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:46:14,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:46:14,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:46:14,758 INFO L87 Difference]: Start difference. First operand 115 states and 132 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-15 22:46:15,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:46:15,184 INFO L93 Difference]: Finished difference Result 299 states and 358 transitions. [2023-02-15 22:46:15,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 22:46:15,185 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-15 22:46:15,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:46:15,186 INFO L225 Difference]: With dead ends: 299 [2023-02-15 22:46:15,186 INFO L226 Difference]: Without dead ends: 230 [2023-02-15 22:46:15,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2023-02-15 22:46:15,187 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 164 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:46:15,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 440 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:46:15,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-02-15 22:46:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 117. [2023-02-15 22:46:15,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.268041237113402) internal successors, (123), 109 states have internal predecessors, (123), 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-15 22:46:15,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2023-02-15 22:46:15,204 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 38 [2023-02-15 22:46:15,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:46:15,205 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2023-02-15 22:46:15,205 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-15 22:46:15,206 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2023-02-15 22:46:15,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:46:15,208 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:46:15,208 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-15 22:46:15,227 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-15 22:46:15,427 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-15 22:46:15,427 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:46:15,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:46:15,428 INFO L85 PathProgramCache]: Analyzing trace with hash 472901983, now seen corresponding path program 2 times [2023-02-15 22:46:15,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:46:15,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883855552] [2023-02-15 22:46:15,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:46:15,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-15 22:46:15,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:46:15,429 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-15 22:46:15,430 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-15 22:46:15,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:46:15,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:46:15,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 22:46:15,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:46:15,556 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-15 22:46:15,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:46:15,711 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-15 22:46:15,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:46:15,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883855552] [2023-02-15 22:46:15,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883855552] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:46:15,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:46:15,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2023-02-15 22:46:15,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873406471] [2023-02-15 22:46:15,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:46:15,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 22:46:15,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:46:15,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 22:46:15,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2023-02-15 22:46:15,713 INFO L87 Difference]: Start difference. First operand 117 states and 131 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-15 22:46:16,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:46:16,160 INFO L93 Difference]: Finished difference Result 267 states and 308 transitions. [2023-02-15 22:46:16,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 22:46:16,160 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-15 22:46:16,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:46:16,161 INFO L225 Difference]: With dead ends: 267 [2023-02-15 22:46:16,161 INFO L226 Difference]: Without dead ends: 195 [2023-02-15 22:46:16,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=383, Invalid=949, Unknown=0, NotChecked=0, Total=1332 [2023-02-15 22:46:16,162 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 234 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:46:16,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1069 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:46:16,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-02-15 22:46:16,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 155. [2023-02-15 22:46:16,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 135 states have (on average 1.2444444444444445) internal successors, (168), 147 states have internal predecessors, (168), 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-15 22:46:16,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 176 transitions. [2023-02-15 22:46:16,172 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 176 transitions. Word has length 46 [2023-02-15 22:46:16,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:46:16,172 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 176 transitions. [2023-02-15 22:46:16,172 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-15 22:46:16,173 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 176 transitions. [2023-02-15 22:46:16,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 22:46:16,173 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:46:16,173 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-15 22:46:16,184 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-15 22:46:16,380 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-15 22:46:16,380 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:46:16,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:46:16,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2137407013, now seen corresponding path program 2 times [2023-02-15 22:46:16,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:46:16,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26539566] [2023-02-15 22:46:16,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:46:16,381 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-15 22:46:16,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:46:16,382 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-15 22:46:16,382 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-15 22:46:16,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 22:46:16,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:46:16,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 22:46:16,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:46:16,410 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-15 22:46:16,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:46:16,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:46:16,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26539566] [2023-02-15 22:46:16,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26539566] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:46:16,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:46:16,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:46:16,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360391644] [2023-02-15 22:46:16,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:46:16,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:46:16,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:46:16,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:46:16,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:46:16,411 INFO L87 Difference]: Start difference. First operand 155 states and 176 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-15 22:46:16,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:46:16,435 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2023-02-15 22:46:16,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:46:16,436 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-15 22:46:16,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:46:16,437 INFO L225 Difference]: With dead ends: 161 [2023-02-15 22:46:16,437 INFO L226 Difference]: Without dead ends: 160 [2023-02-15 22:46:16,437 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-15 22:46:16,437 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:46:16,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 140 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:46:16,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-15 22:46:16,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2023-02-15 22:46:16,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 135 states have (on average 1.237037037037037) internal successors, (167), 146 states have internal predecessors, (167), 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-15 22:46:16,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 175 transitions. [2023-02-15 22:46:16,458 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 175 transitions. Word has length 58 [2023-02-15 22:46:16,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:46:16,458 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 175 transitions. [2023-02-15 22:46:16,458 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-15 22:46:16,458 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 175 transitions. [2023-02-15 22:46:16,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 22:46:16,460 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:46:16,460 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-15 22:46:16,479 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 (11)] Ended with exit code 0 [2023-02-15 22:46:16,665 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-15 22:46:16,665 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:46:16,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:46:16,666 INFO L85 PathProgramCache]: Analyzing trace with hash 2137474539, now seen corresponding path program 1 times [2023-02-15 22:46:16,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:46:16,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800807502] [2023-02-15 22:46:16,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:46:16,666 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-15 22:46:16,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:46:16,667 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-15 22:46:16,669 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-15 22:46:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:46:16,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:46:16,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:46:16,858 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-15 22:46:16,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:46:17,270 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-15 22:46:17,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:46:17,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800807502] [2023-02-15 22:46:17,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800807502] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:46:17,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:46:17,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-02-15 22:46:17,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502755269] [2023-02-15 22:46:17,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:46:17,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 22:46:17,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:46:17,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 22:46:17,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-02-15 22:46:17,271 INFO L87 Difference]: Start difference. First operand 154 states and 175 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-15 22:46:18,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:46:18,891 INFO L93 Difference]: Finished difference Result 476 states and 583 transitions. [2023-02-15 22:46:18,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 22:46:18,892 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-15 22:46:18,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:46:18,893 INFO L225 Difference]: With dead ends: 476 [2023-02-15 22:46:18,893 INFO L226 Difference]: Without dead ends: 408 [2023-02-15 22:46:18,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=343, Invalid=649, Unknown=0, NotChecked=0, Total=992 [2023-02-15 22:46:18,894 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 616 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:46:18,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 844 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-15 22:46:18,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2023-02-15 22:46:18,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 156. [2023-02-15 22:46:18,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 137 states have (on average 1.1824817518248176) internal successors, (162), 148 states have internal predecessors, (162), 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-15 22:46:18,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2023-02-15 22:46:18,908 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 58 [2023-02-15 22:46:18,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:46:18,908 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2023-02-15 22:46:18,908 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-15 22:46:18,908 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2023-02-15 22:46:18,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-15 22:46:18,909 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:46:18,909 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-15 22:46:18,917 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 (12)] Ended with exit code 0 [2023-02-15 22:46:19,115 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-15 22:46:19,115 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:46:19,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:46:19,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1631261023, now seen corresponding path program 3 times [2023-02-15 22:46:19,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:46:19,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819348850] [2023-02-15 22:46:19,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 22:46:19,116 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-15 22:46:19,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:46:19,117 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-15 22:46:19,118 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-15 22:46:19,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2023-02-15 22:46:19,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:46:19,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 22:46:19,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:46:19,379 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-15 22:46:19,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:46:20,003 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-15 22:46:20,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:46:20,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1819348850] [2023-02-15 22:46:20,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1819348850] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:46:20,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:46:20,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2023-02-15 22:46:20,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944027603] [2023-02-15 22:46:20,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:46:20,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 22:46:20,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:46:20,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 22:46:20,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=886, Unknown=0, NotChecked=0, Total=1190 [2023-02-15 22:46:20,005 INFO L87 Difference]: Start difference. First operand 156 states and 170 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-15 22:46:24,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:46:24,571 INFO L93 Difference]: Finished difference Result 556 states and 657 transitions. [2023-02-15 22:46:24,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-02-15 22:46:24,571 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-15 22:46:24,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:46:24,581 INFO L225 Difference]: With dead ends: 556 [2023-02-15 22:46:24,581 INFO L226 Difference]: Without dead ends: 485 [2023-02-15 22:46:24,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2711, Invalid=7189, Unknown=0, NotChecked=0, Total=9900 [2023-02-15 22:46:24,584 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 741 mSDsluCounter, 3387 mSDsCounter, 0 mSdLazyCounter, 1572 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 3620 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:46:24,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 3620 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1572 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 22:46:24,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2023-02-15 22:46:24,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 234. [2023-02-15 22:46:24,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 215 states have (on average 1.1906976744186046) internal successors, (256), 226 states have internal predecessors, (256), 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-15 22:46:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 264 transitions. [2023-02-15 22:46:24,599 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 264 transitions. Word has length 86 [2023-02-15 22:46:24,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:46:24,599 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 264 transitions. [2023-02-15 22:46:24,599 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-15 22:46:24,599 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 264 transitions. [2023-02-15 22:46:24,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-02-15 22:46:24,600 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:46:24,600 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-15 22:46:24,606 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-15 22:46:24,806 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-15 22:46:24,806 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:46:24,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:46:24,807 INFO L85 PathProgramCache]: Analyzing trace with hash 83258859, now seen corresponding path program 2 times [2023-02-15 22:46:24,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:46:24,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278144491] [2023-02-15 22:46:24,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:46:24,807 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-15 22:46:24,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:46:24,808 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-15 22:46:24,809 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-15 22:46:24,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:46:24,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:46:24,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 22:46:24,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:46:25,273 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-15 22:46:25,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:46:26,469 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-15 22:46:26,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:46:26,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278144491] [2023-02-15 22:46:26,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278144491] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:46:26,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:46:26,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2023-02-15 22:46:26,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320842558] [2023-02-15 22:46:26,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:46:26,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-15 22:46:26,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:46:26,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 22:46:26,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2023-02-15 22:46:26,472 INFO L87 Difference]: Start difference. First operand 234 states and 264 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-15 22:46:33,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:46:33,040 INFO L93 Difference]: Finished difference Result 845 states and 1053 transitions. [2023-02-15 22:46:33,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-02-15 22:46:33,042 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-15 22:46:33,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:46:33,045 INFO L225 Difference]: With dead ends: 845 [2023-02-15 22:46:33,045 INFO L226 Difference]: Without dead ends: 777 [2023-02-15 22:46:33,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1327, Invalid=2705, Unknown=0, NotChecked=0, Total=4032 [2023-02-15 22:46:33,046 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 1134 mSDsluCounter, 2279 mSDsCounter, 0 mSdLazyCounter, 4267 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 2421 SdHoareTripleChecker+Invalid, 4546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 4267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:46:33,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 2421 Invalid, 4546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 4267 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-02-15 22:46:33,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2023-02-15 22:46:33,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 236. [2023-02-15 22:46:33,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 217 states have (on average 1.119815668202765) internal successors, (243), 228 states have internal predecessors, (243), 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-15 22:46:33,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 251 transitions. [2023-02-15 22:46:33,071 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 251 transitions. Word has length 98 [2023-02-15 22:46:33,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:46:33,072 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 251 transitions. [2023-02-15 22:46:33,072 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-15 22:46:33,072 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 251 transitions. [2023-02-15 22:46:33,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-02-15 22:46:33,076 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:46:33,076 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-15 22:46:33,113 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-15 22:46:33,282 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-15 22:46:33,283 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:46:33,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:46:33,283 INFO L85 PathProgramCache]: Analyzing trace with hash -598490273, now seen corresponding path program 4 times [2023-02-15 22:46:33,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:46:33,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1708403729] [2023-02-15 22:46:33,284 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 22:46:33,284 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-15 22:46:33,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:46:33,285 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-15 22:46:33,286 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-15 22:46:33,333 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 22:46:33,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:46:33,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-15 22:46:33,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:46:33,741 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-15 22:46:33,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:46:35,632 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-15 22:46:35,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:46:35,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1708403729] [2023-02-15 22:46:35,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1708403729] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:46:35,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:46:35,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2023-02-15 22:46:35,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348071200] [2023-02-15 22:46:35,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:46:35,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-15 22:46:35,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:46:35,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-15 22:46:35,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=731, Invalid=2131, Unknown=0, NotChecked=0, Total=2862 [2023-02-15 22:46:35,635 INFO L87 Difference]: Start difference. First operand 236 states and 251 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-15 22:47:04,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:47:04,959 INFO L93 Difference]: Finished difference Result 486 states and 552 transitions. [2023-02-15 22:47:04,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-02-15 22:47:04,960 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-15 22:47:04,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:47:04,961 INFO L225 Difference]: With dead ends: 486 [2023-02-15 22:47:04,961 INFO L226 Difference]: Without dead ends: 482 [2023-02-15 22:47:04,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=4535, Invalid=12235, Unknown=0, NotChecked=0, Total=16770 [2023-02-15 22:47:04,965 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 996 mSDsluCounter, 4087 mSDsCounter, 0 mSdLazyCounter, 4263 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 4194 SdHoareTripleChecker+Invalid, 4416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 4263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:47:04,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 4194 Invalid, 4416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 4263 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-02-15 22:47:04,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2023-02-15 22:47:05,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 360. [2023-02-15 22:47:05,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 341 states have (on average 1.2082111436950147) internal successors, (412), 352 states have internal predecessors, (412), 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-15 22:47:05,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 420 transitions. [2023-02-15 22:47:05,015 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 420 transitions. Word has length 136 [2023-02-15 22:47:05,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:47:05,015 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 420 transitions. [2023-02-15 22:47:05,015 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-15 22:47:05,015 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 420 transitions. [2023-02-15 22:47:05,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-02-15 22:47:05,016 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:47:05,016 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, 1, 1, 1] [2023-02-15 22:47:05,023 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-15 22:47:05,223 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-15 22:47:05,223 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:47:05,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:47:05,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1598853735, now seen corresponding path program 1 times [2023-02-15 22:47:05,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:47:05,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476668620] [2023-02-15 22:47:05,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:47:05,224 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-15 22:47:05,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:47:05,225 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-15 22:47:05,226 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-15 22:47:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:47:05,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 22:47:05,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:47:05,320 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-15 22:47:05,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:47:05,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:47:05,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476668620] [2023-02-15 22:47:05,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476668620] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:47:05,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:47:05,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:47:05,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845438027] [2023-02-15 22:47:05,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:47:05,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:47:05,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:47:05,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:47:05,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:47:05,322 INFO L87 Difference]: Start difference. First operand 360 states and 420 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 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-15 22:47:05,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:47:05,493 INFO L93 Difference]: Finished difference Result 378 states and 441 transitions. [2023-02-15 22:47:05,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:47:05,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 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-15 22:47:05,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:47:05,495 INFO L225 Difference]: With dead ends: 378 [2023-02-15 22:47:05,495 INFO L226 Difference]: Without dead ends: 375 [2023-02-15 22:47:05,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 150 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-15 22:47:05,497 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:47:05,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 153 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:47:05,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2023-02-15 22:47:05,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2023-02-15 22:47:05,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 348 states have (on average 1.206896551724138) internal successors, (420), 359 states have internal predecessors, (420), 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-15 22:47:05,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 428 transitions. [2023-02-15 22:47:05,554 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 428 transitions. Word has length 152 [2023-02-15 22:47:05,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:47:05,555 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 428 transitions. [2023-02-15 22:47:05,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 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-15 22:47:05,555 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 428 transitions. [2023-02-15 22:47:05,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-02-15 22:47:05,556 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:47:05,556 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 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] [2023-02-15 22:47:05,565 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-15 22:47:05,763 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-15 22:47:05,763 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-02-15 22:47:05,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:47:05,764 INFO L85 PathProgramCache]: Analyzing trace with hash 264409090, now seen corresponding path program 1 times [2023-02-15 22:47:05,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:47:05,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829825870] [2023-02-15 22:47:05,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:47:05,764 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-15 22:47:05,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:47:05,766 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-15 22:47:05,767 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-15 22:47:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:47:05,818 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 22:47:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:47:05,925 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-15 22:47:05,926 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 22:47:05,926 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2023-02-15 22:47:05,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2023-02-15 22:47:05,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2023-02-15 22:47:05,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2023-02-15 22:47:05,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2023-02-15 22:47:05,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2023-02-15 22:47:05,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2023-02-15 22:47:05,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2023-02-15 22:47:05,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2023-02-15 22:47:05,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2023-02-15 22:47:05,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2023-02-15 22:47:05,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2023-02-15 22:47:05,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2023-02-15 22:47:05,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2023-02-15 22:47:05,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2023-02-15 22:47:05,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2023-02-15 22:47:05,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2023-02-15 22:47:05,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2023-02-15 22:47:05,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2023-02-15 22:47:05,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2023-02-15 22:47:05,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2023-02-15 22:47:05,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2023-02-15 22:47:05,930 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2023-02-15 22:47:05,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2023-02-15 22:47:05,940 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-15 22:47:06,138 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-15 22:47:06,141 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:47:06,144 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 22:47:06,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:47:06 BoogieIcfgContainer [2023-02-15 22:47:06,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 22:47:06,188 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 22:47:06,188 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 22:47:06,188 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 22:47:06,188 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:46:11" (3/4) ... [2023-02-15 22:47:06,189 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-15 22:47:06,261 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 22:47:06,262 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 22:47:06,262 INFO L158 Benchmark]: Toolchain (without parser) took 55787.02ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 65.4MB in the beginning and 90.8MB in the end (delta: -25.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2023-02-15 22:47:06,262 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 62.9MB. Free memory is still 39.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:47:06,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.96ms. Allocated memory is still 88.1MB. Free memory was 65.1MB in the beginning and 51.4MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 22:47:06,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.25ms. Allocated memory is still 88.1MB. Free memory was 51.2MB in the beginning and 49.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 22:47:06,263 INFO L158 Benchmark]: Boogie Preprocessor took 47.72ms. Allocated memory is still 88.1MB. Free memory was 49.4MB in the beginning and 47.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 22:47:06,264 INFO L158 Benchmark]: RCFGBuilder took 450.43ms. Allocated memory is still 88.1MB. Free memory was 47.6MB in the beginning and 50.7MB in the end (delta: -3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 22:47:06,264 INFO L158 Benchmark]: TraceAbstraction took 54917.77ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 49.9MB in the beginning and 97.1MB in the end (delta: -47.2MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2023-02-15 22:47:06,264 INFO L158 Benchmark]: Witness Printer took 74.19ms. Allocated memory is still 157.3MB. Free memory was 97.1MB in the beginning and 90.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-15 22:47:06,267 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.14ms. Allocated memory is still 62.9MB. Free memory is still 39.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.96ms. Allocated memory is still 88.1MB. Free memory was 65.1MB in the beginning and 51.4MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.25ms. Allocated memory is still 88.1MB. Free memory was 51.2MB in the beginning and 49.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.72ms. Allocated memory is still 88.1MB. Free memory was 49.4MB in the beginning and 47.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 450.43ms. Allocated memory is still 88.1MB. Free memory was 47.6MB in the beginning and 50.7MB in the end (delta: -3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 54917.77ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 49.9MB in the beginning and 97.1MB in the end (delta: -47.2MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * Witness Printer took 74.19ms. Allocated memory is still 157.3MB. Free memory was 97.1MB in the beginning and 90.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - CounterExampleResult [Line: 77]: integer overflow possible integer overflow possible We found a 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 sb ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; [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] [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] EXPR (e + 128) << 24U [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, zero=0] [L239] one = base2flt(1, 0) [L240] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] - 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: 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: 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. - 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. - 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, 98 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 54.8s, OverallIterations: 16, TraceHistogramMax: 24, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 44.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4454 SdHoareTripleChecker+Valid, 9.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4454 mSDsluCounter, 14606 SdHoareTripleChecker+Invalid, 8.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13145 mSDsCounter, 701 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12317 IncrementalHoareTripleChecker+Invalid, 13018 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 701 mSolverCounterUnsat, 1461 mSDtfsCounter, 12317 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1627 GetRequests, 1212 SyntacticMatches, 0 SemanticMatches, 415 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4923 ImplicationChecksByTransitivity, 37.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=15, InterpolantAutomatonStates: 316, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 1433 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 950 NumberOfCodeBlocks, 903 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1281 ConstructedInterpolants, 8 QuantifiedInterpolants, 7708 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1272 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 23 InterpolantComputations, 7 PerfectInterpolantSequences, 1576/6570 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 proved your program to be incorrect! [2023-02-15 22:47:06,298 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)