./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-restricted-15/Narrowing.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 574ddb4e 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/termination-restricted-15/Narrowing.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 65d96571ae692dc892a607d17412b050d92bd8365fc1d6c09a627f6750d6e1ac --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 09:32:01,568 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 09:32:01,571 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 09:32:01,609 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 09:32:01,610 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 09:32:01,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 09:32:01,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 09:32:01,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 09:32:01,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 09:32:01,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 09:32:01,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 09:32:01,626 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 09:32:01,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 09:32:01,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 09:32:01,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 09:32:01,630 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 09:32:01,631 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 09:32:01,632 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 09:32:01,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 09:32:01,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 09:32:01,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 09:32:01,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 09:32:01,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 09:32:01,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 09:32:01,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 09:32:01,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 09:32:01,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 09:32:01,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 09:32:01,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 09:32:01,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 09:32:01,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 09:32:01,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 09:32:01,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 09:32:01,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 09:32:01,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 09:32:01,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 09:32:01,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 09:32:01,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 09:32:01,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 09:32:01,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 09:32:01,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 09:32:01,654 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2023-02-17 09:32:01,681 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 09:32:01,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 09:32:01,681 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 09:32:01,682 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 09:32:01,682 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 09:32:01,682 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 09:32:01,683 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 09:32:01,683 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 09:32:01,683 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 09:32:01,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 09:32:01,684 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 09:32:01,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 09:32:01,684 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 09:32:01,684 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 09:32:01,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 09:32:01,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 09:32:01,685 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-17 09:32:01,685 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 09:32:01,685 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 09:32:01,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 09:32:01,685 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 09:32:01,686 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 09:32:01,686 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 09:32:01,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 09:32:01,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 09:32:01,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 09:32:01,686 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 09:32:01,686 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 09:32:01,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 09:32:01,687 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 09:32:01,687 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 09:32:01,687 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 09:32:01,687 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 09:32:01,687 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 09:32:01,687 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65d96571ae692dc892a607d17412b050d92bd8365fc1d6c09a627f6750d6e1ac [2023-02-17 09:32:01,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 09:32:01,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 09:32:01,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 09:32:01,939 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 09:32:01,939 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 09:32:01,941 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Narrowing.c [2023-02-17 09:32:03,044 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 09:32:03,213 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 09:32:03,213 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Narrowing.c [2023-02-17 09:32:03,217 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d08874e06/0d32c0a22eb24d1db095bd4f4cebef97/FLAG1d14a99d7 [2023-02-17 09:32:03,228 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d08874e06/0d32c0a22eb24d1db095bd4f4cebef97 [2023-02-17 09:32:03,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 09:32:03,233 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 09:32:03,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 09:32:03,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 09:32:03,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 09:32:03,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 09:32:03" (1/1) ... [2023-02-17 09:32:03,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e6b6501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:32:03, skipping insertion in model container [2023-02-17 09:32:03,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 09:32:03" (1/1) ... [2023-02-17 09:32:03,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 09:32:03,257 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 09:32:03,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 09:32:03,364 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 09:32:03,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 09:32:03,388 INFO L208 MainTranslator]: Completed translation [2023-02-17 09:32:03,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:32:03 WrapperNode [2023-02-17 09:32:03,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 09:32:03,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 09:32:03,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 09:32:03,390 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 09:32:03,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:32:03" (1/1) ... [2023-02-17 09:32:03,399 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:32:03" (1/1) ... [2023-02-17 09:32:03,414 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2023-02-17 09:32:03,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 09:32:03,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 09:32:03,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 09:32:03,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 09:32:03,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:32:03" (1/1) ... [2023-02-17 09:32:03,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:32:03" (1/1) ... [2023-02-17 09:32:03,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:32:03" (1/1) ... [2023-02-17 09:32:03,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:32:03" (1/1) ... [2023-02-17 09:32:03,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:32:03" (1/1) ... [2023-02-17 09:32:03,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:32:03" (1/1) ... [2023-02-17 09:32:03,434 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:32:03" (1/1) ... [2023-02-17 09:32:03,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:32:03" (1/1) ... [2023-02-17 09:32:03,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 09:32:03,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 09:32:03,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 09:32:03,443 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 09:32:03,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:32:03" (1/1) ... [2023-02-17 09:32:03,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 09:32:03,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:32:03,474 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 09:32:03,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 09:32:03,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 09:32:03,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 09:32:03,571 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 09:32:03,572 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 09:32:03,659 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 09:32:03,664 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 09:32:03,664 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 09:32:03,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:32:03 BoogieIcfgContainer [2023-02-17 09:32:03,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 09:32:03,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 09:32:03,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 09:32:03,671 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 09:32:03,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 09:32:03" (1/3) ... [2023-02-17 09:32:03,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b158a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 09:32:03, skipping insertion in model container [2023-02-17 09:32:03,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:32:03" (2/3) ... [2023-02-17 09:32:03,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b158a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 09:32:03, skipping insertion in model container [2023-02-17 09:32:03,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:32:03" (3/3) ... [2023-02-17 09:32:03,673 INFO L112 eAbstractionObserver]: Analyzing ICFG Narrowing.c [2023-02-17 09:32:03,689 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 09:32:03,689 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-02-17 09:32:03,730 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 09:32:03,736 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@739b132e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 09:32:03,736 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-02-17 09:32:03,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:03,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-17 09:32:03,749 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:32:03,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:32:03,750 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-17 09:32:03,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:32:03,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1810724077, now seen corresponding path program 1 times [2023-02-17 09:32:03,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:32:03,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720529397] [2023-02-17 09:32:03,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:32:03,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:32:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:32:03,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:32:03,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:32:03,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720529397] [2023-02-17 09:32:03,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720529397] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:32:03,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:32:03,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 09:32:03,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700669824] [2023-02-17 09:32:03,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:32:03,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 09:32:03,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:32:03,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:32:03,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:32:03,987 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:32:04,042 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2023-02-17 09:32:04,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:32:04,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-17 09:32:04,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:32:04,050 INFO L225 Difference]: With dead ends: 72 [2023-02-17 09:32:04,050 INFO L226 Difference]: Without dead ends: 38 [2023-02-17 09:32:04,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:32:04,055 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 24 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:32:04,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 52 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:32:04,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-17 09:32:04,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2023-02-17 09:32:04,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 33 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2023-02-17 09:32:04,079 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 7 [2023-02-17 09:32:04,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:32:04,079 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2023-02-17 09:32:04,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,080 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2023-02-17 09:32:04,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-17 09:32:04,080 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:32:04,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:32:04,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 09:32:04,081 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-17 09:32:04,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:32:04,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1810666417, now seen corresponding path program 1 times [2023-02-17 09:32:04,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:32:04,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967537362] [2023-02-17 09:32:04,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:32:04,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:32:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:32:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:32:04,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:32:04,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967537362] [2023-02-17 09:32:04,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967537362] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:32:04,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:32:04,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 09:32:04,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562960898] [2023-02-17 09:32:04,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:32:04,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 09:32:04,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:32:04,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:32:04,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:32:04,119 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:32:04,155 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2023-02-17 09:32:04,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:32:04,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-17 09:32:04,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:32:04,157 INFO L225 Difference]: With dead ends: 44 [2023-02-17 09:32:04,157 INFO L226 Difference]: Without dead ends: 43 [2023-02-17 09:32:04,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:32:04,162 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:32:04,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 23 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:32:04,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-17 09:32:04,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2023-02-17 09:32:04,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 32 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2023-02-17 09:32:04,170 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 7 [2023-02-17 09:32:04,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:32:04,170 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2023-02-17 09:32:04,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,171 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2023-02-17 09:32:04,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-17 09:32:04,171 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:32:04,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:32:04,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 09:32:04,172 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-17 09:32:04,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:32:04,172 INFO L85 PathProgramCache]: Analyzing trace with hash 297877621, now seen corresponding path program 1 times [2023-02-17 09:32:04,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:32:04,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841730542] [2023-02-17 09:32:04,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:32:04,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:32:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:32:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:32:04,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:32:04,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841730542] [2023-02-17 09:32:04,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841730542] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:32:04,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:32:04,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 09:32:04,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285841350] [2023-02-17 09:32:04,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:32:04,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 09:32:04,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:32:04,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:32:04,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:32:04,209 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:32:04,250 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2023-02-17 09:32:04,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:32:04,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-17 09:32:04,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:32:04,266 INFO L225 Difference]: With dead ends: 43 [2023-02-17 09:32:04,266 INFO L226 Difference]: Without dead ends: 42 [2023-02-17 09:32:04,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:32:04,268 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:32:04,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 24 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:32:04,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-17 09:32:04,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2023-02-17 09:32:04,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2023-02-17 09:32:04,274 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 8 [2023-02-17 09:32:04,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:32:04,274 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2023-02-17 09:32:04,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,275 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2023-02-17 09:32:04,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-17 09:32:04,275 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:32:04,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:32:04,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 09:32:04,276 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-17 09:32:04,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:32:04,276 INFO L85 PathProgramCache]: Analyzing trace with hash 297877814, now seen corresponding path program 1 times [2023-02-17 09:32:04,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:32:04,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077345741] [2023-02-17 09:32:04,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:32:04,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:32:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:32:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:32:04,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:32:04,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077345741] [2023-02-17 09:32:04,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077345741] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:32:04,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:32:04,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 09:32:04,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519730354] [2023-02-17 09:32:04,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:32:04,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 09:32:04,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:32:04,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:32:04,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:32:04,328 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:32:04,351 INFO L93 Difference]: Finished difference Result 66 states and 88 transitions. [2023-02-17 09:32:04,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:32:04,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-17 09:32:04,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:32:04,354 INFO L225 Difference]: With dead ends: 66 [2023-02-17 09:32:04,355 INFO L226 Difference]: Without dead ends: 36 [2023-02-17 09:32:04,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:32:04,356 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:32:04,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 52 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:32:04,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-02-17 09:32:04,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2023-02-17 09:32:04,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 31 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2023-02-17 09:32:04,361 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 8 [2023-02-17 09:32:04,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:32:04,362 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2023-02-17 09:32:04,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,362 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2023-02-17 09:32:04,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-17 09:32:04,363 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:32:04,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:32:04,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-17 09:32:04,363 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-17 09:32:04,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:32:04,364 INFO L85 PathProgramCache]: Analyzing trace with hash 296090354, now seen corresponding path program 1 times [2023-02-17 09:32:04,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:32:04,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19527169] [2023-02-17 09:32:04,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:32:04,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:32:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:32:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:32:04,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:32:04,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19527169] [2023-02-17 09:32:04,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19527169] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:32:04,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:32:04,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 09:32:04,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912940118] [2023-02-17 09:32:04,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:32:04,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 09:32:04,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:32:04,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:32:04,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:32:04,419 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:32:04,440 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2023-02-17 09:32:04,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:32:04,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-17 09:32:04,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:32:04,449 INFO L225 Difference]: With dead ends: 66 [2023-02-17 09:32:04,450 INFO L226 Difference]: Without dead ends: 36 [2023-02-17 09:32:04,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:32:04,452 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:32:04,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 57 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:32:04,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-02-17 09:32:04,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2023-02-17 09:32:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2023-02-17 09:32:04,466 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 8 [2023-02-17 09:32:04,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:32:04,467 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2023-02-17 09:32:04,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,469 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2023-02-17 09:32:04,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-17 09:32:04,470 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:32:04,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:32:04,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-17 09:32:04,471 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-17 09:32:04,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:32:04,471 INFO L85 PathProgramCache]: Analyzing trace with hash 296084139, now seen corresponding path program 1 times [2023-02-17 09:32:04,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:32:04,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471269792] [2023-02-17 09:32:04,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:32:04,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:32:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:32:04,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:32:04,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:32:04,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471269792] [2023-02-17 09:32:04,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471269792] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:32:04,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:32:04,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 09:32:04,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329913952] [2023-02-17 09:32:04,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:32:04,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 09:32:04,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:32:04,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:32:04,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:32:04,514 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:32:04,565 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2023-02-17 09:32:04,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:32:04,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-17 09:32:04,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:32:04,566 INFO L225 Difference]: With dead ends: 54 [2023-02-17 09:32:04,566 INFO L226 Difference]: Without dead ends: 52 [2023-02-17 09:32:04,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:32:04,568 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 16 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:32:04,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 48 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:32:04,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-17 09:32:04,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2023-02-17 09:32:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 47 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 66 transitions. [2023-02-17 09:32:04,581 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 66 transitions. Word has length 8 [2023-02-17 09:32:04,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:32:04,582 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 66 transitions. [2023-02-17 09:32:04,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,582 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2023-02-17 09:32:04,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 09:32:04,582 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:32:04,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:32:04,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-17 09:32:04,583 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-17 09:32:04,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:32:04,583 INFO L85 PathProgramCache]: Analyzing trace with hash 644271729, now seen corresponding path program 1 times [2023-02-17 09:32:04,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:32:04,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383277657] [2023-02-17 09:32:04,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:32:04,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:32:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:32:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:32:04,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:32:04,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383277657] [2023-02-17 09:32:04,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383277657] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:32:04,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:32:04,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 09:32:04,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480805428] [2023-02-17 09:32:04,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:32:04,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 09:32:04,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:32:04,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:32:04,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:32:04,608 INFO L87 Difference]: Start difference. First operand 48 states and 66 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:32:04,623 INFO L93 Difference]: Finished difference Result 48 states and 66 transitions. [2023-02-17 09:32:04,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:32:04,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-17 09:32:04,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:32:04,624 INFO L225 Difference]: With dead ends: 48 [2023-02-17 09:32:04,624 INFO L226 Difference]: Without dead ends: 47 [2023-02-17 09:32:04,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:32:04,626 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:32:04,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 15 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:32:04,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-17 09:32:04,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2023-02-17 09:32:04,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 34 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2023-02-17 09:32:04,630 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 9 [2023-02-17 09:32:04,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:32:04,630 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2023-02-17 09:32:04,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,631 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2023-02-17 09:32:04,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 09:32:04,631 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:32:04,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:32:04,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-17 09:32:04,632 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-17 09:32:04,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:32:04,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1502412806, now seen corresponding path program 1 times [2023-02-17 09:32:04,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:32:04,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954508117] [2023-02-17 09:32:04,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:32:04,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:32:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:32:04,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:32:04,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:32:04,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954508117] [2023-02-17 09:32:04,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954508117] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:32:04,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:32:04,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 09:32:04,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531606242] [2023-02-17 09:32:04,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:32:04,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 09:32:04,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:32:04,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:32:04,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:32:04,684 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:32:04,712 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2023-02-17 09:32:04,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:32:04,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-17 09:32:04,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:32:04,714 INFO L225 Difference]: With dead ends: 66 [2023-02-17 09:32:04,714 INFO L226 Difference]: Without dead ends: 64 [2023-02-17 09:32:04,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:32:04,715 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:32:04,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:32:04,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-17 09:32:04,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2023-02-17 09:32:04,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 60 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2023-02-17 09:32:04,723 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 10 [2023-02-17 09:32:04,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:32:04,723 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2023-02-17 09:32:04,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,723 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2023-02-17 09:32:04,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 09:32:04,724 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:32:04,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:32:04,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-17 09:32:04,724 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-17 09:32:04,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:32:04,725 INFO L85 PathProgramCache]: Analyzing trace with hash 669843347, now seen corresponding path program 1 times [2023-02-17 09:32:04,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:32:04,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709779225] [2023-02-17 09:32:04,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:32:04,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:32:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:32:04,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:32:04,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:32:04,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709779225] [2023-02-17 09:32:04,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709779225] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:32:04,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:32:04,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 09:32:04,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798516546] [2023-02-17 09:32:04,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:32:04,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 09:32:04,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:32:04,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:32:04,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:32:04,748 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:32:04,772 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2023-02-17 09:32:04,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:32:04,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-17 09:32:04,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:32:04,773 INFO L225 Difference]: With dead ends: 61 [2023-02-17 09:32:04,773 INFO L226 Difference]: Without dead ends: 59 [2023-02-17 09:32:04,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:32:04,774 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:32:04,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:32:04,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-17 09:32:04,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-02-17 09:32:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 58 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2023-02-17 09:32:04,781 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 11 [2023-02-17 09:32:04,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:32:04,781 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2023-02-17 09:32:04,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:04,781 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2023-02-17 09:32:04,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 09:32:04,782 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:32:04,782 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:32:04,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-17 09:32:04,782 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-17 09:32:04,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:32:04,783 INFO L85 PathProgramCache]: Analyzing trace with hash -749408958, now seen corresponding path program 1 times [2023-02-17 09:32:04,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:32:04,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952086819] [2023-02-17 09:32:04,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:32:04,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:32:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:32:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:32:04,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:32:04,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952086819] [2023-02-17 09:32:04,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952086819] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:32:04,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953465682] [2023-02-17 09:32:04,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:32:04,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:32:04,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:32:04,840 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:32:04,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 09:32:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:32:04,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 09:32:04,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:32:04,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:32:04,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:32:04,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:32:04,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953465682] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:32:04,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:32:04,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-02-17 09:32:04,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133847179] [2023-02-17 09:32:04,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:32:04,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 09:32:04,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:32:04,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 09:32:04,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-17 09:32:04,978 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:05,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:32:05,066 INFO L93 Difference]: Finished difference Result 199 states and 253 transitions. [2023-02-17 09:32:05,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 09:32:05,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-17 09:32:05,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:32:05,072 INFO L225 Difference]: With dead ends: 199 [2023-02-17 09:32:05,072 INFO L226 Difference]: Without dead ends: 198 [2023-02-17 09:32:05,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-17 09:32:05,076 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 56 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 09:32:05,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 89 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 09:32:05,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-02-17 09:32:05,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 128. [2023-02-17 09:32:05,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 125 states have (on average 1.352) internal successors, (169), 127 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:05,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 169 transitions. [2023-02-17 09:32:05,089 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 169 transitions. Word has length 18 [2023-02-17 09:32:05,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:32:05,089 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 169 transitions. [2023-02-17 09:32:05,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:05,089 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 169 transitions. [2023-02-17 09:32:05,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 09:32:05,090 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:32:05,090 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:32:05,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 09:32:05,296 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,SelfDestructingSolverStorable9 [2023-02-17 09:32:05,296 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-17 09:32:05,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:32:05,297 INFO L85 PathProgramCache]: Analyzing trace with hash 906754391, now seen corresponding path program 1 times [2023-02-17 09:32:05,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:32:05,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547987820] [2023-02-17 09:32:05,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:32:05,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:32:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:32:05,350 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:32:05,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:32:05,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547987820] [2023-02-17 09:32:05,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547987820] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:32:05,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046757327] [2023-02-17 09:32:05,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:32:05,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:32:05,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:32:05,352 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:32:05,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 09:32:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:32:05,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 09:32:05,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:32:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:32:05,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 09:32:05,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046757327] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:32:05,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 09:32:05,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2023-02-17 09:32:05,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662149117] [2023-02-17 09:32:05,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:32:05,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 09:32:05,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:32:05,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 09:32:05,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 09:32:05,418 INFO L87 Difference]: Start difference. First operand 128 states and 169 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:05,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:32:05,498 INFO L93 Difference]: Finished difference Result 327 states and 430 transitions. [2023-02-17 09:32:05,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 09:32:05,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-17 09:32:05,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:32:05,500 INFO L225 Difference]: With dead ends: 327 [2023-02-17 09:32:05,500 INFO L226 Difference]: Without dead ends: 255 [2023-02-17 09:32:05,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 09:32:05,502 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 09:32:05,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 29 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 09:32:05,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-02-17 09:32:05,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 234. [2023-02-17 09:32:05,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 231 states have (on average 1.3073593073593073) internal successors, (302), 233 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:05,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 302 transitions. [2023-02-17 09:32:05,516 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 302 transitions. Word has length 22 [2023-02-17 09:32:05,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:32:05,517 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 302 transitions. [2023-02-17 09:32:05,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:05,517 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 302 transitions. [2023-02-17 09:32:05,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 09:32:05,518 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:32:05,518 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:32:05,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 09:32:05,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-17 09:32:05,724 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-17 09:32:05,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:32:05,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1087390315, now seen corresponding path program 1 times [2023-02-17 09:32:05,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:32:05,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533719773] [2023-02-17 09:32:05,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:32:05,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:32:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:32:05,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:32:05,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:32:05,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533719773] [2023-02-17 09:32:05,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533719773] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:32:05,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25931882] [2023-02-17 09:32:05,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:32:05,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:32:05,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:32:05,775 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:32:05,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 09:32:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:32:05,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 09:32:05,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:32:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:32:05,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:32:05,833 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:32:05,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25931882] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:32:05,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:32:05,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-02-17 09:32:05,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023864961] [2023-02-17 09:32:05,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:32:05,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 09:32:05,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:32:05,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 09:32:05,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-17 09:32:05,835 INFO L87 Difference]: Start difference. First operand 234 states and 302 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:05,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:32:05,880 INFO L93 Difference]: Finished difference Result 363 states and 472 transitions. [2023-02-17 09:32:05,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 09:32:05,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-17 09:32:05,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:32:05,882 INFO L225 Difference]: With dead ends: 363 [2023-02-17 09:32:05,882 INFO L226 Difference]: Without dead ends: 361 [2023-02-17 09:32:05,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-17 09:32:05,883 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:32:05,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 39 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:32:05,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2023-02-17 09:32:05,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 120. [2023-02-17 09:32:05,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.2352941176470589) internal successors, (147), 119 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:05,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 147 transitions. [2023-02-17 09:32:05,894 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 147 transitions. Word has length 22 [2023-02-17 09:32:05,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:32:05,894 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 147 transitions. [2023-02-17 09:32:05,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:05,894 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2023-02-17 09:32:05,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-17 09:32:05,895 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:32:05,896 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2023-02-17 09:32:05,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 09:32:06,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:32:06,102 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-17 09:32:06,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:32:06,102 INFO L85 PathProgramCache]: Analyzing trace with hash 380856455, now seen corresponding path program 2 times [2023-02-17 09:32:06,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:32:06,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11641826] [2023-02-17 09:32:06,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:32:06,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:32:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:32:06,159 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-02-17 09:32:06,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:32:06,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11641826] [2023-02-17 09:32:06,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11641826] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:32:06,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788059700] [2023-02-17 09:32:06,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 09:32:06,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:32:06,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:32:06,161 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 09:32:06,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 09:32:06,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-17 09:32:06,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 09:32:06,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 09:32:06,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:32:06,207 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-02-17 09:32:06,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:32:06,231 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-02-17 09:32:06,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788059700] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:32:06,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:32:06,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-02-17 09:32:06,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927050006] [2023-02-17 09:32:06,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:32:06,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 09:32:06,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:32:06,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 09:32:06,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 09:32:06,238 INFO L87 Difference]: Start difference. First operand 120 states and 147 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:06,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:32:06,276 INFO L93 Difference]: Finished difference Result 125 states and 152 transitions. [2023-02-17 09:32:06,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 09:32:06,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2023-02-17 09:32:06,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:32:06,278 INFO L225 Difference]: With dead ends: 125 [2023-02-17 09:32:06,278 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 09:32:06,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-02-17 09:32:06,287 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:32:06,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 10 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:32:06,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 09:32:06,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 09:32:06,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:06,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 09:32:06,288 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2023-02-17 09:32:06,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:32:06,288 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 09:32:06,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:32:06,288 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 09:32:06,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 09:32:06,291 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2023-02-17 09:32:06,291 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2023-02-17 09:32:06,291 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2023-02-17 09:32:06,291 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2023-02-17 09:32:06,291 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2023-02-17 09:32:06,291 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2023-02-17 09:32:06,292 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2023-02-17 09:32:06,292 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2023-02-17 09:32:06,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 09:32:06,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:32:06,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 09:32:06,504 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2023-02-17 09:32:06,505 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2023-02-17 09:32:06,505 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2023-02-17 09:32:06,505 INFO L899 garLoopResultBuilder]: For program point L23-1(lines 23 25) no Hoare annotation was computed. [2023-02-17 09:32:06,505 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 5 32) the Hoare annotation is: true [2023-02-17 09:32:06,505 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2023-02-17 09:32:06,505 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 09:32:06,505 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2023-02-17 09:32:06,505 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2023-02-17 09:32:06,506 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 09:32:06,506 INFO L899 garLoopResultBuilder]: For program point L24(line 24) no Hoare annotation was computed. [2023-02-17 09:32:06,506 INFO L899 garLoopResultBuilder]: For program point L24-1(line 24) no Hoare annotation was computed. [2023-02-17 09:32:06,506 INFO L899 garLoopResultBuilder]: For program point L20-1(lines 13 29) no Hoare annotation was computed. [2023-02-17 09:32:06,506 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2023-02-17 09:32:06,506 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 09:32:06,506 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2023-02-17 09:32:06,506 INFO L899 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2023-02-17 09:32:06,506 INFO L899 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2023-02-17 09:32:06,506 INFO L899 garLoopResultBuilder]: For program point L17-1(lines 13 29) no Hoare annotation was computed. [2023-02-17 09:32:06,506 INFO L899 garLoopResultBuilder]: For program point L13-2(lines 13 29) no Hoare annotation was computed. [2023-02-17 09:32:06,507 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 09:32:06,507 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2023-02-17 09:32:06,507 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2023-02-17 09:32:06,507 INFO L899 garLoopResultBuilder]: For program point L26-1(lines 26 28) no Hoare annotation was computed. [2023-02-17 09:32:06,508 INFO L895 garLoopResultBuilder]: At program point L26-3(lines 13 29) the Hoare annotation is: (let ((.cse24 (<= |ULTIMATE.start_main_~i~0#1| 0)) (.cse11 (<= |ULTIMATE.start_main_~i~0#1| 2147483647)) (.cse8 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse10 (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648))) (.cse20 (+ |ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse21 (< .cse20 2147483647)) (.cse0 (<= |ULTIMATE.start_main_~range~0#1| 20)) (.cse23 (let ((.cse25 (let ((.cse27 (<= |ULTIMATE.start_main_~up~0#1| 0))) (let ((.cse28 (and .cse27 .cse10))) (or .cse27 .cse28 (and .cse8 (or .cse27 .cse28)))))) (.cse26 (= |ULTIMATE.start_main_~up~0#1| 0))) (or (and .cse11 .cse25 .cse26) (and .cse24 .cse11 .cse25 .cse26)))) (.cse14 (<= 0 (+ |ULTIMATE.start_main_~range~0#1| (- 20))))) (let ((.cse19 (or (and .cse0 .cse23 .cse14) (and .cse0 .cse21 .cse23 .cse14) (and .cse0 .cse24 .cse23 .cse14))) (.cse17 (or (and .cse0 .cse23) (and .cse0 .cse21 .cse23) (and .cse0 .cse24 .cse23))) (.cse12 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (<= (+ 1 |ULTIMATE.start_main_~i~0#1|) 2147483647)) (.cse22 (>= (+ |ULTIMATE.start_main_~range~0#1| (- 2)) (- 2147483648))) (.cse7 (<= 0 (+ |ULTIMATE.start_main_~range~0#1| (- 19)))) (.cse6 (= (+ |ULTIMATE.start_main_~up~0#1| (- 1)) 0)) (.cse13 (< (- 2147483647) (+ |ULTIMATE.start_main_~range~0#1| (- 1))))) (let ((.cse2 (or (and .cse0 .cse6 .cse8 .cse21 .cse10 .cse11 .cse22) (and .cse0 .cse6 .cse8 .cse21 .cse10 .cse11 .cse14) (and .cse0 .cse6 .cse7 .cse8 .cse21 .cse10 .cse11) (and .cse0 .cse6 .cse8 .cse21 .cse13 .cse10 .cse11))) (.cse5 (or (and .cse0 .cse6 .cse8 .cse13 .cse1 .cse10 .cse11) (and .cse0 .cse6 .cse8 .cse1 .cse10 .cse11 .cse14) (and .cse0 .cse6 .cse7 .cse8 .cse1 .cse10 .cse11) (and .cse0 .cse6 .cse8 .cse1 .cse10 .cse11 .cse22))) (.cse15 (or (and .cse0 .cse6 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse0 .cse6 .cse8 .cse13 .cse10 .cse11 .cse12) (and .cse0 .cse6 .cse8 .cse10 .cse11 .cse22 .cse12))) (.cse3 (or (and .cse0 .cse6 .cse8 .cse10 .cse11 .cse14) (and .cse0 .cse6 .cse7 .cse8 .cse10 .cse11) (and .cse0 .cse6 .cse8 .cse10 .cse11 .cse22) (and .cse0 .cse6 .cse8 .cse13 .cse10 .cse11))) (.cse4 (<= |ULTIMATE.start_main_~i~0#1| 20)) (.cse16 (or (and .cse19 .cse14) (and .cse17 .cse22) (and .cse7 .cse17) (and .cse17 .cse13))) (.cse9 (>= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~range~0#1|))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse1 .cse5) (and .cse0 .cse4 .cse2) (and .cse0 (or (and .cse0 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse6 .cse8 .cse9 .cse13 .cse10 .cse11 .cse12) (and .cse0 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14)) .cse1) (and .cse0 .cse4 .cse15) (and .cse0 .cse4 .cse16) (and .cse0 .cse4 .cse5) (and .cse0 .cse1 .cse15) (and .cse0 .cse3 .cse1) (and .cse0 (let ((.cse18 (<= |ULTIMATE.start_main_~range~0#1| .cse20))) (or (and .cse17 .cse13 .cse18) (and .cse7 .cse17 .cse18) (and .cse18 .cse19 .cse14))) .cse4) (and .cse0 .cse1 (or (and .cse0 .cse6 .cse7 .cse8 .cse9 .cse1 .cse10 .cse11) (and .cse0 .cse6 .cse8 .cse9 .cse13 .cse1 .cse10 .cse11) (and .cse0 .cse6 .cse8 .cse9 .cse1 .cse10 .cse11 .cse14))) (and .cse0 (or (and .cse0 .cse6 .cse8 .cse21 .cse9 .cse10 .cse11 .cse14) (and .cse0 .cse6 .cse8 .cse21 .cse9 .cse13 .cse10 .cse11) (and .cse0 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11)) .cse1) (and .cse0 .cse16) (and .cse0 .cse1 (or (and .cse0 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse6 .cse8 .cse9 .cse13 .cse10 .cse11) (and .cse0 .cse6 .cse8 .cse9 .cse10 .cse11 .cse14)))))))) [2023-02-17 09:32:06,508 INFO L899 garLoopResultBuilder]: For program point L14(lines 14 16) no Hoare annotation was computed. [2023-02-17 09:32:06,508 INFO L899 garLoopResultBuilder]: For program point L14-2(lines 13 29) no Hoare annotation was computed. [2023-02-17 09:32:06,508 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2023-02-17 09:32:06,511 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:32:06,512 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 09:32:06,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 09:32:06 BoogieIcfgContainer [2023-02-17 09:32:06,577 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 09:32:06,577 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 09:32:06,577 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 09:32:06,578 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 09:32:06,578 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:32:03" (3/4) ... [2023-02-17 09:32:06,581 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 09:32:06,589 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-17 09:32:06,589 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-02-17 09:32:06,589 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 09:32:06,625 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 09:32:06,625 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 09:32:06,625 INFO L158 Benchmark]: Toolchain (without parser) took 3392.11ms. Allocated memory was 121.6MB in the beginning and 155.2MB in the end (delta: 33.6MB). Free memory was 78.0MB in the beginning and 49.8MB in the end (delta: 28.2MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2023-02-17 09:32:06,625 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 121.6MB. Free memory is still 95.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 09:32:06,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 153.93ms. Allocated memory is still 121.6MB. Free memory was 77.5MB in the beginning and 68.4MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-17 09:32:06,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.08ms. Allocated memory is still 121.6MB. Free memory was 68.4MB in the beginning and 67.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 09:32:06,626 INFO L158 Benchmark]: Boogie Preprocessor took 24.44ms. Allocated memory is still 121.6MB. Free memory was 67.2MB in the beginning and 66.3MB in the end (delta: 880.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 09:32:06,627 INFO L158 Benchmark]: RCFGBuilder took 224.12ms. Allocated memory is still 121.6MB. Free memory was 66.3MB in the beginning and 56.7MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 09:32:06,627 INFO L158 Benchmark]: TraceAbstraction took 2908.96ms. Allocated memory was 121.6MB in the beginning and 155.2MB in the end (delta: 33.6MB). Free memory was 55.8MB in the beginning and 52.9MB in the end (delta: 2.9MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2023-02-17 09:32:06,627 INFO L158 Benchmark]: Witness Printer took 47.53ms. Allocated memory is still 155.2MB. Free memory was 52.9MB in the beginning and 49.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-17 09:32:06,633 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.20ms. Allocated memory is still 121.6MB. Free memory is still 95.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 153.93ms. Allocated memory is still 121.6MB. Free memory was 77.5MB in the beginning and 68.4MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.08ms. Allocated memory is still 121.6MB. Free memory was 68.4MB in the beginning and 67.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.44ms. Allocated memory is still 121.6MB. Free memory was 67.2MB in the beginning and 66.3MB in the end (delta: 880.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 224.12ms. Allocated memory is still 121.6MB. Free memory was 66.3MB in the beginning and 56.7MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2908.96ms. Allocated memory was 121.6MB in the beginning and 155.2MB in the end (delta: 33.6MB). Free memory was 55.8MB in the beginning and 52.9MB in the end (delta: 2.9MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * Witness Printer took 47.53ms. Allocated memory is still 155.2MB. Free memory was 52.9MB in the beginning and 49.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 295 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 295 mSDsluCounter, 479 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 198 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 300 IncrementalHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 281 mSDtfsCounter, 300 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 195 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=11, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 383 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 19 NumberOfFragments, 4345 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 296 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 364 ConstructedInterpolants, 0 QuantifiedInterpolants, 1218 SizeOfPredicates, 5 NumberOfNonLiveVariables, 140 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 206/310 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 - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: (((((((((((((((range <= 20 && 1 + i <= 2147483647) && (((((((((range <= 20 && up + -1 == 0) && 0 <= i) && i + 1 < 2147483647) && 0 <= i + 2147483648) && i <= 2147483647) && range + -2 >= -2147483648) || ((((((range <= 20 && up + -1 == 0) && 0 <= i) && i + 1 < 2147483647) && 0 <= i + 2147483648) && i <= 2147483647) && 0 <= range + -20)) || ((((((range <= 20 && up + -1 == 0) && 0 <= range + -19) && 0 <= i) && i + 1 < 2147483647) && 0 <= i + 2147483648) && i <= 2147483647)) || ((((((range <= 20 && up + -1 == 0) && 0 <= i) && i + 1 < 2147483647) && -2147483647 < range + -1) && 0 <= i + 2147483648) && i <= 2147483647))) || ((range <= 20 && ((((((((range <= 20 && up + -1 == 0) && 0 <= i) && 0 <= i + 2147483648) && i <= 2147483647) && 0 <= range + -20) || (((((range <= 20 && up + -1 == 0) && 0 <= range + -19) && 0 <= i) && 0 <= i + 2147483648) && i <= 2147483647)) || (((((range <= 20 && up + -1 == 0) && 0 <= i) && 0 <= i + 2147483648) && i <= 2147483647) && range + -2 >= -2147483648)) || (((((range <= 20 && up + -1 == 0) && 0 <= i) && -2147483647 < range + -1) && 0 <= i + 2147483648) && i <= 2147483647))) && i <= 20)) || ((range <= 20 && 1 + i <= 2147483647) && (((((((((range <= 20 && up + -1 == 0) && 0 <= i) && -2147483647 < range + -1) && 1 + i <= 2147483647) && 0 <= i + 2147483648) && i <= 2147483647) || ((((((range <= 20 && up + -1 == 0) && 0 <= i) && 1 + i <= 2147483647) && 0 <= i + 2147483648) && i <= 2147483647) && 0 <= range + -20)) || ((((((range <= 20 && up + -1 == 0) && 0 <= range + -19) && 0 <= i) && 1 + i <= 2147483647) && 0 <= i + 2147483648) && i <= 2147483647)) || ((((((range <= 20 && up + -1 == 0) && 0 <= i) && 1 + i <= 2147483647) && 0 <= i + 2147483648) && i <= 2147483647) && range + -2 >= -2147483648)))) || ((range <= 20 && i <= 20) && (((((((((range <= 20 && up + -1 == 0) && 0 <= i) && i + 1 < 2147483647) && 0 <= i + 2147483648) && i <= 2147483647) && range + -2 >= -2147483648) || ((((((range <= 20 && up + -1 == 0) && 0 <= i) && i + 1 < 2147483647) && 0 <= i + 2147483648) && i <= 2147483647) && 0 <= range + -20)) || ((((((range <= 20 && up + -1 == 0) && 0 <= range + -19) && 0 <= i) && i + 1 < 2147483647) && 0 <= i + 2147483648) && i <= 2147483647)) || ((((((range <= 20 && up + -1 == 0) && 0 <= i) && i + 1 < 2147483647) && -2147483647 < range + -1) && 0 <= i + 2147483648) && i <= 2147483647)))) || ((range <= 20 && (((((((((range <= 20 && up + -1 == 0) && 0 <= range + -19) && 0 <= i) && i >= range) && 0 <= i + 2147483648) && i <= 2147483647) && i <= 1) || (((((((range <= 20 && up + -1 == 0) && 0 <= i) && i >= range) && -2147483647 < range + -1) && 0 <= i + 2147483648) && i <= 2147483647) && i <= 1)) || (((((((range <= 20 && up + -1 == 0) && 0 <= i) && i >= range) && 0 <= i + 2147483648) && i <= 2147483647) && i <= 1) && 0 <= range + -20))) && 1 + i <= 2147483647)) || ((range <= 20 && i <= 20) && (((((((((range <= 20 && up + -1 == 0) && 0 <= i) && 0 <= i + 2147483648) && i <= 2147483647) && i <= 1) && 0 <= range + -20) || ((((((range <= 20 && up + -1 == 0) && 0 <= range + -19) && 0 <= i) && 0 <= i + 2147483648) && i <= 2147483647) && i <= 1)) || ((((((range <= 20 && up + -1 == 0) && 0 <= i) && -2147483647 < range + -1) && 0 <= i + 2147483648) && i <= 2147483647) && i <= 1)) || ((((((range <= 20 && up + -1 == 0) && 0 <= i) && 0 <= i + 2147483648) && i <= 2147483647) && range + -2 >= -2147483648) && i <= 1)))) || ((range <= 20 && i <= 20) && ((((((((range <= 20 && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0))) && 0 <= range + -20) || (((range <= 20 && i + 1 < 2147483647) && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0))) && 0 <= range + -20)) || (((range <= 20 && i <= 0) && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0))) && 0 <= range + -20)) && 0 <= range + -20) || ((((range <= 20 && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0))) || ((range <= 20 && i + 1 < 2147483647) && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0)))) || ((range <= 20 && i <= 0) && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0)))) && range + -2 >= -2147483648)) || (0 <= range + -19 && (((range <= 20 && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0))) || ((range <= 20 && i + 1 < 2147483647) && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0)))) || ((range <= 20 && i <= 0) && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0)))))) || ((((range <= 20 && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0))) || ((range <= 20 && i + 1 < 2147483647) && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0)))) || ((range <= 20 && i <= 0) && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0)))) && -2147483647 < range + -1)))) || ((range <= 20 && i <= 20) && (((((((((range <= 20 && up + -1 == 0) && 0 <= i) && -2147483647 < range + -1) && 1 + i <= 2147483647) && 0 <= i + 2147483648) && i <= 2147483647) || ((((((range <= 20 && up + -1 == 0) && 0 <= i) && 1 + i <= 2147483647) && 0 <= i + 2147483648) && i <= 2147483647) && 0 <= range + -20)) || ((((((range <= 20 && up + -1 == 0) && 0 <= range + -19) && 0 <= i) && 1 + i <= 2147483647) && 0 <= i + 2147483648) && i <= 2147483647)) || ((((((range <= 20 && up + -1 == 0) && 0 <= i) && 1 + i <= 2147483647) && 0 <= i + 2147483648) && i <= 2147483647) && range + -2 >= -2147483648)))) || ((range <= 20 && 1 + i <= 2147483647) && (((((((((range <= 20 && up + -1 == 0) && 0 <= i) && 0 <= i + 2147483648) && i <= 2147483647) && i <= 1) && 0 <= range + -20) || ((((((range <= 20 && up + -1 == 0) && 0 <= range + -19) && 0 <= i) && 0 <= i + 2147483648) && i <= 2147483647) && i <= 1)) || ((((((range <= 20 && up + -1 == 0) && 0 <= i) && -2147483647 < range + -1) && 0 <= i + 2147483648) && i <= 2147483647) && i <= 1)) || ((((((range <= 20 && up + -1 == 0) && 0 <= i) && 0 <= i + 2147483648) && i <= 2147483647) && range + -2 >= -2147483648) && i <= 1)))) || ((range <= 20 && ((((((((range <= 20 && up + -1 == 0) && 0 <= i) && 0 <= i + 2147483648) && i <= 2147483647) && 0 <= range + -20) || (((((range <= 20 && up + -1 == 0) && 0 <= range + -19) && 0 <= i) && 0 <= i + 2147483648) && i <= 2147483647)) || (((((range <= 20 && up + -1 == 0) && 0 <= i) && 0 <= i + 2147483648) && i <= 2147483647) && range + -2 >= -2147483648)) || (((((range <= 20 && up + -1 == 0) && 0 <= i) && -2147483647 < range + -1) && 0 <= i + 2147483648) && i <= 2147483647))) && 1 + i <= 2147483647)) || ((range <= 20 && (((((((range <= 20 && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0))) || ((range <= 20 && i + 1 < 2147483647) && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0)))) || ((range <= 20 && i <= 0) && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0)))) && -2147483647 < range + -1) && range <= i + 1) || ((0 <= range + -19 && (((range <= 20 && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0))) || ((range <= 20 && i + 1 < 2147483647) && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0)))) || ((range <= 20 && i <= 0) && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0))))) && range <= i + 1)) || ((range <= i + 1 && ((((range <= 20 && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0))) && 0 <= range + -20) || (((range <= 20 && i + 1 < 2147483647) && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0))) && 0 <= range + -20)) || (((range <= 20 && i <= 0) && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0))) && 0 <= range + -20))) && 0 <= range + -20))) && i <= 20)) || ((range <= 20 && 1 + i <= 2147483647) && (((((((((range <= 20 && up + -1 == 0) && 0 <= range + -19) && 0 <= i) && i >= range) && 1 + i <= 2147483647) && 0 <= i + 2147483648) && i <= 2147483647) || (((((((range <= 20 && up + -1 == 0) && 0 <= i) && i >= range) && -2147483647 < range + -1) && 1 + i <= 2147483647) && 0 <= i + 2147483648) && i <= 2147483647)) || (((((((range <= 20 && up + -1 == 0) && 0 <= i) && i >= range) && 1 + i <= 2147483647) && 0 <= i + 2147483648) && i <= 2147483647) && 0 <= range + -20)))) || ((range <= 20 && (((((((((range <= 20 && up + -1 == 0) && 0 <= i) && i + 1 < 2147483647) && i >= range) && 0 <= i + 2147483648) && i <= 2147483647) && 0 <= range + -20) || (((((((range <= 20 && up + -1 == 0) && 0 <= i) && i + 1 < 2147483647) && i >= range) && -2147483647 < range + -1) && 0 <= i + 2147483648) && i <= 2147483647)) || (((((((range <= 20 && up + -1 == 0) && 0 <= range + -19) && 0 <= i) && i + 1 < 2147483647) && i >= range) && 0 <= i + 2147483648) && i <= 2147483647))) && 1 + i <= 2147483647)) || (range <= 20 && ((((((((range <= 20 && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0))) && 0 <= range + -20) || (((range <= 20 && i + 1 < 2147483647) && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0))) && 0 <= range + -20)) || (((range <= 20 && i <= 0) && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0))) && 0 <= range + -20)) && 0 <= range + -20) || ((((range <= 20 && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0))) || ((range <= 20 && i + 1 < 2147483647) && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0)))) || ((range <= 20 && i <= 0) && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0)))) && range + -2 >= -2147483648)) || (0 <= range + -19 && (((range <= 20 && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0))) || ((range <= 20 && i + 1 < 2147483647) && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0)))) || ((range <= 20 && i <= 0) && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0)))))) || ((((range <= 20 && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0))) || ((range <= 20 && i + 1 < 2147483647) && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0)))) || ((range <= 20 && i <= 0) && (((i <= 2147483647 && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0) || (((i <= 0 && i <= 2147483647) && ((up <= 0 || (up <= 0 && 0 <= i + 2147483648)) || (0 <= i && (up <= 0 || (up <= 0 && 0 <= i + 2147483648))))) && up == 0)))) && -2147483647 < range + -1)))) || ((range <= 20 && 1 + i <= 2147483647) && ((((((((range <= 20 && up + -1 == 0) && 0 <= range + -19) && 0 <= i) && i >= range) && 0 <= i + 2147483648) && i <= 2147483647) || ((((((range <= 20 && up + -1 == 0) && 0 <= i) && i >= range) && -2147483647 < range + -1) && 0 <= i + 2147483648) && i <= 2147483647)) || ((((((range <= 20 && up + -1 == 0) && 0 <= i) && i >= range) && 0 <= i + 2147483648) && i <= 2147483647) && 0 <= range + -20))) RESULT: Ultimate proved your program to be correct! [2023-02-17 09:32:06,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE