./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-memory-alloca/Urban-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a31fd051 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-memory-alloca/Urban-alloca-2.i -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 1d6689857addc69d8e93b105a4c59c28f3ca430e8db3cb8066938aeb93b34a30 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 14:04:34,121 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 14:04:34,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 14:04:34,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 14:04:34,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 14:04:34,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 14:04:34,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 14:04:34,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 14:04:34,163 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 14:04:34,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 14:04:34,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 14:04:34,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 14:04:34,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 14:04:34,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 14:04:34,172 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 14:04:34,173 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 14:04:34,174 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 14:04:34,175 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 14:04:34,176 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 14:04:34,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 14:04:34,179 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 14:04:34,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 14:04:34,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 14:04:34,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 14:04:34,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 14:04:34,188 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 14:04:34,188 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 14:04:34,189 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 14:04:34,189 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 14:04:34,190 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 14:04:34,191 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 14:04:34,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 14:04:34,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 14:04:34,193 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 14:04:34,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 14:04:34,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 14:04:34,195 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 14:04:34,195 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 14:04:34,195 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 14:04:34,196 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 14:04:34,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 14:04:34,198 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2023-02-15 14:04:34,214 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 14:04:34,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 14:04:34,217 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 14:04:34,217 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 14:04:34,218 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 14:04:34,218 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 14:04:34,218 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 14:04:34,218 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 14:04:34,218 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 14:04:34,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 14:04:34,219 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 14:04:34,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 14:04:34,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 14:04:34,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 14:04:34,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 14:04:34,220 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 14:04:34,220 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-15 14:04:34,220 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 14:04:34,220 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 14:04:34,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 14:04:34,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 14:04:34,221 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 14:04:34,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 14:04:34,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 14:04:34,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 14:04:34,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 14:04:34,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 14:04:34,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 14:04:34,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 14:04:34,222 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 14:04:34,222 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 14:04:34,222 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 14:04:34,222 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 14:04:34,223 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 14:04:34,223 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 -> 1d6689857addc69d8e93b105a4c59c28f3ca430e8db3cb8066938aeb93b34a30 [2023-02-15 14:04:34,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 14:04:34,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 14:04:34,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 14:04:34,429 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 14:04:34,429 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 14:04:34,430 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/Urban-alloca-2.i [2023-02-15 14:04:35,404 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 14:04:35,641 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 14:04:35,641 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-alloca-2.i [2023-02-15 14:04:35,653 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031cfd65a/833011a358004cad80c885f6b8b4770a/FLAG1bcae7205 [2023-02-15 14:04:35,667 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031cfd65a/833011a358004cad80c885f6b8b4770a [2023-02-15 14:04:35,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 14:04:35,670 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 14:04:35,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 14:04:35,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 14:04:35,676 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 14:04:35,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:04:35" (1/1) ... [2023-02-15 14:04:35,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e786f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:04:35, skipping insertion in model container [2023-02-15 14:04:35,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:04:35" (1/1) ... [2023-02-15 14:04:35,684 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 14:04:35,714 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 14:04:35,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 14:04:35,948 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 14:04:35,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 14:04:36,008 INFO L208 MainTranslator]: Completed translation [2023-02-15 14:04:36,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:04:36 WrapperNode [2023-02-15 14:04:36,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 14:04:36,010 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 14:04:36,010 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 14:04:36,010 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 14:04:36,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:04:36" (1/1) ... [2023-02-15 14:04:36,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:04:36" (1/1) ... [2023-02-15 14:04:36,047 INFO L138 Inliner]: procedures = 110, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 72 [2023-02-15 14:04:36,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 14:04:36,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 14:04:36,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 14:04:36,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 14:04:36,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:04:36" (1/1) ... [2023-02-15 14:04:36,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:04:36" (1/1) ... [2023-02-15 14:04:36,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:04:36" (1/1) ... [2023-02-15 14:04:36,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:04:36" (1/1) ... [2023-02-15 14:04:36,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:04:36" (1/1) ... [2023-02-15 14:04:36,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:04:36" (1/1) ... [2023-02-15 14:04:36,079 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:04:36" (1/1) ... [2023-02-15 14:04:36,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:04:36" (1/1) ... [2023-02-15 14:04:36,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 14:04:36,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 14:04:36,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 14:04:36,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 14:04:36,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:04:36" (1/1) ... [2023-02-15 14:04:36,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 14:04:36,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:04:36,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 14:04:36,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 14:04:36,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 14:04:36,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 14:04:36,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 14:04:36,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 14:04:36,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 14:04:36,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 14:04:36,237 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 14:04:36,239 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 14:04:36,407 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 14:04:36,411 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 14:04:36,411 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 14:04:36,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:04:36 BoogieIcfgContainer [2023-02-15 14:04:36,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 14:04:36,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 14:04:36,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 14:04:36,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 14:04:36,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 02:04:35" (1/3) ... [2023-02-15 14:04:36,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b94a148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 02:04:36, skipping insertion in model container [2023-02-15 14:04:36,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:04:36" (2/3) ... [2023-02-15 14:04:36,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b94a148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 02:04:36, skipping insertion in model container [2023-02-15 14:04:36,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:04:36" (3/3) ... [2023-02-15 14:04:36,417 INFO L112 eAbstractionObserver]: Analyzing ICFG Urban-alloca-2.i [2023-02-15 14:04:36,431 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 14:04:36,431 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-02-15 14:04:36,470 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 14:04:36,475 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;@173fada2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 14:04:36,475 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-02-15 14:04:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 19 states have (on average 1.736842105263158) internal successors, (33), 27 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-15 14:04:36,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 14:04:36,482 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 14:04:36,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:04:36,483 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-15 14:04:36,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:04:36,488 INFO L85 PathProgramCache]: Analyzing trace with hash 177749354, now seen corresponding path program 1 times [2023-02-15 14:04:36,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:04:36,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956876054] [2023-02-15 14:04:36,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:04:36,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:04:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:04:36,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:04:36,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:04:36,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956876054] [2023-02-15 14:04:36,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956876054] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:04:36,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:04:36,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 14:04:36,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376510402] [2023-02-15 14:04:36,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:04:36,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 14:04:36,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:04:36,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 14:04:36,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 14:04:36,789 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.736842105263158) internal successors, (33), 27 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) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-15 14:04:36,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:04:36,878 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2023-02-15 14:04:36,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 14:04:36,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-15 14:04:36,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 14:04:36,885 INFO L225 Difference]: With dead ends: 32 [2023-02-15 14:04:36,885 INFO L226 Difference]: Without dead ends: 23 [2023-02-15 14:04:36,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 14:04:36,890 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 14:04:36,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 72 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 14:04:36,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-15 14:04:36,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-15 14:04:36,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.6875) internal successors, (27), 22 states have internal predecessors, (27), 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-15 14:04:36,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-02-15 14:04:36,911 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 8 [2023-02-15 14:04:36,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 14:04:36,911 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-02-15 14:04:36,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-15 14:04:36,912 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-02-15 14:04:36,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 14:04:36,913 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 14:04:36,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:04:36,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 14:04:36,914 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-15 14:04:36,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:04:36,915 INFO L85 PathProgramCache]: Analyzing trace with hash 177749546, now seen corresponding path program 1 times [2023-02-15 14:04:36,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:04:36,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364332231] [2023-02-15 14:04:36,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:04:36,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:04:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:04:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:04:37,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:04:37,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364332231] [2023-02-15 14:04:37,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364332231] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:04:37,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:04:37,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 14:04:37,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120971013] [2023-02-15 14:04:37,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:04:37,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 14:04:37,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:04:37,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 14:04:37,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 14:04:37,098 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-15 14:04:37,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:04:37,127 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2023-02-15 14:04:37,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 14:04:37,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-15 14:04:37,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 14:04:37,128 INFO L225 Difference]: With dead ends: 23 [2023-02-15 14:04:37,128 INFO L226 Difference]: Without dead ends: 22 [2023-02-15 14:04:37,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-15 14:04:37,130 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 14:04:37,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 32 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 14:04:37,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-15 14:04:37,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-15 14:04:37,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.625) internal successors, (26), 21 states have internal predecessors, (26), 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-15 14:04:37,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-02-15 14:04:37,133 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 8 [2023-02-15 14:04:37,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 14:04:37,133 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-02-15 14:04:37,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-15 14:04:37,134 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-02-15 14:04:37,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 14:04:37,134 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 14:04:37,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:04:37,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 14:04:37,135 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-15 14:04:37,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:04:37,135 INFO L85 PathProgramCache]: Analyzing trace with hash 177765242, now seen corresponding path program 1 times [2023-02-15 14:04:37,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:04:37,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549339277] [2023-02-15 14:04:37,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:04:37,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:04:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:04:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:04:37,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:04:37,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549339277] [2023-02-15 14:04:37,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549339277] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:04:37,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:04:37,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 14:04:37,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286566938] [2023-02-15 14:04:37,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:04:37,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 14:04:37,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:04:37,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 14:04:37,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 14:04:37,232 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-15 14:04:37,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:04:37,285 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2023-02-15 14:04:37,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 14:04:37,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-15 14:04:37,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 14:04:37,286 INFO L225 Difference]: With dead ends: 42 [2023-02-15 14:04:37,287 INFO L226 Difference]: Without dead ends: 41 [2023-02-15 14:04:37,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 14:04:37,288 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 14:04:37,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 42 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 14:04:37,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-02-15 14:04:37,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2023-02-15 14:04:37,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.608695652173913) internal successors, (37), 28 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-15 14:04:37,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2023-02-15 14:04:37,292 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 8 [2023-02-15 14:04:37,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 14:04:37,292 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-02-15 14:04:37,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-15 14:04:37,293 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2023-02-15 14:04:37,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 14:04:37,293 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 14:04:37,293 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:04:37,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 14:04:37,294 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-15 14:04:37,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:04:37,294 INFO L85 PathProgramCache]: Analyzing trace with hash 177765434, now seen corresponding path program 1 times [2023-02-15 14:04:37,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:04:37,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350971264] [2023-02-15 14:04:37,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:04:37,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:04:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:04:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:04:37,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:04:37,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350971264] [2023-02-15 14:04:37,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350971264] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:04:37,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:04:37,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 14:04:37,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204794173] [2023-02-15 14:04:37,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:04:37,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 14:04:37,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:04:37,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 14:04:37,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 14:04:37,357 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-15 14:04:37,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:04:37,393 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2023-02-15 14:04:37,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 14:04:37,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-15 14:04:37,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 14:04:37,394 INFO L225 Difference]: With dead ends: 29 [2023-02-15 14:04:37,395 INFO L226 Difference]: Without dead ends: 28 [2023-02-15 14:04:37,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-15 14:04:37,396 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 30 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 14:04:37,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 29 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 14:04:37,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-15 14:04:37,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-15 14:04:37,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.565217391304348) internal successors, (36), 27 states have internal predecessors, (36), 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-15 14:04:37,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2023-02-15 14:04:37,399 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 8 [2023-02-15 14:04:37,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 14:04:37,399 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2023-02-15 14:04:37,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-15 14:04:37,400 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2023-02-15 14:04:37,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 14:04:37,400 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 14:04:37,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:04:37,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 14:04:37,401 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-15 14:04:37,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:04:37,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1215262736, now seen corresponding path program 1 times [2023-02-15 14:04:37,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:04:37,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794290595] [2023-02-15 14:04:37,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:04:37,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:04:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:04:37,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:04:37,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:04:37,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794290595] [2023-02-15 14:04:37,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794290595] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:04:37,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:04:37,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 14:04:37,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315713386] [2023-02-15 14:04:37,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:04:37,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 14:04:37,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:04:37,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 14:04:37,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 14:04:37,527 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-15 14:04:37,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:04:37,557 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2023-02-15 14:04:37,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 14:04:37,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-15 14:04:37,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 14:04:37,558 INFO L225 Difference]: With dead ends: 28 [2023-02-15 14:04:37,558 INFO L226 Difference]: Without dead ends: 27 [2023-02-15 14:04:37,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-15 14:04:37,560 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 14:04:37,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 29 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 14:04:37,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-15 14:04:37,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-15 14:04:37,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 26 states have internal predecessors, (35), 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-15 14:04:37,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2023-02-15 14:04:37,563 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 9 [2023-02-15 14:04:37,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 14:04:37,563 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2023-02-15 14:04:37,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-15 14:04:37,564 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2023-02-15 14:04:37,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 14:04:37,564 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 14:04:37,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:04:37,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 14:04:37,565 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-15 14:04:37,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:04:37,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1215268694, now seen corresponding path program 1 times [2023-02-15 14:04:37,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:04:37,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973736550] [2023-02-15 14:04:37,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:04:37,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:04:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:04:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:04:37,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:04:37,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973736550] [2023-02-15 14:04:37,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973736550] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:04:37,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:04:37,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 14:04:37,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270175850] [2023-02-15 14:04:37,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:04:37,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 14:04:37,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:04:37,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 14:04:37,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 14:04:37,602 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-15 14:04:37,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:04:37,624 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2023-02-15 14:04:37,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 14:04:37,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-15 14:04:37,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 14:04:37,625 INFO L225 Difference]: With dead ends: 27 [2023-02-15 14:04:37,625 INFO L226 Difference]: Without dead ends: 26 [2023-02-15 14:04:37,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 14:04:37,630 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 14:04:37,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 22 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 14:04:37,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-15 14:04:37,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-02-15 14:04:37,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 25 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-15 14:04:37,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2023-02-15 14:04:37,638 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 9 [2023-02-15 14:04:37,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 14:04:37,638 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2023-02-15 14:04:37,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-15 14:04:37,639 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2023-02-15 14:04:37,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 14:04:37,639 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 14:04:37,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:04:37,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 14:04:37,640 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-15 14:04:37,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:04:37,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1215755280, now seen corresponding path program 1 times [2023-02-15 14:04:37,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:04:37,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019573653] [2023-02-15 14:04:37,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:04:37,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:04:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:04:37,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:04:37,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:04:37,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019573653] [2023-02-15 14:04:37,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019573653] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:04:37,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:04:37,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 14:04:37,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167309020] [2023-02-15 14:04:37,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:04:37,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 14:04:37,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:04:37,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 14:04:37,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 14:04:37,706 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-15 14:04:37,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:04:37,736 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2023-02-15 14:04:37,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 14:04:37,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-15 14:04:37,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 14:04:37,737 INFO L225 Difference]: With dead ends: 26 [2023-02-15 14:04:37,737 INFO L226 Difference]: Without dead ends: 25 [2023-02-15 14:04:37,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 14:04:37,738 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 14:04:37,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 37 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 14:04:37,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-15 14:04:37,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-02-15 14:04:37,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 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-15 14:04:37,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-02-15 14:04:37,740 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 9 [2023-02-15 14:04:37,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 14:04:37,741 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-02-15 14:04:37,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-15 14:04:37,741 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-02-15 14:04:37,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 14:04:37,741 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 14:04:37,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:04:37,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 14:04:37,742 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-15 14:04:37,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:04:37,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1215761238, now seen corresponding path program 1 times [2023-02-15 14:04:37,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:04:37,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79400959] [2023-02-15 14:04:37,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:04:37,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:04:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:04:37,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:04:37,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:04:37,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79400959] [2023-02-15 14:04:37,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79400959] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:04:37,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:04:37,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 14:04:37,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329591257] [2023-02-15 14:04:37,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:04:37,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 14:04:37,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:04:37,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 14:04:37,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 14:04:37,777 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-15 14:04:37,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:04:37,796 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2023-02-15 14:04:37,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 14:04:37,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-15 14:04:37,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 14:04:37,797 INFO L225 Difference]: With dead ends: 25 [2023-02-15 14:04:37,797 INFO L226 Difference]: Without dead ends: 24 [2023-02-15 14:04:37,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 14:04:37,798 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 14:04:37,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 18 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 14:04:37,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-02-15 14:04:37,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-02-15 14:04:37,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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-15 14:04:37,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-02-15 14:04:37,801 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 9 [2023-02-15 14:04:37,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 14:04:37,801 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-02-15 14:04:37,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-15 14:04:37,801 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-02-15 14:04:37,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 14:04:37,802 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 14:04:37,802 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:04:37,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 14:04:37,813 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-15 14:04:37,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:04:37,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1122825544, now seen corresponding path program 1 times [2023-02-15 14:04:37,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:04:37,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104071844] [2023-02-15 14:04:37,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:04:37,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:04:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:04:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:04:37,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:04:37,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104071844] [2023-02-15 14:04:37,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104071844] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:04:37,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183800329] [2023-02-15 14:04:37,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:04:37,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:04:37,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:04:37,924 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:04:37,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 14:04:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:04:37,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 14:04:37,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:04:38,101 INFO L321 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2023-02-15 14:04:38,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 63 [2023-02-15 14:04:38,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2023-02-15 14:04:38,126 INFO L321 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2023-02-15 14:04:38,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 74 [2023-02-15 14:04:38,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-02-15 14:04:38,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2023-02-15 14:04:38,168 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 14:04:38,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-02-15 14:04:38,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-02-15 14:04:38,197 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 14:04:38,298 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 14:04:38,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2023-02-15 14:04:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:04:38,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:04:43,588 INFO L321 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-02-15 14:04:43,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 63 [2023-02-15 14:04:43,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 14:04:43,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2023-02-15 14:04:43,614 INFO L321 Elim1Store]: treesize reduction 17, result has 59.5 percent of original size [2023-02-15 14:04:43,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 62 [2023-02-15 14:04:43,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 [2023-02-15 14:04:43,633 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 14:04:43,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2023-02-15 14:04:43,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 60 [2023-02-15 14:04:43,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 57 [2023-02-15 14:04:43,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:04:43,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183800329] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:04:43,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:04:43,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2023-02-15 14:04:43,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775934532] [2023-02-15 14:04:43,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:04:43,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-15 14:04:43,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:04:43,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-15 14:04:43,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=446, Unknown=3, NotChecked=0, Total=552 [2023-02-15 14:04:43,662 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 24 states, 23 states have (on average 1.826086956521739) internal successors, (42), 24 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-15 14:04:47,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 14:04:49,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 14:04:51,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 14:04:53,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 14:04:55,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 14:05:03,885 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 42 DAG size of output: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 14:05:21,275 WARN L233 SmtUtils]: Spent 10.14s on a formula simplification. DAG size of input: 39 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 14:05:29,367 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 36 DAG size of output: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 14:05:31,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 14:05:33,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 14:05:35,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 14:05:36,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 14:05:38,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 14:05:46,835 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 41 DAG size of output: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 14:05:48,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 14:05:50,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 14:05:52,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 14:05:54,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 14:05:56,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 14:05:58,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 14:06:00,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 14:06:08,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 14:06:10,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 14:06:12,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 14:06:14,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 14:06:16,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 14:06:18,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 14:06:20,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 14:06:22,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 14:06:24,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 14:06:26,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 14:06:28,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 14:06:48,675 WARN L233 SmtUtils]: Spent 18.09s on a formula simplification. DAG size of input: 44 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 14:06:50,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 14:06:52,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 14:06:54,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 14:06:56,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 14:06:59,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 14:07:01,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 14:07:01,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:07:01,897 INFO L93 Difference]: Finished difference Result 86 states and 113 transitions. [2023-02-15 14:07:01,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 14:07:01,898 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.826086956521739) internal successors, (42), 24 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) Word has length 15 [2023-02-15 14:07:01,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 14:07:01,899 INFO L225 Difference]: With dead ends: 86 [2023-02-15 14:07:01,899 INFO L226 Difference]: Without dead ends: 85 [2023-02-15 14:07:01,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 74.2s TimeCoverageRelationStatistics Valid=318, Invalid=1009, Unknown=5, NotChecked=0, Total=1332 [2023-02-15 14:07:01,900 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 86 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 22 mSolverCounterUnsat, 36 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 69.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 36 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 69.4s IncrementalHoareTripleChecker+Time [2023-02-15 14:07:01,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 154 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 381 Invalid, 36 Unknown, 0 Unchecked, 69.4s Time] [2023-02-15 14:07:01,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-15 14:07:01,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 42. [2023-02-15 14:07:01,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 41 states have internal predecessors, (56), 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-15 14:07:01,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2023-02-15 14:07:01,904 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 15 [2023-02-15 14:07:01,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 14:07:01,904 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2023-02-15 14:07:01,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.826086956521739) internal successors, (42), 24 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-15 14:07:01,908 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2023-02-15 14:07:01,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 14:07:01,908 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 14:07:01,911 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:07:01,931 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-15 14:07:02,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:07:02,116 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-15 14:07:02,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:07:02,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1485954612, now seen corresponding path program 1 times [2023-02-15 14:07:02,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:07:02,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791565441] [2023-02-15 14:07:02,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:07:02,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:07:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:07:02,325 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 14:07:02,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:07:02,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791565441] [2023-02-15 14:07:02,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791565441] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:07:02,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875798439] [2023-02-15 14:07:02,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:07:02,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:07:02,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:07:02,327 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:07:02,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 14:07:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:07:02,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 14:07:02,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:07:02,409 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-02-15 14:07:02,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2023-02-15 14:07:02,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 14:07:02,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-02-15 14:07:02,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 19 [2023-02-15 14:07:02,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-02-15 14:07:02,665 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 14:07:02,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 76 [2023-02-15 14:07:02,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-02-15 14:07:02,698 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 14:07:02,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 14:07:02,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-15 14:07:02,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2023-02-15 14:07:02,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 14:07:02,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 14:07:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:07:02,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:07:02,893 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_179 Int) (v_ArrVal_181 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_179)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 2147483650)) (not (<= |c_ULTIMATE.start_main_#t~mem11#1| (+ v_ArrVal_179 1))))) is different from false [2023-02-15 14:07:02,908 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_179 Int) (v_ArrVal_181 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_179)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 2147483650)) (< (+ v_ArrVal_179 1) (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|))))) is different from false [2023-02-15 14:07:02,917 WARN L837 $PredicateComparison]: unable to prove that (or (not (< 0 |c_ULTIMATE.start_main_#t~mem9#1|)) (forall ((v_ArrVal_179 Int) (v_ArrVal_181 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_179)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 2147483650)) (< (+ v_ArrVal_179 1) (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) is different from false [2023-02-15 14:07:02,923 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 14:07:02,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 29 [2023-02-15 14:07:02,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-02-15 14:07:02,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-02-15 14:07:02,993 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-15 14:07:02,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875798439] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:07:02,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:07:02,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 24 [2023-02-15 14:07:02,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26072058] [2023-02-15 14:07:02,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:07:02,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 14:07:02,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:07:02,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 14:07:02,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=365, Unknown=3, NotChecked=126, Total=600 [2023-02-15 14:07:02,994 INFO L87 Difference]: Start difference. First operand 42 states and 56 transitions. Second operand has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 25 states have internal predecessors, (56), 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-15 14:07:03,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:07:03,505 INFO L93 Difference]: Finished difference Result 110 states and 150 transitions. [2023-02-15 14:07:03,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 14:07:03,506 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 25 states have internal predecessors, (56), 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-15 14:07:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 14:07:03,506 INFO L225 Difference]: With dead ends: 110 [2023-02-15 14:07:03,506 INFO L226 Difference]: Without dead ends: 0 [2023-02-15 14:07:03,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=312, Invalid=819, Unknown=3, NotChecked=198, Total=1332 [2023-02-15 14:07:03,507 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 14:07:03,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 65 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 257 Invalid, 0 Unknown, 106 Unchecked, 0.1s Time] [2023-02-15 14:07:03,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-15 14:07:03,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-15 14:07:03,507 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-15 14:07:03,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-15 14:07:03,508 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2023-02-15 14:07:03,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 14:07:03,508 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 14:07:03,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 25 states have internal predecessors, (56), 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-15 14:07:03,508 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-15 14:07:03,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-15 14:07:03,510 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2023-02-15 14:07:03,510 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2023-02-15 14:07:03,510 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2023-02-15 14:07:03,510 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2023-02-15 14:07:03,510 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2023-02-15 14:07:03,510 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2023-02-15 14:07:03,510 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2023-02-15 14:07:03,510 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2023-02-15 14:07:03,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 14:07:03,715 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,SelfDestructingSolverStorable9 [2023-02-15 14:07:03,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-15 14:07:40,093 WARN L233 SmtUtils]: Spent 36.37s on a formula simplification. DAG size of input: 72 DAG size of output: 48 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-02-15 14:07:40,096 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 558) no Hoare annotation was computed. [2023-02-15 14:07:40,096 INFO L899 garLoopResultBuilder]: For program point L564(line 564) no Hoare annotation was computed. [2023-02-15 14:07:40,096 INFO L899 garLoopResultBuilder]: For program point L564-1(line 564) no Hoare annotation was computed. [2023-02-15 14:07:40,096 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 564) no Hoare annotation was computed. [2023-02-15 14:07:40,096 INFO L899 garLoopResultBuilder]: For program point L552-1(line 552) no Hoare annotation was computed. [2023-02-15 14:07:40,096 INFO L899 garLoopResultBuilder]: For program point L552-3(lines 552 568) no Hoare annotation was computed. [2023-02-15 14:07:40,096 INFO L899 garLoopResultBuilder]: For program point L552-5(lines 552 568) no Hoare annotation was computed. [2023-02-15 14:07:40,096 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-15 14:07:40,096 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2023-02-15 14:07:40,096 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 562) no Hoare annotation was computed. [2023-02-15 14:07:40,096 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-15 14:07:40,096 INFO L899 garLoopResultBuilder]: For program point L561(lines 561 566) no Hoare annotation was computed. [2023-02-15 14:07:40,096 INFO L895 garLoopResultBuilder]: At program point L561-2(lines 552 568) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse4 (select .cse7 |ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1.offset| 0)) (.cse2 (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|))) (.cse3 (= |ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse5 (<= (select .cse1 |ULTIMATE.start_main_~y~0#1.offset|) 2147483647)) (.cse6 (<= .cse4 2147483647))) (or (and .cse0 (or (<= 1 (select .cse1 0)) (not |ULTIMATE.start_main_#t~short8#1|)) .cse2 .cse3 (< 0 (+ 2147483650 .cse4)) .cse5 .cse6) (and .cse0 .cse2 .cse3 (forall ((v_ArrVal_124 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_125 (Array Int Int))) (or (< 0 (+ 2147483650 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~x~0#1.base| (store .cse7 |ULTIMATE.start_main_~x~0#1.offset| (+ (- 1) .cse4))) |ULTIMATE.start_main_~y~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_125) |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_124)) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (< v_ArrVal_124 1))) .cse5 .cse6))))) [2023-02-15 14:07:40,096 INFO L899 garLoopResultBuilder]: For program point L553(lines 553 567) no Hoare annotation was computed. [2023-02-15 14:07:40,097 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2023-02-15 14:07:40,097 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-15 14:07:40,097 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 562) no Hoare annotation was computed. [2023-02-15 14:07:40,097 INFO L899 garLoopResultBuilder]: For program point L562(line 562) no Hoare annotation was computed. [2023-02-15 14:07:40,097 INFO L899 garLoopResultBuilder]: For program point L562-1(line 562) no Hoare annotation was computed. [2023-02-15 14:07:40,097 INFO L899 garLoopResultBuilder]: For program point L558(line 558) no Hoare annotation was computed. [2023-02-15 14:07:40,097 INFO L899 garLoopResultBuilder]: For program point L558-1(line 558) no Hoare annotation was computed. [2023-02-15 14:07:40,097 INFO L899 garLoopResultBuilder]: For program point L554(lines 554 559) no Hoare annotation was computed. [2023-02-15 14:07:40,097 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-15 14:07:40,097 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 558) no Hoare annotation was computed. [2023-02-15 14:07:40,097 INFO L899 garLoopResultBuilder]: For program point L555(line 555) no Hoare annotation was computed. [2023-02-15 14:07:40,097 INFO L899 garLoopResultBuilder]: For program point L555-1(line 555) no Hoare annotation was computed. [2023-02-15 14:07:40,097 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 564) no Hoare annotation was computed. [2023-02-15 14:07:40,097 INFO L899 garLoopResultBuilder]: For program point L547(lines 547 569) no Hoare annotation was computed. [2023-02-15 14:07:40,100 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:07:40,101 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 14:07:40,107 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_125,QUANTIFIED] [2023-02-15 14:07:40,108 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1.base,QUANTIFIED] [2023-02-15 14:07:40,108 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_124,QUANTIFIED] [2023-02-15 14:07:40,108 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1.base,QUANTIFIED] [2023-02-15 14:07:40,108 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_124,QUANTIFIED] [2023-02-15 14:07:40,115 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_125,QUANTIFIED] [2023-02-15 14:07:40,115 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1.base,QUANTIFIED] [2023-02-15 14:07:40,116 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_124,QUANTIFIED] [2023-02-15 14:07:40,116 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1.base,QUANTIFIED] [2023-02-15 14:07:40,116 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_124,QUANTIFIED] [2023-02-15 14:07:40,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 02:07:40 BoogieIcfgContainer [2023-02-15 14:07:40,119 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 14:07:40,119 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 14:07:40,119 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 14:07:40,120 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 14:07:40,120 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:04:36" (3/4) ... [2023-02-15 14:07:40,122 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-15 14:07:40,129 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-02-15 14:07:40,129 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-02-15 14:07:40,129 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-15 14:07:40,129 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-15 14:07:40,157 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 14:07:40,157 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 14:07:40,158 INFO L158 Benchmark]: Toolchain (without parser) took 184487.40ms. Allocated memory was 136.3MB in the beginning and 172.0MB in the end (delta: 35.7MB). Free memory was 101.7MB in the beginning and 40.5MB in the end (delta: 61.3MB). Peak memory consumption was 97.5MB. Max. memory is 16.1GB. [2023-02-15 14:07:40,158 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 136.3MB. Free memory was 108.6MB in the beginning and 108.6MB in the end (delta: 25.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 14:07:40,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.90ms. Allocated memory is still 136.3MB. Free memory was 101.7MB in the beginning and 86.4MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 14:07:40,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.05ms. Allocated memory is still 136.3MB. Free memory was 86.4MB in the beginning and 84.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 14:07:40,159 INFO L158 Benchmark]: Boogie Preprocessor took 38.60ms. Allocated memory is still 136.3MB. Free memory was 84.4MB in the beginning and 82.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 14:07:40,159 INFO L158 Benchmark]: RCFGBuilder took 324.53ms. Allocated memory is still 136.3MB. Free memory was 82.8MB in the beginning and 71.2MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 14:07:40,160 INFO L158 Benchmark]: TraceAbstraction took 183705.79ms. Allocated memory was 136.3MB in the beginning and 172.0MB in the end (delta: 35.7MB). Free memory was 70.8MB in the beginning and 43.6MB in the end (delta: 27.3MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. [2023-02-15 14:07:40,160 INFO L158 Benchmark]: Witness Printer took 37.97ms. Allocated memory is still 172.0MB. Free memory was 43.6MB in the beginning and 40.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 14:07:40,162 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.15ms. Allocated memory is still 136.3MB. Free memory was 108.6MB in the beginning and 108.6MB in the end (delta: 25.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.90ms. Allocated memory is still 136.3MB. Free memory was 101.7MB in the beginning and 86.4MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.05ms. Allocated memory is still 136.3MB. Free memory was 86.4MB in the beginning and 84.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.60ms. Allocated memory is still 136.3MB. Free memory was 84.4MB in the beginning and 82.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 324.53ms. Allocated memory is still 136.3MB. Free memory was 82.8MB in the beginning and 71.2MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 183705.79ms. Allocated memory was 136.3MB in the beginning and 172.0MB in the end (delta: 35.7MB). Free memory was 70.8MB in the beginning and 43.6MB in the end (delta: 27.3MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. * Witness Printer took 37.97ms. Allocated memory is still 172.0MB. Free memory was 43.6MB in the beginning and 40.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_124,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_124,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_125,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_124,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_124,QUANTIFIED] * 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: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 558]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 558]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 562]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 562]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 564]: 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: 183.6s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 139.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 36.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 36 mSolverCounterUnknown, 267 SdHoareTripleChecker+Valid, 69.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 267 mSDsluCounter, 500 SdHoareTripleChecker+Invalid, 69.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 106 IncrementalHoareTripleChecker+Unchecked, 377 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 919 IncrementalHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 123 mSDtfsCounter, 919 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 75.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=9, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 55 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 12 NumberOfFragments, 109 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1529 FormulaSimplificationTreeSizeReductionInter, 36.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 165 ConstructedInterpolants, 14 QuantifiedInterpolants, 1658 SizeOfPredicates, 21 NumberOfNonLiveVariables, 235 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 10/51 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: 552]: Loop Invariant [2023-02-15 14:07:40,183 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_125,QUANTIFIED] [2023-02-15 14:07:40,183 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1.base,QUANTIFIED] [2023-02-15 14:07:40,183 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_124,QUANTIFIED] [2023-02-15 14:07:40,183 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1.base,QUANTIFIED] [2023-02-15 14:07:40,183 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_124,QUANTIFIED] [2023-02-15 14:07:40,184 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_125,QUANTIFIED] [2023-02-15 14:07:40,184 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1.base,QUANTIFIED] [2023-02-15 14:07:40,184 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_124,QUANTIFIED] [2023-02-15 14:07:40,184 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~y~0#1.base,QUANTIFIED] [2023-02-15 14:07:40,184 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_124,QUANTIFIED] Derived loop invariant: ((((((y == 0 && (1 <= unknown-#memory_int-unknown[y][0] || !aux-*x != 0 && *y > 0-aux)) && !(y == x)) && x == 0) && 0 < 2147483650 + unknown-#memory_int-unknown[x][x]) && unknown-#memory_int-unknown[y][y] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) || (((((y == 0 && !(y == x)) && x == 0) && (forall v_ArrVal_124 : int, ULTIMATE.start_main_~y~0#1.base : int, v_ArrVal_125 : [int]int :: 0 < 2147483650 + unknown-#memory_int-unknown[x := unknown-#memory_int-unknown[x][x := -1 + unknown-#memory_int-unknown[x][x]]][ULTIMATE.start_main_~y~0#1.base := unknown-#memory_int-unknown[x := v_ArrVal_125][ULTIMATE.start_main_~y~0#1.base][y := v_ArrVal_124]][x][x] || v_ArrVal_124 < 1)) && unknown-#memory_int-unknown[y][y] <= 2147483647) && unknown-#memory_int-unknown[x][x] <= 2147483647) RESULT: Ultimate proved your program to be correct! [2023-02-15 14:07:40,202 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