./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f330893f1140a32f6e6dacd6cc5115391759545d59ea17334f6f3b644ed5a51c --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 02:15:18,161 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 02:15:18,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 02:15:18,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 02:15:18,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 02:15:18,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 02:15:18,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 02:15:18,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 02:15:18,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 02:15:18,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 02:15:18,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 02:15:18,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 02:15:18,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 02:15:18,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 02:15:18,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 02:15:18,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 02:15:18,224 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 02:15:18,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 02:15:18,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 02:15:18,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 02:15:18,234 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 02:15:18,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 02:15:18,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 02:15:18,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 02:15:18,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 02:15:18,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 02:15:18,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 02:15:18,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 02:15:18,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 02:15:18,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 02:15:18,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 02:15:18,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 02:15:18,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 02:15:18,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 02:15:18,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 02:15:18,251 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 02:15:18,251 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 02:15:18,252 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 02:15:18,252 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 02:15:18,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 02:15:18,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 02:15:18,255 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 02:15:18,255 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-07-13 02:15:18,285 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 02:15:18,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 02:15:18,286 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 02:15:18,286 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 02:15:18,286 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 02:15:18,287 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 02:15:18,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 02:15:18,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 02:15:18,287 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 02:15:18,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 02:15:18,288 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 02:15:18,289 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 02:15:18,289 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 02:15:18,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 02:15:18,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 02:15:18,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 02:15:18,290 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 02:15:18,290 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 02:15:18,290 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-13 02:15:18,290 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 02:15:18,290 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 02:15:18,290 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 02:15:18,291 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 02:15:18,291 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 02:15:18,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 02:15:18,291 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 02:15:18,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 02:15:18,292 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 02:15:18,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 02:15:18,292 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 02:15:18,292 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 02:15:18,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 02:15:18,293 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 02:15:18,293 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f330893f1140a32f6e6dacd6cc5115391759545d59ea17334f6f3b644ed5a51c [2022-07-13 02:15:18,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 02:15:18,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 02:15:18,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 02:15:18,533 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 02:15:18,533 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 02:15:18,534 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2022-07-13 02:15:18,582 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f2c7e7a6/9c10b611e673448cb88c54d9f65602fb/FLAG8da03dd47 [2022-07-13 02:15:18,955 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 02:15:18,956 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2022-07-13 02:15:18,962 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f2c7e7a6/9c10b611e673448cb88c54d9f65602fb/FLAG8da03dd47 [2022-07-13 02:15:19,377 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f2c7e7a6/9c10b611e673448cb88c54d9f65602fb [2022-07-13 02:15:19,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 02:15:19,380 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 02:15:19,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 02:15:19,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 02:15:19,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 02:15:19,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:15:19" (1/1) ... [2022-07-13 02:15:19,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@526e00fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19, skipping insertion in model container [2022-07-13 02:15:19,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:15:19" (1/1) ... [2022-07-13 02:15:19,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 02:15:19,409 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 02:15:19,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c[728,741] [2022-07-13 02:15:19,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 02:15:19,584 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 02:15:19,596 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c[728,741] [2022-07-13 02:15:19,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 02:15:19,647 INFO L208 MainTranslator]: Completed translation [2022-07-13 02:15:19,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19 WrapperNode [2022-07-13 02:15:19,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 02:15:19,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 02:15:19,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 02:15:19,649 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 02:15:19,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19" (1/1) ... [2022-07-13 02:15:19,662 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19" (1/1) ... [2022-07-13 02:15:19,683 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 192 [2022-07-13 02:15:19,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 02:15:19,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 02:15:19,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 02:15:19,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 02:15:19,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19" (1/1) ... [2022-07-13 02:15:19,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19" (1/1) ... [2022-07-13 02:15:19,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19" (1/1) ... [2022-07-13 02:15:19,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19" (1/1) ... [2022-07-13 02:15:19,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19" (1/1) ... [2022-07-13 02:15:19,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19" (1/1) ... [2022-07-13 02:15:19,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19" (1/1) ... [2022-07-13 02:15:19,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 02:15:19,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 02:15:19,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 02:15:19,711 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 02:15:19,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19" (1/1) ... [2022-07-13 02:15:19,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 02:15:19,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:19,742 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 02:15:19,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 02:15:19,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 02:15:19,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 02:15:19,771 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-13 02:15:19,771 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-13 02:15:19,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 02:15:19,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 02:15:19,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 02:15:19,772 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 02:15:19,855 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 02:15:19,857 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 02:15:20,198 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 02:15:20,206 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 02:15:20,209 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 02:15:20,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:15:20 BoogieIcfgContainer [2022-07-13 02:15:20,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 02:15:20,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 02:15:20,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 02:15:20,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 02:15:20,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:15:19" (1/3) ... [2022-07-13 02:15:20,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cda4893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:15:20, skipping insertion in model container [2022-07-13 02:15:20,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:15:19" (2/3) ... [2022-07-13 02:15:20,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cda4893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:15:20, skipping insertion in model container [2022-07-13 02:15:20,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:15:20" (3/3) ... [2022-07-13 02:15:20,221 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_2a.c.cil.c [2022-07-13 02:15:20,234 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 02:15:20,234 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2022-07-13 02:15:20,308 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 02:15:20,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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@23697e41, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@16445e7 [2022-07-13 02:15:20,317 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2022-07-13 02:15:20,322 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 98 states have (on average 1.7857142857142858) internal successors, (175), 121 states have internal predecessors, (175), 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) [2022-07-13 02:15:20,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 02:15:20,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:20,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:20,330 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:15:20,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:20,335 INFO L85 PathProgramCache]: Analyzing trace with hash -650612023, now seen corresponding path program 1 times [2022-07-13 02:15:20,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:20,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253050381] [2022-07-13 02:15:20,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:20,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:20,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:20,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:20,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253050381] [2022-07-13 02:15:20,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253050381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:20,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:20,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 02:15:20,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511722997] [2022-07-13 02:15:20,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:20,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 02:15:20,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:20,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 02:15:20,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 02:15:20,500 INFO L87 Difference]: Start difference. First operand has 128 states, 98 states have (on average 1.7857142857142858) internal successors, (175), 121 states have internal predecessors, (175), 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, 2 states have (on average 4.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) [2022-07-13 02:15:20,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:20,539 INFO L93 Difference]: Finished difference Result 251 states and 371 transitions. [2022-07-13 02:15:20,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 02:15:20,542 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 [2022-07-13 02:15:20,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:20,550 INFO L225 Difference]: With dead ends: 251 [2022-07-13 02:15:20,550 INFO L226 Difference]: Without dead ends: 105 [2022-07-13 02:15:20,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 02:15:20,557 INFO L413 NwaCegarLoop]: 168 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, 168 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:20,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:15:20,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-13 02:15:20,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-13 02:15:20,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.5875) internal successors, (127), 99 states have internal predecessors, (127), 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) [2022-07-13 02:15:20,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions. [2022-07-13 02:15:20,604 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 9 [2022-07-13 02:15:20,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:20,605 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 135 transitions. [2022-07-13 02:15:20,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.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) [2022-07-13 02:15:20,605 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions. [2022-07-13 02:15:20,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 02:15:20,606 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:20,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:20,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 02:15:20,607 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:15:20,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:20,608 INFO L85 PathProgramCache]: Analyzing trace with hash -651553371, now seen corresponding path program 1 times [2022-07-13 02:15:20,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:20,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083724954] [2022-07-13 02:15:20,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:20,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:20,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:20,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083724954] [2022-07-13 02:15:20,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083724954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:20,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:20,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 02:15:20,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801016491] [2022-07-13 02:15:20,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:20,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:20,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:20,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:20,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:15:20,676 INFO L87 Difference]: Start difference. First operand 105 states and 135 transitions. 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) [2022-07-13 02:15:20,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:20,820 INFO L93 Difference]: Finished difference Result 269 states and 363 transitions. [2022-07-13 02:15:20,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:15:20,821 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 [2022-07-13 02:15:20,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:20,824 INFO L225 Difference]: With dead ends: 269 [2022-07-13 02:15:20,824 INFO L226 Difference]: Without dead ends: 167 [2022-07-13 02:15:20,825 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 [2022-07-13 02:15:20,826 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 106 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:20,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 349 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:20,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-13 02:15:20,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 154. [2022-07-13 02:15:20,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 128 states have (on average 1.578125) internal successors, (202), 147 states have internal predecessors, (202), 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) [2022-07-13 02:15:20,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 210 transitions. [2022-07-13 02:15:20,849 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 210 transitions. Word has length 9 [2022-07-13 02:15:20,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:20,850 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 210 transitions. [2022-07-13 02:15:20,850 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) [2022-07-13 02:15:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 210 transitions. [2022-07-13 02:15:20,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 02:15:20,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:20,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:20,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 02:15:20,852 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:15:20,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:20,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1699191166, now seen corresponding path program 1 times [2022-07-13 02:15:20,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:20,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846724042] [2022-07-13 02:15:20,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:20,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:20,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:20,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846724042] [2022-07-13 02:15:20,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846724042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:20,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:20,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 02:15:20,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211772030] [2022-07-13 02:15:20,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:20,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:20,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:20,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:20,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:15:20,900 INFO L87 Difference]: Start difference. First operand 154 states and 210 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:15:21,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:21,023 INFO L93 Difference]: Finished difference Result 189 states and 251 transitions. [2022-07-13 02:15:21,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:21,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 13 [2022-07-13 02:15:21,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:21,028 INFO L225 Difference]: With dead ends: 189 [2022-07-13 02:15:21,028 INFO L226 Difference]: Without dead ends: 186 [2022-07-13 02:15:21,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:21,034 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 161 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:21,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 468 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:21,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-13 02:15:21,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 161. [2022-07-13 02:15:21,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 135 states have (on average 1.5777777777777777) internal successors, (213), 154 states have internal predecessors, (213), 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) [2022-07-13 02:15:21,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 221 transitions. [2022-07-13 02:15:21,056 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 221 transitions. Word has length 13 [2022-07-13 02:15:21,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:21,056 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 221 transitions. [2022-07-13 02:15:21,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:15:21,057 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 221 transitions. [2022-07-13 02:15:21,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 02:15:21,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:21,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:21,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 02:15:21,058 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:15:21,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:21,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1135318715, now seen corresponding path program 1 times [2022-07-13 02:15:21,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:21,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606162790] [2022-07-13 02:15:21,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:21,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:21,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:21,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606162790] [2022-07-13 02:15:21,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606162790] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:21,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:21,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 02:15:21,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783178124] [2022-07-13 02:15:21,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:21,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:21,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:21,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:21,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 02:15:21,115 INFO L87 Difference]: Start difference. First operand 161 states and 221 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) [2022-07-13 02:15:21,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:21,239 INFO L93 Difference]: Finished difference Result 354 states and 486 transitions. [2022-07-13 02:15:21,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:21,239 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 [2022-07-13 02:15:21,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:21,241 INFO L225 Difference]: With dead ends: 354 [2022-07-13 02:15:21,241 INFO L226 Difference]: Without dead ends: 196 [2022-07-13 02:15:21,242 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 [2022-07-13 02:15:21,243 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 165 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:21,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 459 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:21,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-13 02:15:21,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 165. [2022-07-13 02:15:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 139 states have (on average 1.5539568345323742) internal successors, (216), 158 states have internal predecessors, (216), 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) [2022-07-13 02:15:21,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 224 transitions. [2022-07-13 02:15:21,254 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 224 transitions. Word has length 14 [2022-07-13 02:15:21,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:21,255 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 224 transitions. [2022-07-13 02:15:21,255 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) [2022-07-13 02:15:21,255 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 224 transitions. [2022-07-13 02:15:21,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 02:15:21,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:21,256 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:21,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 02:15:21,257 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:15:21,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:21,257 INFO L85 PathProgramCache]: Analyzing trace with hash -783591725, now seen corresponding path program 1 times [2022-07-13 02:15:21,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:21,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161789961] [2022-07-13 02:15:21,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:21,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 02:15:21,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:21,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161789961] [2022-07-13 02:15:21,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161789961] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:21,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:21,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 02:15:21,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224054891] [2022-07-13 02:15:21,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:21,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:15:21,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:21,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:15:21,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 02:15:21,329 INFO L87 Difference]: Start difference. First operand 165 states and 224 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:15:21,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:21,361 INFO L93 Difference]: Finished difference Result 173 states and 234 transitions. [2022-07-13 02:15:21,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:15:21,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 [2022-07-13 02:15:21,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:21,363 INFO L225 Difference]: With dead ends: 173 [2022-07-13 02:15:21,363 INFO L226 Difference]: Without dead ends: 172 [2022-07-13 02:15:21,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 02:15:21,366 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 5 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:21,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 248 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:15:21,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-13 02:15:21,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 163. [2022-07-13 02:15:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 138 states have (on average 1.5434782608695652) internal successors, (213), 156 states have internal predecessors, (213), 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) [2022-07-13 02:15:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 221 transitions. [2022-07-13 02:15:21,393 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 221 transitions. Word has length 15 [2022-07-13 02:15:21,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:21,394 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 221 transitions. [2022-07-13 02:15:21,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:15:21,395 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 221 transitions. [2022-07-13 02:15:21,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 02:15:21,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:21,396 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:21,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 02:15:21,400 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:15:21,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:21,401 INFO L85 PathProgramCache]: Analyzing trace with hash -783589465, now seen corresponding path program 1 times [2022-07-13 02:15:21,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:21,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101030394] [2022-07-13 02:15:21,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:21,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:21,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:21,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101030394] [2022-07-13 02:15:21,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101030394] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:21,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539498125] [2022-07-13 02:15:21,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:21,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:21,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:21,455 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) [2022-07-13 02:15:21,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 02:15:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 02:15:21,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:21,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 02:15:21,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:21,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539498125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:21,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:21,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-13 02:15:21,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914229995] [2022-07-13 02:15:21,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:21,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:21,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:21,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:21,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:21,585 INFO L87 Difference]: Start difference. First operand 163 states and 221 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:15:21,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:21,650 INFO L93 Difference]: Finished difference Result 201 states and 276 transitions. [2022-07-13 02:15:21,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:15:21,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-13 02:15:21,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:21,654 INFO L225 Difference]: With dead ends: 201 [2022-07-13 02:15:21,654 INFO L226 Difference]: Without dead ends: 199 [2022-07-13 02:15:21,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:21,656 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 26 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:21,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 391 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:21,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-13 02:15:21,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 165. [2022-07-13 02:15:21,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 140 states have (on average 1.5357142857142858) internal successors, (215), 158 states have internal predecessors, (215), 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) [2022-07-13 02:15:21,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 223 transitions. [2022-07-13 02:15:21,664 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 223 transitions. Word has length 15 [2022-07-13 02:15:21,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:21,664 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 223 transitions. [2022-07-13 02:15:21,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:15:21,664 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 223 transitions. [2022-07-13 02:15:21,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 02:15:21,665 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:21,665 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:21,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:21,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-13 02:15:21,884 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:15:21,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:21,884 INFO L85 PathProgramCache]: Analyzing trace with hash 842807383, now seen corresponding path program 1 times [2022-07-13 02:15:21,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:21,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711039067] [2022-07-13 02:15:21,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:21,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:21,925 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 02:15:21,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:21,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711039067] [2022-07-13 02:15:21,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711039067] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:21,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:21,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 02:15:21,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367397655] [2022-07-13 02:15:21,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:21,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 02:15:21,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:21,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 02:15:21,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:15:21,927 INFO L87 Difference]: Start difference. First operand 165 states and 223 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:15:21,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:21,993 INFO L93 Difference]: Finished difference Result 207 states and 285 transitions. [2022-07-13 02:15:21,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 02:15:21,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-13 02:15:21,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:21,994 INFO L225 Difference]: With dead ends: 207 [2022-07-13 02:15:21,994 INFO L226 Difference]: Without dead ends: 204 [2022-07-13 02:15:21,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 02:15:21,995 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 27 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:21,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 370 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:21,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-13 02:15:22,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 170. [2022-07-13 02:15:22,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 146 states have (on average 1.5273972602739727) internal successors, (223), 163 states have internal predecessors, (223), 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) [2022-07-13 02:15:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 231 transitions. [2022-07-13 02:15:22,003 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 231 transitions. Word has length 19 [2022-07-13 02:15:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:22,004 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 231 transitions. [2022-07-13 02:15:22,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 02:15:22,004 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 231 transitions. [2022-07-13 02:15:22,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 02:15:22,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:22,005 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:22,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 02:15:22,005 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:15:22,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:22,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1397629671, now seen corresponding path program 1 times [2022-07-13 02:15:22,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:22,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181930636] [2022-07-13 02:15:22,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:22,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,063 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 02:15:22,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:22,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181930636] [2022-07-13 02:15:22,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181930636] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:22,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228593948] [2022-07-13 02:15:22,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:22,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:22,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:22,068 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) [2022-07-13 02:15:22,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 02:15:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:22,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:22,140 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 02:15:22,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:22,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228593948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:22,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:22,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 02:15:22,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180336377] [2022-07-13 02:15:22,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:22,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:22,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:22,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:22,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:22,143 INFO L87 Difference]: Start difference. First operand 170 states and 231 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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) [2022-07-13 02:15:22,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:22,246 INFO L93 Difference]: Finished difference Result 252 states and 350 transitions. [2022-07-13 02:15:22,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:22,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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 23 [2022-07-13 02:15:22,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:22,248 INFO L225 Difference]: With dead ends: 252 [2022-07-13 02:15:22,248 INFO L226 Difference]: Without dead ends: 249 [2022-07-13 02:15:22,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:22,249 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 188 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:22,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 365 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:22,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-07-13 02:15:22,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 207. [2022-07-13 02:15:22,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 182 states have (on average 1.5384615384615385) internal successors, (280), 199 states have internal predecessors, (280), 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) [2022-07-13 02:15:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 288 transitions. [2022-07-13 02:15:22,258 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 288 transitions. Word has length 23 [2022-07-13 02:15:22,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:22,259 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 288 transitions. [2022-07-13 02:15:22,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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) [2022-07-13 02:15:22,259 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 288 transitions. [2022-07-13 02:15:22,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 02:15:22,262 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:22,262 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] [2022-07-13 02:15:22,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-13 02:15:22,465 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,SelfDestructingSolverStorable7 [2022-07-13 02:15:22,465 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:15:22,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:22,466 INFO L85 PathProgramCache]: Analyzing trace with hash -315199921, now seen corresponding path program 1 times [2022-07-13 02:15:22,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:22,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961953329] [2022-07-13 02:15:22,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:22,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 02:15:22,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:22,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961953329] [2022-07-13 02:15:22,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961953329] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:22,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028224542] [2022-07-13 02:15:22,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:22,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:22,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:22,522 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) [2022-07-13 02:15:22,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 02:15:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:22,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:22,621 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 02:15:22,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:22,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028224542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:22,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:22,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 02:15:22,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385219795] [2022-07-13 02:15:22,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:22,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:22,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:22,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:22,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:22,623 INFO L87 Difference]: Start difference. First operand 207 states and 288 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (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) [2022-07-13 02:15:22,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:22,703 INFO L93 Difference]: Finished difference Result 240 states and 329 transitions. [2022-07-13 02:15:22,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:22,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (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 25 [2022-07-13 02:15:22,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:22,706 INFO L225 Difference]: With dead ends: 240 [2022-07-13 02:15:22,706 INFO L226 Difference]: Without dead ends: 237 [2022-07-13 02:15:22,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:22,708 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 168 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:22,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 375 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:22,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-07-13 02:15:22,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 199. [2022-07-13 02:15:22,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 174 states have (on average 1.5229885057471264) internal successors, (265), 191 states have internal predecessors, (265), 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) [2022-07-13 02:15:22,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 273 transitions. [2022-07-13 02:15:22,720 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 273 transitions. Word has length 25 [2022-07-13 02:15:22,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:22,720 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 273 transitions. [2022-07-13 02:15:22,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (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) [2022-07-13 02:15:22,720 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 273 transitions. [2022-07-13 02:15:22,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 02:15:22,721 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:22,721 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:22,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:22,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:22,935 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:15:22,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:22,936 INFO L85 PathProgramCache]: Analyzing trace with hash 309979375, now seen corresponding path program 1 times [2022-07-13 02:15:22,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:22,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498261352] [2022-07-13 02:15:22,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:22,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 02:15:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:22,994 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 02:15:22,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:22,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498261352] [2022-07-13 02:15:22,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498261352] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:22,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631773768] [2022-07-13 02:15:22,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:22,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:22,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:22,996 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) [2022-07-13 02:15:23,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 02:15:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:23,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 02:15:23,076 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:23,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631773768] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:23,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:23,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 02:15:23,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009968870] [2022-07-13 02:15:23,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:23,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:23,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:23,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:23,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:23,078 INFO L87 Difference]: Start difference. First operand 199 states and 273 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:23,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:23,153 INFO L93 Difference]: Finished difference Result 229 states and 315 transitions. [2022-07-13 02:15:23,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:23,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2022-07-13 02:15:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:23,155 INFO L225 Difference]: With dead ends: 229 [2022-07-13 02:15:23,155 INFO L226 Difference]: Without dead ends: 226 [2022-07-13 02:15:23,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:23,156 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 186 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:23,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 354 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:23,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-07-13 02:15:23,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 187. [2022-07-13 02:15:23,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 165 states have (on average 1.4848484848484849) internal successors, (245), 179 states have internal predecessors, (245), 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) [2022-07-13 02:15:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 253 transitions. [2022-07-13 02:15:23,165 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 253 transitions. Word has length 30 [2022-07-13 02:15:23,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:23,165 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 253 transitions. [2022-07-13 02:15:23,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 253 transitions. [2022-07-13 02:15:23,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 02:15:23,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:23,166 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:23,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:23,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:23,383 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:15:23,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:23,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1870081449, now seen corresponding path program 1 times [2022-07-13 02:15:23,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:23,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23112333] [2022-07-13 02:15:23,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:23,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 02:15:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,433 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 02:15:23,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:23,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23112333] [2022-07-13 02:15:23,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23112333] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:23,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112301635] [2022-07-13 02:15:23,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:23,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:23,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:23,436 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) [2022-07-13 02:15:23,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 02:15:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 02:15:23,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:23,531 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 02:15:23,531 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:23,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112301635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:23,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:23,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 02:15:23,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918925014] [2022-07-13 02:15:23,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:23,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 02:15:23,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:23,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 02:15:23,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 02:15:23,534 INFO L87 Difference]: Start difference. First operand 187 states and 253 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:23,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:23,609 INFO L93 Difference]: Finished difference Result 217 states and 294 transitions. [2022-07-13 02:15:23,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 02:15:23,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-07-13 02:15:23,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:23,611 INFO L225 Difference]: With dead ends: 217 [2022-07-13 02:15:23,611 INFO L226 Difference]: Without dead ends: 214 [2022-07-13 02:15:23,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 02:15:23,612 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 166 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:23,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 360 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:23,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-13 02:15:23,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 176. [2022-07-13 02:15:23,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 157 states have (on average 1.464968152866242) internal successors, (230), 168 states have internal predecessors, (230), 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) [2022-07-13 02:15:23,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 238 transitions. [2022-07-13 02:15:23,621 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 238 transitions. Word has length 32 [2022-07-13 02:15:23,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:23,621 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 238 transitions. [2022-07-13 02:15:23,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 02:15:23,622 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 238 transitions. [2022-07-13 02:15:23,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 02:15:23,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:23,622 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:23,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:23,835 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,SelfDestructingSolverStorable10 [2022-07-13 02:15:23,836 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:15:23,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:23,836 INFO L85 PathProgramCache]: Analyzing trace with hash -392453626, now seen corresponding path program 1 times [2022-07-13 02:15:23,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:23,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942725730] [2022-07-13 02:15:23,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:23,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 02:15:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 02:15:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,888 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 02:15:23,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:23,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942725730] [2022-07-13 02:15:23,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942725730] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:23,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606340073] [2022-07-13 02:15:23,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:23,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:23,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:23,890 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) [2022-07-13 02:15:23,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 02:15:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:23,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-13 02:15:23,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:24,045 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 02:15:24,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-13 02:15:24,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606340073] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:24,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:24,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 8] total 19 [2022-07-13 02:15:24,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294684573] [2022-07-13 02:15:24,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:24,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 02:15:24,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:24,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 02:15:24,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-07-13 02:15:24,193 INFO L87 Difference]: Start difference. First operand 176 states and 238 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-13 02:15:24,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:24,885 INFO L93 Difference]: Finished difference Result 793 states and 1039 transitions. [2022-07-13 02:15:24,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-13 02:15:24,886 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 37 [2022-07-13 02:15:24,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:24,890 INFO L225 Difference]: With dead ends: 793 [2022-07-13 02:15:24,890 INFO L226 Difference]: Without dead ends: 531 [2022-07-13 02:15:24,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=1255, Unknown=0, NotChecked=0, Total=1482 [2022-07-13 02:15:24,892 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 509 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:24,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1560 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 02:15:24,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-07-13 02:15:24,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 199. [2022-07-13 02:15:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 179 states have (on average 1.4189944134078212) internal successors, (254), 190 states have internal predecessors, (254), 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) [2022-07-13 02:15:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 262 transitions. [2022-07-13 02:15:24,914 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 262 transitions. Word has length 37 [2022-07-13 02:15:24,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:24,914 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 262 transitions. [2022-07-13 02:15:24,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 16 states have internal predecessors, (45), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-13 02:15:24,915 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 262 transitions. [2022-07-13 02:15:24,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 02:15:24,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:24,916 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:24,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:25,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:25,132 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:15:25,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:25,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1867874532, now seen corresponding path program 1 times [2022-07-13 02:15:25,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:25,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276903636] [2022-07-13 02:15:25,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:25,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 02:15:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 02:15:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,220 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-13 02:15:25,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:25,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276903636] [2022-07-13 02:15:25,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276903636] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:25,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:15:25,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 02:15:25,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537102571] [2022-07-13 02:15:25,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:25,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 02:15:25,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:25,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 02:15:25,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-13 02:15:25,222 INFO L87 Difference]: Start difference. First operand 199 states and 262 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:15:25,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:25,337 INFO L93 Difference]: Finished difference Result 437 states and 543 transitions. [2022-07-13 02:15:25,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 02:15:25,338 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2022-07-13 02:15:25,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:25,340 INFO L225 Difference]: With dead ends: 437 [2022-07-13 02:15:25,340 INFO L226 Difference]: Without dead ends: 370 [2022-07-13 02:15:25,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-13 02:15:25,341 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 229 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:25,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 903 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:25,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-07-13 02:15:25,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 199. [2022-07-13 02:15:25,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 179 states have (on average 1.4078212290502794) internal successors, (252), 190 states have internal predecessors, (252), 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) [2022-07-13 02:15:25,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 260 transitions. [2022-07-13 02:15:25,352 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 260 transitions. Word has length 57 [2022-07-13 02:15:25,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:25,352 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 260 transitions. [2022-07-13 02:15:25,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:15:25,352 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 260 transitions. [2022-07-13 02:15:25,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 02:15:25,353 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:25,353 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:25,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 02:15:25,354 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:15:25,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:25,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1303124915, now seen corresponding path program 2 times [2022-07-13 02:15:25,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:25,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320153629] [2022-07-13 02:15:25,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:25,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 02:15:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 02:15:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,444 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 02:15:25,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:25,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320153629] [2022-07-13 02:15:25,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320153629] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:25,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319420603] [2022-07-13 02:15:25,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:15:25,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:25,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:25,446 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:25,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 02:15:25,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 02:15:25,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:15:25,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 02:15:25,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:25,582 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-13 02:15:25,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:25,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319420603] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:25,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:25,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2022-07-13 02:15:25,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552411572] [2022-07-13 02:15:25,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:25,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 02:15:25,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:25,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 02:15:25,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-13 02:15:25,584 INFO L87 Difference]: Start difference. First operand 199 states and 260 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:15:25,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:25,701 INFO L93 Difference]: Finished difference Result 373 states and 465 transitions. [2022-07-13 02:15:25,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 02:15:25,702 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 61 [2022-07-13 02:15:25,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:25,703 INFO L225 Difference]: With dead ends: 373 [2022-07-13 02:15:25,703 INFO L226 Difference]: Without dead ends: 321 [2022-07-13 02:15:25,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-07-13 02:15:25,704 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 249 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:25,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1023 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:25,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-07-13 02:15:25,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 230. [2022-07-13 02:15:25,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 209 states have (on average 1.3827751196172249) internal successors, (289), 220 states have internal predecessors, (289), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-13 02:15:25,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 298 transitions. [2022-07-13 02:15:25,717 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 298 transitions. Word has length 61 [2022-07-13 02:15:25,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:25,717 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 298 transitions. [2022-07-13 02:15:25,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:15:25,717 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 298 transitions. [2022-07-13 02:15:25,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 02:15:25,718 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:25,718 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:25,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:25,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:25,942 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:15:25,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:25,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1303126837, now seen corresponding path program 1 times [2022-07-13 02:15:25,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:25,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718281788] [2022-07-13 02:15:25,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:25,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:25,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:26,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 02:15:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:26,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 02:15:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 02:15:26,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:26,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718281788] [2022-07-13 02:15:26,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718281788] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:26,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30590949] [2022-07-13 02:15:26,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:26,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:26,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:26,032 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:26,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 02:15:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:26,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 02:15:26,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 02:15:26,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 02:15:26,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30590949] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:26,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:26,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2022-07-13 02:15:26,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554838573] [2022-07-13 02:15:26,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:26,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 02:15:26,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:26,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 02:15:26,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-07-13 02:15:26,287 INFO L87 Difference]: Start difference. First operand 230 states and 298 transitions. Second operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 14 states have internal predecessors, (85), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 02:15:26,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:26,744 INFO L93 Difference]: Finished difference Result 1139 states and 1499 transitions. [2022-07-13 02:15:26,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-13 02:15:26,744 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 14 states have internal predecessors, (85), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2022-07-13 02:15:26,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:26,748 INFO L225 Difference]: With dead ends: 1139 [2022-07-13 02:15:26,748 INFO L226 Difference]: Without dead ends: 945 [2022-07-13 02:15:26,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=346, Invalid=710, Unknown=0, NotChecked=0, Total=1056 [2022-07-13 02:15:26,749 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 666 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:26,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 872 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 02:15:26,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2022-07-13 02:15:26,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 250. [2022-07-13 02:15:26,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 229 states have (on average 1.3668122270742358) internal successors, (313), 240 states have internal predecessors, (313), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-13 02:15:26,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 322 transitions. [2022-07-13 02:15:26,768 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 322 transitions. Word has length 61 [2022-07-13 02:15:26,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:26,769 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 322 transitions. [2022-07-13 02:15:26,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 14 states have internal predecessors, (85), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 02:15:26,769 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 322 transitions. [2022-07-13 02:15:26,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 02:15:26,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:26,770 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:26,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:26,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 02:15:26,984 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:15:26,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:26,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1609979175, now seen corresponding path program 1 times [2022-07-13 02:15:26,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:26,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70004122] [2022-07-13 02:15:26,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:26,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:27,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:27,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:27,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 02:15:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:27,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 02:15:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:27,059 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 02:15:27,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:27,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70004122] [2022-07-13 02:15:27,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70004122] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:27,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071818314] [2022-07-13 02:15:27,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:27,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:27,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:27,062 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:27,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 02:15:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:27,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 02:15:27,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:27,183 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-13 02:15:27,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:27,292 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-13 02:15:27,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071818314] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:27,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:27,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 15 [2022-07-13 02:15:27,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085665957] [2022-07-13 02:15:27,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:27,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 02:15:27,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:27,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 02:15:27,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-13 02:15:27,295 INFO L87 Difference]: Start difference. First operand 250 states and 322 transitions. Second operand has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-13 02:15:28,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:28,185 INFO L93 Difference]: Finished difference Result 719 states and 913 transitions. [2022-07-13 02:15:28,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-13 02:15:28,186 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 64 [2022-07-13 02:15:28,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:28,188 INFO L225 Difference]: With dead ends: 719 [2022-07-13 02:15:28,188 INFO L226 Difference]: Without dead ends: 512 [2022-07-13 02:15:28,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=565, Invalid=1985, Unknown=0, NotChecked=0, Total=2550 [2022-07-13 02:15:28,190 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 578 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:28,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 741 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 02:15:28,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2022-07-13 02:15:28,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 250. [2022-07-13 02:15:28,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 229 states have (on average 1.3493449781659388) internal successors, (309), 240 states have internal predecessors, (309), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-13 02:15:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 318 transitions. [2022-07-13 02:15:28,206 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 318 transitions. Word has length 64 [2022-07-13 02:15:28,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:28,206 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 318 transitions. [2022-07-13 02:15:28,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-13 02:15:28,206 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 318 transitions. [2022-07-13 02:15:28,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-13 02:15:28,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:28,207 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:28,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:28,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-13 02:15:28,431 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:15:28,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:28,432 INFO L85 PathProgramCache]: Analyzing trace with hash 768500551, now seen corresponding path program 1 times [2022-07-13 02:15:28,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:28,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48718867] [2022-07-13 02:15:28,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:28,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:28,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:28,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:28,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 02:15:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:28,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 02:15:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:28,545 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 02:15:28,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:28,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48718867] [2022-07-13 02:15:28,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48718867] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:28,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549109553] [2022-07-13 02:15:28,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:28,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:28,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:28,552 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:28,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 02:15:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:28,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 02:15:28,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:28,683 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 02:15:28,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 02:15:28,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549109553] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:28,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:28,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-07-13 02:15:28,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383773606] [2022-07-13 02:15:28,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:28,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 02:15:28,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:28,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 02:15:28,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-13 02:15:28,817 INFO L87 Difference]: Start difference. First operand 250 states and 318 transitions. Second operand has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 13 states have internal predecessors, (99), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 02:15:30,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:30,879 INFO L93 Difference]: Finished difference Result 894 states and 1137 transitions. [2022-07-13 02:15:30,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-13 02:15:30,880 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 13 states have internal predecessors, (99), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2022-07-13 02:15:30,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:30,883 INFO L225 Difference]: With dead ends: 894 [2022-07-13 02:15:30,883 INFO L226 Difference]: Without dead ends: 644 [2022-07-13 02:15:30,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=345, Invalid=845, Unknown=0, NotChecked=0, Total=1190 [2022-07-13 02:15:30,885 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 569 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:30,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 707 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 02:15:30,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2022-07-13 02:15:30,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 281. [2022-07-13 02:15:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 260 states have (on average 1.3076923076923077) internal successors, (340), 271 states have internal predecessors, (340), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-13 02:15:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 349 transitions. [2022-07-13 02:15:30,910 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 349 transitions. Word has length 71 [2022-07-13 02:15:30,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:30,911 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 349 transitions. [2022-07-13 02:15:30,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.071428571428571) internal successors, (99), 13 states have internal predecessors, (99), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 02:15:30,911 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 349 transitions. [2022-07-13 02:15:30,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-13 02:15:30,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:30,912 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:30,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:31,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-13 02:15:31,136 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:15:31,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:31,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1043554459, now seen corresponding path program 1 times [2022-07-13 02:15:31,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:31,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929514002] [2022-07-13 02:15:31,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:31,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:31,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:31,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:31,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 02:15:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:31,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 02:15:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 02:15:31,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:31,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929514002] [2022-07-13 02:15:31,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929514002] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:31,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590411316] [2022-07-13 02:15:31,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:31,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:31,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:31,262 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:31,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 02:15:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:31,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 02:15:31,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:31,446 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 26 proven. 87 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 02:15:31,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:31,725 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 02:15:31,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590411316] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:31,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:31,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2022-07-13 02:15:31,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408348681] [2022-07-13 02:15:31,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:31,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 02:15:31,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:31,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 02:15:31,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=470, Unknown=0, NotChecked=0, Total=702 [2022-07-13 02:15:31,727 INFO L87 Difference]: Start difference. First operand 281 states and 349 transitions. Second operand has 27 states, 27 states have (on average 5.444444444444445) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 02:15:32,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:32,856 INFO L93 Difference]: Finished difference Result 1899 states and 2505 transitions. [2022-07-13 02:15:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-13 02:15:32,856 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.444444444444445) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2022-07-13 02:15:32,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:32,861 INFO L225 Difference]: With dead ends: 1899 [2022-07-13 02:15:32,861 INFO L226 Difference]: Without dead ends: 1663 [2022-07-13 02:15:32,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1154, Invalid=2386, Unknown=0, NotChecked=0, Total=3540 [2022-07-13 02:15:32,865 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 1418 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1418 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:32,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1418 Valid, 1024 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 02:15:32,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2022-07-13 02:15:32,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 332. [2022-07-13 02:15:32,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 311 states have (on average 1.2958199356913183) internal successors, (403), 322 states have internal predecessors, (403), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-13 02:15:32,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 412 transitions. [2022-07-13 02:15:32,903 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 412 transitions. Word has length 83 [2022-07-13 02:15:32,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:32,903 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 412 transitions. [2022-07-13 02:15:32,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.444444444444445) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 02:15:32,903 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 412 transitions. [2022-07-13 02:15:32,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-13 02:15:32,908 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:32,909 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:32,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:33,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 02:15:33,132 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:15:33,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:33,133 INFO L85 PathProgramCache]: Analyzing trace with hash -602965433, now seen corresponding path program 2 times [2022-07-13 02:15:33,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:33,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095548044] [2022-07-13 02:15:33,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:33,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:33,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:33,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:33,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 02:15:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:33,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 02:15:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 02:15:33,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:33,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095548044] [2022-07-13 02:15:33,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095548044] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:33,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849897692] [2022-07-13 02:15:33,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:15:33,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:33,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:33,324 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:33,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 02:15:33,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 02:15:33,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:15:33,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-13 02:15:33,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:33,473 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-13 02:15:33,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:15:33,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849897692] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:15:33,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:15:33,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2022-07-13 02:15:33,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751113250] [2022-07-13 02:15:33,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:15:33,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 02:15:33,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:33,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 02:15:33,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-07-13 02:15:33,475 INFO L87 Difference]: Start difference. First operand 332 states and 412 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:15:33,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:33,589 INFO L93 Difference]: Finished difference Result 423 states and 515 transitions. [2022-07-13 02:15:33,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 02:15:33,590 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 91 [2022-07-13 02:15:33,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:33,591 INFO L225 Difference]: With dead ends: 423 [2022-07-13 02:15:33,592 INFO L226 Difference]: Without dead ends: 421 [2022-07-13 02:15:33,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2022-07-13 02:15:33,593 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 240 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:33,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1018 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:33,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-07-13 02:15:33,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 332. [2022-07-13 02:15:33,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 311 states have (on average 1.2958199356913183) internal successors, (403), 322 states have internal predecessors, (403), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-13 02:15:33,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 412 transitions. [2022-07-13 02:15:33,617 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 412 transitions. Word has length 91 [2022-07-13 02:15:33,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:33,617 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 412 transitions. [2022-07-13 02:15:33,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:15:33,618 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 412 transitions. [2022-07-13 02:15:33,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-13 02:15:33,619 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:33,619 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:33,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:33,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:33,823 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:15:33,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:33,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1412310137, now seen corresponding path program 1 times [2022-07-13 02:15:33,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:33,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038380615] [2022-07-13 02:15:33,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:33,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:33,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:33,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:33,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 02:15:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:33,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 02:15:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-13 02:15:33,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:33,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038380615] [2022-07-13 02:15:33,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038380615] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:33,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121450205] [2022-07-13 02:15:33,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:33,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:33,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:33,901 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:33,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 02:15:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:33,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 02:15:33,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:34,005 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-13 02:15:34,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:34,076 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-13 02:15:34,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121450205] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:34,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:34,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-07-13 02:15:34,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388727154] [2022-07-13 02:15:34,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:34,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 02:15:34,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:34,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 02:15:34,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-13 02:15:34,078 INFO L87 Difference]: Start difference. First operand 332 states and 412 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 02:15:34,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:15:34,253 INFO L93 Difference]: Finished difference Result 710 states and 862 transitions. [2022-07-13 02:15:34,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 02:15:34,253 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 91 [2022-07-13 02:15:34,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:15:34,256 INFO L225 Difference]: With dead ends: 710 [2022-07-13 02:15:34,256 INFO L226 Difference]: Without dead ends: 646 [2022-07-13 02:15:34,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-07-13 02:15:34,257 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 460 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:15:34,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1633 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:15:34,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2022-07-13 02:15:34,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 359. [2022-07-13 02:15:34,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 336 states have (on average 1.2857142857142858) internal successors, (432), 346 states have internal predecessors, (432), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-13 02:15:34,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 445 transitions. [2022-07-13 02:15:34,288 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 445 transitions. Word has length 91 [2022-07-13 02:15:34,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:15:34,288 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 445 transitions. [2022-07-13 02:15:34,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 02:15:34,289 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 445 transitions. [2022-07-13 02:15:34,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-13 02:15:34,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:15:34,290 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:15:34,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 02:15:34,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-07-13 02:15:34,508 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:15:34,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:15:34,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1412312059, now seen corresponding path program 1 times [2022-07-13 02:15:34,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:15:34,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148914522] [2022-07-13 02:15:34,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:34,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:15:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:34,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:15:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:34,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:15:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:34,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 02:15:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:34,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 02:15:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:34,676 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 02:15:34,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:15:34,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148914522] [2022-07-13 02:15:34,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148914522] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:15:34,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568978777] [2022-07-13 02:15:34,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:15:34,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:15:34,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:15:34,679 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:15:34,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 02:15:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:15:35,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 02:15:35,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:15:35,182 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 26 proven. 75 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 02:15:35,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:15:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 02:15:35,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568978777] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:15:35,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:15:35,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2022-07-13 02:15:35,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680390106] [2022-07-13 02:15:35,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:15:35,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 02:15:35,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:15:35,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 02:15:35,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-13 02:15:35,500 INFO L87 Difference]: Start difference. First operand 359 states and 445 transitions. Second operand has 26 states, 26 states have (on average 6.115384615384615) internal successors, (159), 25 states have internal predecessors, (159), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 02:15:50,097 WARN L233 SmtUtils]: Spent 7.88s on a formula simplification. DAG size of input: 42 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 02:16:01,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:16:01,401 INFO L93 Difference]: Finished difference Result 1238 states and 1594 transitions. [2022-07-13 02:16:01,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-13 02:16:01,402 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.115384615384615) internal successors, (159), 25 states have internal predecessors, (159), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-07-13 02:16:01,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:16:01,405 INFO L225 Difference]: With dead ends: 1238 [2022-07-13 02:16:01,406 INFO L226 Difference]: Without dead ends: 919 [2022-07-13 02:16:01,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=993, Invalid=2909, Unknown=4, NotChecked=0, Total=3906 [2022-07-13 02:16:01,409 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 1052 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 02:16:01,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 1774 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 02:16:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2022-07-13 02:16:01,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 388. [2022-07-13 02:16:01,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 365 states have (on average 1.252054794520548) internal successors, (457), 375 states have internal predecessors, (457), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-13 02:16:01,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 470 transitions. [2022-07-13 02:16:01,452 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 470 transitions. Word has length 91 [2022-07-13 02:16:01,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:16:01,453 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 470 transitions. [2022-07-13 02:16:01,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.115384615384615) internal successors, (159), 25 states have internal predecessors, (159), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 02:16:01,453 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 470 transitions. [2022-07-13 02:16:01,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-13 02:16:01,454 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:16:01,455 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:16:01,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-13 02:16:01,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:16:01,671 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:16:01,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:16:01,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2013964067, now seen corresponding path program 1 times [2022-07-13 02:16:01,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:16:01,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529807939] [2022-07-13 02:16:01,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:16:01,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:16:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:01,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:16:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:01,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:16:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:01,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 02:16:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:01,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 02:16:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:01,940 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 4 proven. 493 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 02:16:01,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:16:01,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529807939] [2022-07-13 02:16:01,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529807939] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:16:01,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608011951] [2022-07-13 02:16:01,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:16:01,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:16:01,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:16:01,942 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:16:01,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-13 02:16:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:02,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 02:16:02,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:16:02,293 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 26 proven. 483 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 02:16:02,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:16:02,979 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 4 proven. 493 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 02:16:02,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608011951] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:16:02,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:16:02,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 51 [2022-07-13 02:16:02,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981586217] [2022-07-13 02:16:02,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:16:02,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-13 02:16:02,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:16:02,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-13 02:16:02,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=848, Invalid=1702, Unknown=0, NotChecked=0, Total=2550 [2022-07-13 02:16:02,982 INFO L87 Difference]: Start difference. First operand 388 states and 470 transitions. Second operand has 51 states, 51 states have (on average 5.235294117647059) internal successors, (267), 50 states have internal predecessors, (267), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 02:16:05,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:16:05,834 INFO L93 Difference]: Finished difference Result 3503 states and 4731 transitions. [2022-07-13 02:16:05,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-07-13 02:16:05,834 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 5.235294117647059) internal successors, (267), 50 states have internal predecessors, (267), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 123 [2022-07-13 02:16:05,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:16:05,845 INFO L225 Difference]: With dead ends: 3503 [2022-07-13 02:16:05,845 INFO L226 Difference]: Without dead ends: 3200 [2022-07-13 02:16:05,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3725 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4229, Invalid=8881, Unknown=0, NotChecked=0, Total=13110 [2022-07-13 02:16:05,851 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 4468 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 898 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4468 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 898 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 02:16:05,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4468 Valid, 1267 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [898 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 02:16:05,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2022-07-13 02:16:05,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 479. [2022-07-13 02:16:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 456 states have (on average 1.2456140350877194) internal successors, (568), 466 states have internal predecessors, (568), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-13 02:16:05,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 581 transitions. [2022-07-13 02:16:05,970 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 581 transitions. Word has length 123 [2022-07-13 02:16:05,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:16:05,971 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 581 transitions. [2022-07-13 02:16:05,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 5.235294117647059) internal successors, (267), 50 states have internal predecessors, (267), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 02:16:05,971 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 581 transitions. [2022-07-13 02:16:05,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-13 02:16:05,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:16:05,973 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:16:06,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-13 02:16:06,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:16:06,204 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:16:06,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:16:06,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1790935557, now seen corresponding path program 2 times [2022-07-13 02:16:06,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:16:06,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091577508] [2022-07-13 02:16:06,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:16:06,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:16:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:06,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:16:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:06,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:16:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:06,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 02:16:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:06,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 02:16:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:06,594 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 4 proven. 465 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-13 02:16:06,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:16:06,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091577508] [2022-07-13 02:16:06,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091577508] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:16:06,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694361803] [2022-07-13 02:16:06,595 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:16:06,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:16:06,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:16:06,600 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:16:06,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-13 02:16:06,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 02:16:06,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:16:06,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-13 02:16:06,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:16:06,854 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2022-07-13 02:16:06,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:16:06,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694361803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:16:06,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:16:06,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 26 [2022-07-13 02:16:06,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292047902] [2022-07-13 02:16:06,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:16:06,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 02:16:06,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:16:06,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 02:16:06,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2022-07-13 02:16:06,856 INFO L87 Difference]: Start difference. First operand 479 states and 581 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:16:07,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:16:07,069 INFO L93 Difference]: Finished difference Result 609 states and 729 transitions. [2022-07-13 02:16:07,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 02:16:07,070 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 131 [2022-07-13 02:16:07,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:16:07,072 INFO L225 Difference]: With dead ends: 609 [2022-07-13 02:16:07,072 INFO L226 Difference]: Without dead ends: 562 [2022-07-13 02:16:07,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=771, Unknown=0, NotChecked=0, Total=870 [2022-07-13 02:16:07,073 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 180 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:16:07,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1115 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:16:07,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-07-13 02:16:07,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 477. [2022-07-13 02:16:07,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 454 states have (on average 1.2422907488986785) internal successors, (564), 464 states have internal predecessors, (564), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-13 02:16:07,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 577 transitions. [2022-07-13 02:16:07,122 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 577 transitions. Word has length 131 [2022-07-13 02:16:07,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:16:07,123 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 577 transitions. [2022-07-13 02:16:07,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:16:07,123 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 577 transitions. [2022-07-13 02:16:07,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-13 02:16:07,125 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:16:07,125 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:16:07,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-13 02:16:07,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-13 02:16:07,330 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:16:07,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:16:07,330 INFO L85 PathProgramCache]: Analyzing trace with hash -702012822, now seen corresponding path program 1 times [2022-07-13 02:16:07,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:16:07,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787048342] [2022-07-13 02:16:07,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:16:07,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:16:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:07,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:16:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:07,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:16:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:07,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 02:16:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:07,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 02:16:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:07,439 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2022-07-13 02:16:07,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:16:07,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787048342] [2022-07-13 02:16:07,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787048342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:16:07,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:16:07,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 02:16:07,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125298208] [2022-07-13 02:16:07,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:16:07,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 02:16:07,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:16:07,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 02:16:07,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 02:16:07,442 INFO L87 Difference]: Start difference. First operand 477 states and 577 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:16:07,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:16:07,587 INFO L93 Difference]: Finished difference Result 874 states and 1074 transitions. [2022-07-13 02:16:07,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 02:16:07,588 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 137 [2022-07-13 02:16:07,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:16:07,591 INFO L225 Difference]: With dead ends: 874 [2022-07-13 02:16:07,591 INFO L226 Difference]: Without dead ends: 585 [2022-07-13 02:16:07,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-13 02:16:07,593 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 60 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:16:07,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 803 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:16:07,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-07-13 02:16:07,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 482. [2022-07-13 02:16:07,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 459 states have (on average 1.2396514161220045) internal successors, (569), 469 states have internal predecessors, (569), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-13 02:16:07,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 582 transitions. [2022-07-13 02:16:07,635 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 582 transitions. Word has length 137 [2022-07-13 02:16:07,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:16:07,636 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 582 transitions. [2022-07-13 02:16:07,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:16:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 582 transitions. [2022-07-13 02:16:07,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-13 02:16:07,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:16:07,638 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:16:07,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 02:16:07,638 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:16:07,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:16:07,638 INFO L85 PathProgramCache]: Analyzing trace with hash -867497325, now seen corresponding path program 1 times [2022-07-13 02:16:07,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:16:07,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686614396] [2022-07-13 02:16:07,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:16:07,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:16:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:07,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:16:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:07,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:16:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:07,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 02:16:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:07,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 02:16:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:07,745 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2022-07-13 02:16:07,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:16:07,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686614396] [2022-07-13 02:16:07,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686614396] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:16:07,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:16:07,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 02:16:07,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51263447] [2022-07-13 02:16:07,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:16:07,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 02:16:07,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:16:07,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 02:16:07,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-13 02:16:07,747 INFO L87 Difference]: Start difference. First operand 482 states and 582 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:16:08,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:16:08,053 INFO L93 Difference]: Finished difference Result 925 states and 1099 transitions. [2022-07-13 02:16:08,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 02:16:08,053 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 138 [2022-07-13 02:16:08,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:16:08,059 INFO L225 Difference]: With dead ends: 925 [2022-07-13 02:16:08,059 INFO L226 Difference]: Without dead ends: 875 [2022-07-13 02:16:08,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2022-07-13 02:16:08,062 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 572 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:16:08,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1122 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:16:08,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2022-07-13 02:16:08,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 522. [2022-07-13 02:16:08,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 498 states have (on average 1.2409638554216869) internal successors, (618), 507 states have internal predecessors, (618), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 02:16:08,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 633 transitions. [2022-07-13 02:16:08,121 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 633 transitions. Word has length 138 [2022-07-13 02:16:08,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:16:08,122 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 633 transitions. [2022-07-13 02:16:08,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:16:08,123 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 633 transitions. [2022-07-13 02:16:08,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-13 02:16:08,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:16:08,125 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:16:08,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 02:16:08,125 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:16:08,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:16:08,125 INFO L85 PathProgramCache]: Analyzing trace with hash -867499247, now seen corresponding path program 1 times [2022-07-13 02:16:08,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:16:08,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287507911] [2022-07-13 02:16:08,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:16:08,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:16:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:08,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:16:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:08,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:16:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:08,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 02:16:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:08,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 02:16:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:08,516 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 4 proven. 473 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-13 02:16:08,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:16:08,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287507911] [2022-07-13 02:16:08,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287507911] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:16:08,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069420576] [2022-07-13 02:16:08,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:16:08,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:16:08,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:16:08,519 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:16:08,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-13 02:16:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:08,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 02:16:08,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:16:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2022-07-13 02:16:08,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:16:08,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069420576] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:16:08,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:16:08,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 27 [2022-07-13 02:16:08,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274015809] [2022-07-13 02:16:08,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:16:08,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 02:16:08,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:16:08,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 02:16:08,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2022-07-13 02:16:08,780 INFO L87 Difference]: Start difference. First operand 522 states and 633 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:16:09,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:16:09,199 INFO L93 Difference]: Finished difference Result 1007 states and 1192 transitions. [2022-07-13 02:16:09,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 02:16:09,200 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 138 [2022-07-13 02:16:09,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:16:09,202 INFO L225 Difference]: With dead ends: 1007 [2022-07-13 02:16:09,203 INFO L226 Difference]: Without dead ends: 950 [2022-07-13 02:16:09,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=1128, Unknown=0, NotChecked=0, Total=1260 [2022-07-13 02:16:09,204 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 333 mSDsluCounter, 2390 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 2773 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 02:16:09,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 2773 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 02:16:09,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2022-07-13 02:16:09,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 538. [2022-07-13 02:16:09,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 513 states have (on average 1.2378167641325537) internal successors, (635), 521 states have internal predecessors, (635), 5 states have call successors, (5), 4 states have call predecessors, (5), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2022-07-13 02:16:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 652 transitions. [2022-07-13 02:16:09,272 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 652 transitions. Word has length 138 [2022-07-13 02:16:09,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:16:09,273 INFO L495 AbstractCegarLoop]: Abstraction has 538 states and 652 transitions. [2022-07-13 02:16:09,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:16:09,273 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 652 transitions. [2022-07-13 02:16:09,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-13 02:16:09,275 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:16:09,275 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:16:09,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-07-13 02:16:09,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-13 02:16:09,498 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:16:09,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:16:09,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1676845873, now seen corresponding path program 1 times [2022-07-13 02:16:09,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:16:09,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171159038] [2022-07-13 02:16:09,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:16:09,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:16:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:09,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:16:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:09,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:16:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:09,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 02:16:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:09,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 02:16:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:09,847 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 4 proven. 473 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-13 02:16:09,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:16:09,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171159038] [2022-07-13 02:16:09,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171159038] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:16:09,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31621551] [2022-07-13 02:16:09,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:16:09,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:16:09,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:16:09,849 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:16:09,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-13 02:16:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:09,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 02:16:09,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:16:10,236 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2022-07-13 02:16:10,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:16:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2022-07-13 02:16:10,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31621551] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 02:16:10,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 02:16:10,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19, 10] total 33 [2022-07-13 02:16:10,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298715327] [2022-07-13 02:16:10,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:16:10,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 02:16:10,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:16:10,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 02:16:10,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2022-07-13 02:16:10,745 INFO L87 Difference]: Start difference. First operand 538 states and 652 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:16:10,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:16:10,987 INFO L93 Difference]: Finished difference Result 647 states and 775 transitions. [2022-07-13 02:16:10,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 02:16:10,988 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 138 [2022-07-13 02:16:10,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:16:10,990 INFO L225 Difference]: With dead ends: 647 [2022-07-13 02:16:10,990 INFO L226 Difference]: Without dead ends: 569 [2022-07-13 02:16:10,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=133, Invalid=1199, Unknown=0, NotChecked=0, Total=1332 [2022-07-13 02:16:10,992 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 49 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:16:10,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 885 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:16:10,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-07-13 02:16:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 522. [2022-07-13 02:16:11,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 498 states have (on average 1.2389558232931728) internal successors, (617), 507 states have internal predecessors, (617), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 02:16:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 632 transitions. [2022-07-13 02:16:11,045 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 632 transitions. Word has length 138 [2022-07-13 02:16:11,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:16:11,045 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 632 transitions. [2022-07-13 02:16:11,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:16:11,046 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 632 transitions. [2022-07-13 02:16:11,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 02:16:11,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:16:11,047 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:16:11,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-13 02:16:11,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-13 02:16:11,267 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:16:11,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:16:11,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1902021283, now seen corresponding path program 1 times [2022-07-13 02:16:11,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:16:11,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435879137] [2022-07-13 02:16:11,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:16:11,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:16:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:11,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:16:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:11,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:16:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:11,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 02:16:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:11,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 02:16:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:11,372 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2022-07-13 02:16:11,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:16:11,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435879137] [2022-07-13 02:16:11,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435879137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:16:11,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:16:11,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 02:16:11,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775233018] [2022-07-13 02:16:11,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:16:11,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 02:16:11,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:16:11,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 02:16:11,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-13 02:16:11,375 INFO L87 Difference]: Start difference. First operand 522 states and 632 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:16:11,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:16:11,674 INFO L93 Difference]: Finished difference Result 1101 states and 1337 transitions. [2022-07-13 02:16:11,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 02:16:11,679 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 139 [2022-07-13 02:16:11,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:16:11,682 INFO L225 Difference]: With dead ends: 1101 [2022-07-13 02:16:11,682 INFO L226 Difference]: Without dead ends: 772 [2022-07-13 02:16:11,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-13 02:16:11,684 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 215 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:16:11,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1257 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:16:11,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2022-07-13 02:16:11,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 529. [2022-07-13 02:16:11,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 505 states have (on average 1.2396039603960396) internal successors, (626), 514 states have internal predecessors, (626), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 02:16:11,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 641 transitions. [2022-07-13 02:16:11,751 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 641 transitions. Word has length 139 [2022-07-13 02:16:11,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:16:11,752 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 641 transitions. [2022-07-13 02:16:11,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:16:11,752 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 641 transitions. [2022-07-13 02:16:11,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-13 02:16:11,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:16:11,754 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:16:11,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-13 02:16:11,754 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:16:11,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:16:11,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1167417324, now seen corresponding path program 1 times [2022-07-13 02:16:11,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:16:11,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574092915] [2022-07-13 02:16:11,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:16:11,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:16:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:11,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:16:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:11,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:16:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:12,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 02:16:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:12,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 02:16:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:12,097 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 4 proven. 475 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-13 02:16:12,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:16:12,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574092915] [2022-07-13 02:16:12,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574092915] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:16:12,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980302856] [2022-07-13 02:16:12,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:16:12,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:16:12,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:16:12,101 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:16:12,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-13 02:16:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:16:12,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-13 02:16:12,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:16:12,596 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 36 proven. 455 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 02:16:12,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:16:13,852 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 4 proven. 475 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-13 02:16:13,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980302856] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:16:13,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:16:13,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 50 [2022-07-13 02:16:13,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832385574] [2022-07-13 02:16:13,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:16:13,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-13 02:16:13,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:16:13,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-13 02:16:13,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1831, Unknown=0, NotChecked=0, Total=2450 [2022-07-13 02:16:13,855 INFO L87 Difference]: Start difference. First operand 529 states and 641 transitions. Second operand has 50 states, 50 states have (on average 6.02) internal successors, (301), 49 states have internal predecessors, (301), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 02:16:23,018 WARN L233 SmtUtils]: Spent 7.81s on a formula simplification. DAG size of input: 57 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 02:17:05,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:17:05,721 INFO L93 Difference]: Finished difference Result 1949 states and 2483 transitions. [2022-07-13 02:17:05,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-07-13 02:17:05,723 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 49 states have internal predecessors, (301), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 140 [2022-07-13 02:17:05,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:17:05,727 INFO L225 Difference]: With dead ends: 1949 [2022-07-13 02:17:05,728 INFO L226 Difference]: Without dead ends: 1546 [2022-07-13 02:17:05,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3174 ImplicationChecksByTransitivity, 50.2s TimeCoverageRelationStatistics Valid=2910, Invalid=9966, Unknown=6, NotChecked=0, Total=12882 [2022-07-13 02:17:05,732 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 1826 mSDsluCounter, 5236 mSDsCounter, 0 mSdLazyCounter, 4932 mSolverCounterSat, 955 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1826 SdHoareTripleChecker+Valid, 5408 SdHoareTripleChecker+Invalid, 5887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 955 IncrementalHoareTripleChecker+Valid, 4932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-13 02:17:05,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1826 Valid, 5408 Invalid, 5887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [955 Valid, 4932 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-13 02:17:05,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2022-07-13 02:17:05,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 609. [2022-07-13 02:17:05,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 585 states have (on average 1.217094017094017) internal successors, (712), 594 states have internal predecessors, (712), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 02:17:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 727 transitions. [2022-07-13 02:17:05,819 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 727 transitions. Word has length 140 [2022-07-13 02:17:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:17:05,819 INFO L495 AbstractCegarLoop]: Abstraction has 609 states and 727 transitions. [2022-07-13 02:17:05,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 6.02) internal successors, (301), 49 states have internal predecessors, (301), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-13 02:17:05,820 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 727 transitions. [2022-07-13 02:17:05,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-13 02:17:05,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:17:05,822 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:17:05,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-07-13 02:17:06,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-13 02:17:06,027 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:17:06,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:17:06,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1725785708, now seen corresponding path program 2 times [2022-07-13 02:17:06,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:17:06,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850728876] [2022-07-13 02:17:06,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:17:06,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:17:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:06,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:17:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:06,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:17:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:06,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-13 02:17:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:06,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 02:17:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:06,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1416 trivial. 0 not checked. [2022-07-13 02:17:06,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:17:06,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850728876] [2022-07-13 02:17:06,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850728876] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:17:06,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659794304] [2022-07-13 02:17:06,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 02:17:06,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:17:06,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:17:06,192 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:17:06,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-13 02:17:06,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 02:17:06,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 02:17:06,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 02:17:06,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:17:06,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1416 trivial. 0 not checked. [2022-07-13 02:17:06,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:17:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1416 trivial. 0 not checked. [2022-07-13 02:17:06,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659794304] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:17:06,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:17:06,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-07-13 02:17:06,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640917575] [2022-07-13 02:17:06,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:17:06,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 02:17:06,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:17:06,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 02:17:06,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-13 02:17:06,448 INFO L87 Difference]: Start difference. First operand 609 states and 727 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 02:17:06,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:17:06,675 INFO L93 Difference]: Finished difference Result 813 states and 968 transitions. [2022-07-13 02:17:06,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 02:17:06,676 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 190 [2022-07-13 02:17:06,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:17:06,678 INFO L225 Difference]: With dead ends: 813 [2022-07-13 02:17:06,678 INFO L226 Difference]: Without dead ends: 746 [2022-07-13 02:17:06,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 381 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-07-13 02:17:06,681 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 229 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:17:06,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1143 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:17:06,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-07-13 02:17:06,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 607. [2022-07-13 02:17:06,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 583 states have (on average 1.2126929674099485) internal successors, (707), 592 states have internal predecessors, (707), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 02:17:06,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 722 transitions. [2022-07-13 02:17:06,761 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 722 transitions. Word has length 190 [2022-07-13 02:17:06,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:17:06,761 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 722 transitions. [2022-07-13 02:17:06,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 02:17:06,762 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 722 transitions. [2022-07-13 02:17:06,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-13 02:17:06,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:17:06,764 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:17:06,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-13 02:17:06,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:17:06,988 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:17:06,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:17:06,988 INFO L85 PathProgramCache]: Analyzing trace with hash 951811193, now seen corresponding path program 1 times [2022-07-13 02:17:06,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:17:06,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361170773] [2022-07-13 02:17:06,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:17:06,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:17:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:07,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:17:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:07,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:17:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:07,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-13 02:17:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:07,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 02:17:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2022-07-13 02:17:07,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:17:07,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361170773] [2022-07-13 02:17:07,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361170773] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:17:07,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569726765] [2022-07-13 02:17:07,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:17:07,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:17:07,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:17:07,117 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:17:07,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-13 02:17:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:07,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 02:17:07,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:17:07,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2022-07-13 02:17:07,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:17:07,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1416 trivial. 0 not checked. [2022-07-13 02:17:07,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569726765] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 02:17:07,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 02:17:07,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9, 8] total 10 [2022-07-13 02:17:07,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183281581] [2022-07-13 02:17:07,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:17:07,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 02:17:07,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:17:07,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 02:17:07,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 02:17:07,320 INFO L87 Difference]: Start difference. First operand 607 states and 722 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:17:07,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:17:07,402 INFO L93 Difference]: Finished difference Result 685 states and 811 transitions. [2022-07-13 02:17:07,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 02:17:07,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 196 [2022-07-13 02:17:07,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:17:07,407 INFO L225 Difference]: With dead ends: 685 [2022-07-13 02:17:07,407 INFO L226 Difference]: Without dead ends: 634 [2022-07-13 02:17:07,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 397 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 02:17:07,408 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 8 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 02:17:07,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 235 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 02:17:07,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-07-13 02:17:07,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 625. [2022-07-13 02:17:07,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 601 states have (on average 1.2096505823627288) internal successors, (727), 610 states have internal predecessors, (727), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 02:17:07,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 742 transitions. [2022-07-13 02:17:07,484 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 742 transitions. Word has length 196 [2022-07-13 02:17:07,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:17:07,485 INFO L495 AbstractCegarLoop]: Abstraction has 625 states and 742 transitions. [2022-07-13 02:17:07,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:17:07,485 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 742 transitions. [2022-07-13 02:17:07,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-13 02:17:07,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:17:07,487 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:17:07,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-13 02:17:07,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:17:07,701 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:17:07,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:17:07,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1209976631, now seen corresponding path program 1 times [2022-07-13 02:17:07,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:17:07,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769250309] [2022-07-13 02:17:07,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:17:07,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:17:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:07,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:17:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:07,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:17:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:07,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-13 02:17:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:07,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 02:17:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2022-07-13 02:17:07,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:17:07,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769250309] [2022-07-13 02:17:07,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769250309] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:17:07,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:17:07,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 02:17:07,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290613877] [2022-07-13 02:17:07,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:17:07,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 02:17:07,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:17:07,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 02:17:07,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-13 02:17:07,815 INFO L87 Difference]: Start difference. First operand 625 states and 742 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:17:08,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:17:08,020 INFO L93 Difference]: Finished difference Result 824 states and 972 transitions. [2022-07-13 02:17:08,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 02:17:08,021 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 196 [2022-07-13 02:17:08,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:17:08,023 INFO L225 Difference]: With dead ends: 824 [2022-07-13 02:17:08,023 INFO L226 Difference]: Without dead ends: 794 [2022-07-13 02:17:08,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-13 02:17:08,024 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 209 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:17:08,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 979 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:17:08,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2022-07-13 02:17:08,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 631. [2022-07-13 02:17:08,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 607 states have (on average 1.2092257001647446) internal successors, (734), 616 states have internal predecessors, (734), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 02:17:08,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 749 transitions. [2022-07-13 02:17:08,106 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 749 transitions. Word has length 196 [2022-07-13 02:17:08,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:17:08,106 INFO L495 AbstractCegarLoop]: Abstraction has 631 states and 749 transitions. [2022-07-13 02:17:08,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:17:08,107 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 749 transitions. [2022-07-13 02:17:08,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-13 02:17:08,109 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:17:08,109 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:17:08,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-13 02:17:08,109 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:17:08,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:17:08,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1209976693, now seen corresponding path program 1 times [2022-07-13 02:17:08,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:17:08,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106639494] [2022-07-13 02:17:08,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:17:08,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:17:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:08,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:17:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:08,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:17:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:08,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-13 02:17:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:08,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 02:17:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:08,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2022-07-13 02:17:08,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:17:08,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106639494] [2022-07-13 02:17:08,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106639494] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:17:08,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775776719] [2022-07-13 02:17:08,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:17:08,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:17:08,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:17:08,350 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:17:08,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-13 02:17:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:08,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-13 02:17:08,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:17:08,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2022-07-13 02:17:08,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 02:17:08,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775776719] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:17:08,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 02:17:08,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 16 [2022-07-13 02:17:08,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761685629] [2022-07-13 02:17:08,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:17:08,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 02:17:08,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:17:08,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 02:17:08,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-07-13 02:17:08,735 INFO L87 Difference]: Start difference. First operand 631 states and 749 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:17:09,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:17:09,020 INFO L93 Difference]: Finished difference Result 734 states and 868 transitions. [2022-07-13 02:17:09,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 02:17:09,021 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 196 [2022-07-13 02:17:09,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:17:09,023 INFO L225 Difference]: With dead ends: 734 [2022-07-13 02:17:09,023 INFO L226 Difference]: Without dead ends: 730 [2022-07-13 02:17:09,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-07-13 02:17:09,024 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 212 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 02:17:09,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 845 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 02:17:09,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2022-07-13 02:17:09,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 662. [2022-07-13 02:17:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 638 states have (on average 1.2225705329153604) internal successors, (780), 647 states have internal predecessors, (780), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 02:17:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 795 transitions. [2022-07-13 02:17:09,105 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 795 transitions. Word has length 196 [2022-07-13 02:17:09,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:17:09,106 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 795 transitions. [2022-07-13 02:17:09,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:17:09,106 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 795 transitions. [2022-07-13 02:17:09,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-07-13 02:17:09,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:17:09,108 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:17:09,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-13 02:17:09,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:17:09,331 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:17:09,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:17:09,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1145427899, now seen corresponding path program 1 times [2022-07-13 02:17:09,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:17:09,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59338950] [2022-07-13 02:17:09,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:17:09,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:17:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:09,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:17:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:09,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:17:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:09,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-13 02:17:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:09,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 02:17:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:09,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2022-07-13 02:17:09,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:17:09,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59338950] [2022-07-13 02:17:09,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59338950] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:17:09,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:17:09,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 02:17:09,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374700696] [2022-07-13 02:17:09,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:17:09,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 02:17:09,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:17:09,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 02:17:09,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 02:17:09,550 INFO L87 Difference]: Start difference. First operand 662 states and 795 transitions. Second operand has 11 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:17:09,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:17:09,996 INFO L93 Difference]: Finished difference Result 795 states and 942 transitions. [2022-07-13 02:17:09,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 02:17:09,996 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 197 [2022-07-13 02:17:09,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:17:09,998 INFO L225 Difference]: With dead ends: 795 [2022-07-13 02:17:09,999 INFO L226 Difference]: Without dead ends: 781 [2022-07-13 02:17:09,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-07-13 02:17:09,999 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 228 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 02:17:09,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1173 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 02:17:10,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2022-07-13 02:17:10,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 654. [2022-07-13 02:17:10,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 630 states have (on average 1.2095238095238094) internal successors, (762), 639 states have internal predecessors, (762), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 02:17:10,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 777 transitions. [2022-07-13 02:17:10,087 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 777 transitions. Word has length 197 [2022-07-13 02:17:10,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:17:10,088 INFO L495 AbstractCegarLoop]: Abstraction has 654 states and 777 transitions. [2022-07-13 02:17:10,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 02:17:10,088 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 777 transitions. [2022-07-13 02:17:10,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-07-13 02:17:10,090 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:17:10,090 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:17:10,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-13 02:17:10,091 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:17:10,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:17:10,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1080534868, now seen corresponding path program 1 times [2022-07-13 02:17:10,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:17:10,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452355437] [2022-07-13 02:17:10,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:17:10,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:17:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:10,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:17:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:10,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:17:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:10,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-13 02:17:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:10,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-13 02:17:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1441 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2022-07-13 02:17:10,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:17:10,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452355437] [2022-07-13 02:17:10,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452355437] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 02:17:10,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613742841] [2022-07-13 02:17:10,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:17:10,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:17:10,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 02:17:10,282 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 02:17:10,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-13 02:17:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:10,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 02:17:10,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 02:17:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1441 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2022-07-13 02:17:10,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 02:17:10,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1441 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2022-07-13 02:17:10,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613742841] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 02:17:10,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 02:17:10,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 20 [2022-07-13 02:17:10,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245856880] [2022-07-13 02:17:10,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 02:17:10,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 02:17:10,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:17:10,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 02:17:10,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2022-07-13 02:17:10,655 INFO L87 Difference]: Start difference. First operand 654 states and 777 transitions. Second operand has 20 states, 20 states have (on average 3.3) internal successors, (66), 17 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 02:17:11,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:17:11,528 INFO L93 Difference]: Finished difference Result 1136 states and 1357 transitions. [2022-07-13 02:17:11,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-13 02:17:11,529 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 17 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 197 [2022-07-13 02:17:11,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:17:11,532 INFO L225 Difference]: With dead ends: 1136 [2022-07-13 02:17:11,532 INFO L226 Difference]: Without dead ends: 939 [2022-07-13 02:17:11,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 391 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=263, Invalid=1459, Unknown=0, NotChecked=0, Total=1722 [2022-07-13 02:17:11,534 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 406 mSDsluCounter, 2589 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 02:17:11,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 2791 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 02:17:11,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-07-13 02:17:11,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 648. [2022-07-13 02:17:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 624 states have (on average 1.2083333333333333) internal successors, (754), 633 states have internal predecessors, (754), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 02:17:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 769 transitions. [2022-07-13 02:17:11,615 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 769 transitions. Word has length 197 [2022-07-13 02:17:11,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:17:11,616 INFO L495 AbstractCegarLoop]: Abstraction has 648 states and 769 transitions. [2022-07-13 02:17:11,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 17 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 02:17:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 769 transitions. [2022-07-13 02:17:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-07-13 02:17:11,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:17:11,618 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:17:11,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-07-13 02:17:11,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 02:17:11,839 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:17:11,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:17:11,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1148526217, now seen corresponding path program 1 times [2022-07-13 02:17:11,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:17:11,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231384716] [2022-07-13 02:17:11,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:17:11,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:17:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:12,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 02:17:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:12,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 02:17:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:12,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-13 02:17:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:12,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 02:17:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 02:17:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2022-07-13 02:17:12,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 02:17:12,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231384716] [2022-07-13 02:17:12,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231384716] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 02:17:12,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 02:17:12,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-13 02:17:12,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645645551] [2022-07-13 02:17:12,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 02:17:12,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 02:17:12,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 02:17:12,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 02:17:12,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-07-13 02:17:12,262 INFO L87 Difference]: Start difference. First operand 648 states and 769 transitions. Second operand has 16 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 02:17:12,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 02:17:12,959 INFO L93 Difference]: Finished difference Result 843 states and 1001 transitions. [2022-07-13 02:17:12,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 02:17:12,959 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 198 [2022-07-13 02:17:12,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 02:17:12,962 INFO L225 Difference]: With dead ends: 843 [2022-07-13 02:17:12,962 INFO L226 Difference]: Without dead ends: 839 [2022-07-13 02:17:12,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2022-07-13 02:17:12,963 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 312 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 02:17:12,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1494 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 02:17:12,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2022-07-13 02:17:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 674. [2022-07-13 02:17:13,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 651 states have (on average 1.2058371735791091) internal successors, (785), 659 states have internal predecessors, (785), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 10 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 02:17:13,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 800 transitions. [2022-07-13 02:17:13,047 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 800 transitions. Word has length 198 [2022-07-13 02:17:13,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 02:17:13,048 INFO L495 AbstractCegarLoop]: Abstraction has 674 states and 800 transitions. [2022-07-13 02:17:13,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 02:17:13,048 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 800 transitions. [2022-07-13 02:17:13,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-13 02:17:13,050 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 02:17:13,050 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:17:13,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-13 02:17:13,050 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2022-07-13 02:17:13,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 02:17:13,051 INFO L85 PathProgramCache]: Analyzing trace with hash 540150599, now seen corresponding path program 1 times [2022-07-13 02:17:13,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 02:17:13,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913504396] [2022-07-13 02:17:13,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 02:17:13,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 02:17:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 02:17:13,092 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 02:17:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 02:17:13,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 02:17:13,161 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 02:17:13,163 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2022-07-13 02:17:13,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2022-07-13 02:17:13,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2022-07-13 02:17:13,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2022-07-13 02:17:13,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2022-07-13 02:17:13,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2022-07-13 02:17:13,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2022-07-13 02:17:13,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2022-07-13 02:17:13,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2022-07-13 02:17:13,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2022-07-13 02:17:13,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2022-07-13 02:17:13,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2022-07-13 02:17:13,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2022-07-13 02:17:13,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2022-07-13 02:17:13,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2022-07-13 02:17:13,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2022-07-13 02:17:13,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2022-07-13 02:17:13,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2022-07-13 02:17:13,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2022-07-13 02:17:13,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2022-07-13 02:17:13,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2022-07-13 02:17:13,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2022-07-13 02:17:13,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-13 02:17:13,171 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 02:17:13,175 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 02:17:13,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 02:17:13 BoogieIcfgContainer [2022-07-13 02:17:13,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 02:17:13,293 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 02:17:13,294 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 02:17:13,294 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 02:17:13,294 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:15:20" (3/4) ... [2022-07-13 02:17:13,298 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 02:17:13,298 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 02:17:13,300 INFO L158 Benchmark]: Toolchain (without parser) took 113917.93ms. Allocated memory was 113.2MB in the beginning and 310.4MB in the end (delta: 197.1MB). Free memory was 84.9MB in the beginning and 223.6MB in the end (delta: -138.8MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. [2022-07-13 02:17:13,300 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory was 68.7MB in the beginning and 68.6MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 02:17:13,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.35ms. Allocated memory is still 113.2MB. Free memory was 84.5MB in the beginning and 86.2MB in the end (delta: -1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 02:17:13,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.35ms. Allocated memory is still 113.2MB. Free memory was 86.2MB in the beginning and 84.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 02:17:13,305 INFO L158 Benchmark]: Boogie Preprocessor took 25.23ms. Allocated memory is still 113.2MB. Free memory was 84.1MB in the beginning and 82.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 02:17:13,306 INFO L158 Benchmark]: RCFGBuilder took 501.97ms. Allocated memory is still 113.2MB. Free memory was 82.1MB in the beginning and 61.5MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-13 02:17:13,307 INFO L158 Benchmark]: TraceAbstraction took 113079.09ms. Allocated memory was 113.2MB in the beginning and 310.4MB in the end (delta: 197.1MB). Free memory was 60.8MB in the beginning and 223.6MB in the end (delta: -162.8MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2022-07-13 02:17:13,307 INFO L158 Benchmark]: Witness Printer took 4.52ms. Allocated memory is still 310.4MB. Free memory is still 223.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 02:17:13,308 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.19ms. Allocated memory is still 113.2MB. Free memory was 68.7MB in the beginning and 68.6MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.35ms. Allocated memory is still 113.2MB. Free memory was 84.5MB in the beginning and 86.2MB in the end (delta: -1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.35ms. Allocated memory is still 113.2MB. Free memory was 86.2MB in the beginning and 84.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.23ms. Allocated memory is still 113.2MB. Free memory was 84.1MB in the beginning and 82.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 501.97ms. Allocated memory is still 113.2MB. Free memory was 82.1MB in the beginning and 61.5MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 113079.09ms. Allocated memory was 113.2MB in the beginning and 310.4MB in the end (delta: 197.1MB). Free memory was 60.8MB in the beginning and 223.6MB in the end (delta: -162.8MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * Witness Printer took 4.52ms. Allocated memory is still 310.4MB. Free memory is still 223.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseComplement at line 76. Possible FailurePath: [L221] unsigned int a ; [L222] unsigned int ma = __VERIFIER_nondet_uint(); [L223] signed char ea = __VERIFIER_nondet_char(); [L224] unsigned int b ; [L225] unsigned int mb = __VERIFIER_nondet_uint(); [L226] signed char eb = __VERIFIER_nondet_char(); [L227] unsigned int r_mul ; [L228] unsigned int zero ; [L229] unsigned int one ; [L230] int sa ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; VAL [ea=-1, eb=-127] [L238] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=0, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, \result=0, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L238] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-1, eb=-127, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L238] zero = base2flt(0, 0) [L239] CALL, EXPR base2flt(1, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=0, m=1, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=0, m=1, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L35] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=0, m=1, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=0, m=1, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=0, m=1, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-1, m=2, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-1, m=2, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-1, m=2, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-1, m=2, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-2, m=4, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-2, m=4, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-2, m=4, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-2, m=4, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-3, m=8, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-3, m=8, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-3, m=8, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-3, m=8, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-4, m=16, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-4, m=16, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-4, m=16, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-4, m=16, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-5, m=32, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-5, m=32, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-5, m=32, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-5, m=32, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-6, m=64, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-6, m=64, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-6, m=64, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-6, m=64, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-7, m=128, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-7, m=128, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-7, m=128, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-7, m=128, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-8, m=256, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-8, m=256, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-8, m=256, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-8, m=256, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-9, m=512, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-9, m=512, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-9, m=512, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-9, m=512, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-10, m=1024, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-10, m=1024, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-10, m=1024, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-10, m=1024, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-11, m=2048, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-11, m=2048, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-11, m=2048, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-11, m=2048, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-12, m=4096, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-12, m=4096, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-12, m=4096, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-12, m=4096, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-13, m=8192, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-13, m=8192, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-13, m=8192, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-13, m=8192, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-14, m=16384, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-14, m=16384, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-14, m=16384, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-14, m=16384, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-15, m=32768, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-15, m=32768, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-15, m=32768, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-15, m=32768, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-16, m=65536, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-16, m=65536, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-16, m=65536, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-16, m=65536, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-17, m=131072, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-17, m=131072, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-17, m=131072, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-17, m=131072, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-18, m=262144, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-18, m=262144, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-18, m=262144, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-18, m=262144, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-19, m=524288, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-19, m=524288, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-19, m=524288, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-19, m=524288, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-20, m=1048576, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-20, m=1048576, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-20, m=1048576, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-20, m=1048576, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-21, m=2097152, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-21, m=2097152, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-21, m=2097152, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-21, m=2097152, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-22, m=4194304, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-22, m=4194304, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-22, m=4194304, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-22, m=4194304, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-23, m=8388608, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-23, m=8388608, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-23, m=8388608, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-23, m=8388608, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-24, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L47] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-24, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-24, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-24, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-24, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=36028799166447617] [L77] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, e=-24, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=1744830464, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L78] __retres4 = res VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, __retres4=1744830464, e=-24, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=1744830464, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=1, \old(res = m | ((unsigned int )(e + 128) << 24U))=36028799166447617, \result=1744830464, __retres4=1744830464, e=-24, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=1744830464, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L239] RET, EXPR base2flt(1, 0) VAL [base2flt(1, 0)=1744830464, ea=-1, eb=-127, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464, zero=0] [L239] one = base2flt(1, 0) [L240] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L29] COND FALSE !(! m) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L57] COND TRUE 1 VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-1, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L77] EXPR e + 128 VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L77] EXPR e + 128 VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=1744830464] [L77] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483646, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L78] __retres4 = res VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, __retres4=2147483646, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483646, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L80] return (__retres4); VAL [\old(e)=-1, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=1744830464, \result=2147483646, __retres4=2147483646, e=-1, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483646, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L240] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=2147483646, ea=-1, eb=-127, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, one=1744830464, res = m | ((unsigned int )(e + 128) << 24U)=2130706432, zero=0] [L240] a = base2flt(ma, ea) [L241] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L29] COND FALSE !(! m) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L57] COND TRUE 1 VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=16777216, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L77] EXPR e + 128 VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L77] EXPR e + 128 VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=0, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=2130706432] [L77] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, e=-127, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483647, res = m | ((unsigned int )(e + 128) << 24U)=16777216] [L78] __retres4 = res VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, __retres4=2147483647, e=-127, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483647, res = m | ((unsigned int )(e + 128) << 24U)=16777216] [L80] return (__retres4); VAL [\old(e)=-127, \old(m = m & ~ (1U << 24U))=36028799166447616, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=2130706432, \result=36028799166447615, __retres4=2147483647, e=-127, m=0, m = m & ~ (1U << 24U)=36028799166447616, res=2147483647, res = m | ((unsigned int )(e + 128) << 24U)=16777216] [L241] RET, EXPR base2flt(mb, eb) VAL [a=2147483646, base2flt(mb, eb)=36028799166447615, ea=-1, eb=-127, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, one=1744830464, res = m | ((unsigned int )(e + 128) << 24U)=16777216, zero=0] [L241] b = base2flt(mb, eb) [L243] COND FALSE !(a < zero) VAL [a=2147483646, b=2147483647, ea=-1, eb=-127, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, one=1744830464, res = m | ((unsigned int )(e + 128) << 24U)=16777216, zero=0] [L246] COND TRUE a > zero [L247] tmp = 1 VAL [a=2147483646, b=2147483647, ea=-1, eb=-127, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, one=1744830464, res = m | ((unsigned int )(e + 128) << 24U)=16777216, tmp=1, zero=0] [L251] sa = tmp VAL [a=2147483646, b=2147483647, ea=-1, eb=-127, m = m & ~ (1U << 24U)=36028799166447616, ma=16777216, mb=16777216, one=1744830464, res = m | ((unsigned int )(e + 128) << 24U)=16777216, sa=1, tmp=1, zero=0] [L254] CALL mulflt(a, b) [L148] unsigned int res ; [L149] unsigned int ma ; [L150] unsigned int mb ; [L151] unsigned long long accu ; [L152] int ea ; [L153] int eb ; [L154] unsigned int tmp ; [L155] unsigned int __retres10 ; VAL [\old(a)=2147483646, \old(b)=2147483647, a=2147483646, b=2147483647, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=16777216] [L158] COND TRUE a < b [L159] tmp = a [L160] a = b [L161] b = tmp VAL [\old(a)=2147483646, \old(b)=2147483647, a=2147483647, b=2147483646, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=16777216, tmp=2147483646] [L165] COND FALSE !(! b) VAL [\old(a)=2147483646, \old(b)=2147483647, a=2147483647, b=2147483646, m = m & ~ (1U << 24U)=36028799166447616, res = m | ((unsigned int )(e + 128) << 24U)=16777216, tmp=2147483646] [L171] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=2147483646, \old(b)=2147483647, a=2147483647, b=2147483646, m = m & ~ (1U << 24U)=36028799166447616, ma=16777214, ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=16777216, tmp=2147483646] [L172] (int )(a >> 24U) - 128 VAL [\old(a)=2147483646, \old(b)=2147483647, a=2147483647, b=2147483646, m = m & ~ (1U << 24U)=36028799166447616, ma=16777214, ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=16777216, tmp=2147483646] - 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: 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 128 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 112.9s, OverallIterations: 37, TraceHistogramMax: 24, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 92.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16487 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16475 mSDsluCounter, 38452 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33358 mSDsCounter, 3130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13227 IncrementalHoareTripleChecker+Invalid, 16357 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3130 mSolverCounterUnsat, 5094 mSDtfsCounter, 13227 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4784 GetRequests, 3915 SyntacticMatches, 4 SemanticMatches, 865 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10988 ImplicationChecksByTransitivity, 84.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=674occurred in iteration=36, InterpolantAutomatonStates: 653, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 36 MinimizatonAttempts, 10318 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 5788 NumberOfCodeBlocks, 5578 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 6999 ConstructedInterpolants, 0 QuantifiedInterpolants, 20671 SizeOfPredicates, 76 NumberOfNonLiveVariables, 5246 ConjunctsInSsa, 289 ConjunctsInUnsatCore, 72 InterpolantComputations, 25 PerfectInterpolantSequences, 24796/29925 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-13 02:17:13,443 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 No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample