./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loops/sum_array-2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e8d55036 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/sum_array-2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0cf9175e436d0e00a51b884dabf87739d3176e3315a908e56fcba99730a10796 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 23:03:27,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 23:03:27,406 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 23:03:27,432 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 23:03:27,433 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 23:03:27,433 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 23:03:27,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 23:03:27,436 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 23:03:27,437 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 23:03:27,437 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 23:03:27,438 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 23:03:27,439 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 23:03:27,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 23:03:27,440 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 23:03:27,440 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 23:03:27,441 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 23:03:27,442 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 23:03:27,442 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 23:03:27,444 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 23:03:27,445 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 23:03:27,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 23:03:27,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 23:03:27,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 23:03:27,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 23:03:27,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 23:03:27,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 23:03:27,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 23:03:27,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 23:03:27,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 23:03:27,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 23:03:27,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 23:03:27,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 23:03:27,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 23:03:27,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 23:03:27,470 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 23:03:27,470 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 23:03:27,471 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 23:03:27,471 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 23:03:27,471 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 23:03:27,472 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 23:03:27,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 23:03:27,473 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-02-15 23:03:27,490 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 23:03:27,493 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 23:03:27,494 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 23:03:27,494 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 23:03:27,494 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 23:03:27,495 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 23:03:27,495 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 23:03:27,495 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 23:03:27,495 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 23:03:27,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 23:03:27,496 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 23:03:27,496 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 23:03:27,496 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 23:03:27,496 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 23:03:27,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 23:03:27,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 23:03:27,497 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 23:03:27,497 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 23:03:27,497 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-15 23:03:27,498 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 23:03:27,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 23:03:27,498 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 23:03:27,498 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 23:03:27,498 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 23:03:27,498 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 23:03:27,499 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 23:03:27,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 23:03:27,499 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 23:03:27,499 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 23:03:27,499 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 23:03:27,499 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 23:03:27,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 23:03:27,500 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 23:03:27,500 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 23:03:27,500 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 23:03:27,500 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 23:03:27,500 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 23:03:27,500 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0cf9175e436d0e00a51b884dabf87739d3176e3315a908e56fcba99730a10796 [2023-02-15 23:03:27,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 23:03:27,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 23:03:27,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 23:03:27,804 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 23:03:27,805 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 23:03:27,805 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/sum_array-2-2.i [2023-02-15 23:03:28,757 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 23:03:28,945 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 23:03:28,946 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/sum_array-2-2.i [2023-02-15 23:03:28,952 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/707b7a707/f6f75af0f1174d55851d4e76e434bfe7/FLAG2ff37fabc [2023-02-15 23:03:28,962 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/707b7a707/f6f75af0f1174d55851d4e76e434bfe7 [2023-02-15 23:03:28,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 23:03:28,965 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 23:03:28,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 23:03:28,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 23:03:28,969 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 23:03:28,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:03:28" (1/1) ... [2023-02-15 23:03:28,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c993730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:28, skipping insertion in model container [2023-02-15 23:03:28,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:03:28" (1/1) ... [2023-02-15 23:03:28,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 23:03:28,990 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 23:03:29,080 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/sum_array-2-2.i[940,953] [2023-02-15 23:03:29,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 23:03:29,116 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 23:03:29,124 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/sum_array-2-2.i[940,953] [2023-02-15 23:03:29,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 23:03:29,140 INFO L208 MainTranslator]: Completed translation [2023-02-15 23:03:29,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:29 WrapperNode [2023-02-15 23:03:29,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 23:03:29,141 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 23:03:29,141 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 23:03:29,141 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 23:03:29,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:29" (1/1) ... [2023-02-15 23:03:29,151 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:29" (1/1) ... [2023-02-15 23:03:29,165 INFO L138 Inliner]: procedures = 18, calls = 37, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 132 [2023-02-15 23:03:29,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 23:03:29,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 23:03:29,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 23:03:29,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 23:03:29,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:29" (1/1) ... [2023-02-15 23:03:29,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:29" (1/1) ... [2023-02-15 23:03:29,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:29" (1/1) ... [2023-02-15 23:03:29,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:29" (1/1) ... [2023-02-15 23:03:29,178 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:29" (1/1) ... [2023-02-15 23:03:29,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:29" (1/1) ... [2023-02-15 23:03:29,181 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:29" (1/1) ... [2023-02-15 23:03:29,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:29" (1/1) ... [2023-02-15 23:03:29,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 23:03:29,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 23:03:29,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 23:03:29,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 23:03:29,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:29" (1/1) ... [2023-02-15 23:03:29,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 23:03:29,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:03:29,214 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 23:03:29,229 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 23:03:29,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 23:03:29,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 23:03:29,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 23:03:29,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 23:03:29,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 23:03:29,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 23:03:29,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 23:03:29,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 23:03:29,313 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 23:03:29,314 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 23:03:29,542 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 23:03:29,546 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 23:03:29,546 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 23:03:29,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:03:29 BoogieIcfgContainer [2023-02-15 23:03:29,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 23:03:29,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 23:03:29,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 23:03:29,551 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 23:03:29,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 11:03:28" (1/3) ... [2023-02-15 23:03:29,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af1ccc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:03:29, skipping insertion in model container [2023-02-15 23:03:29,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:03:29" (2/3) ... [2023-02-15 23:03:29,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af1ccc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:03:29, skipping insertion in model container [2023-02-15 23:03:29,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:03:29" (3/3) ... [2023-02-15 23:03:29,553 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_array-2-2.i [2023-02-15 23:03:29,564 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 23:03:29,565 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-02-15 23:03:29,601 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 23:03:29,605 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;@6f0d3e35, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 23:03:29,605 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-02-15 23:03:29,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 32 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:03:29,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 23:03:29,611 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:03:29,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:03:29,612 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-02-15 23:03:29,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:03:29,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1313663593, now seen corresponding path program 1 times [2023-02-15 23:03:29,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:03:29,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039674604] [2023-02-15 23:03:29,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:03:29,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:03:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:03:29,892 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 23:03:29,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:03:29,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039674604] [2023-02-15 23:03:29,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039674604] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 23:03:29,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 23:03:29,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 23:03:29,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448234240] [2023-02-15 23:03:29,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 23:03:29,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 23:03:29,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:03:29,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 23:03:29,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 23:03:29,942 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 32 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.25) 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 23:03:30,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:03:30,034 INFO L93 Difference]: Finished difference Result 95 states and 133 transitions. [2023-02-15 23:03:30,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 23:03:30,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) 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 23:03:30,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:03:30,043 INFO L225 Difference]: With dead ends: 95 [2023-02-15 23:03:30,043 INFO L226 Difference]: Without dead ends: 50 [2023-02-15 23:03:30,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 23:03:30,049 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 39 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 23:03:30,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 76 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 23:03:30,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-15 23:03:30,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2023-02-15 23:03:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 30 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 23:03:30,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2023-02-15 23:03:30,072 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 9 [2023-02-15 23:03:30,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:03:30,072 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2023-02-15 23:03:30,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) 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 23:03:30,073 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2023-02-15 23:03:30,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 23:03:30,073 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:03:30,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:03:30,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 23:03:30,074 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-02-15 23:03:30,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:03:30,075 INFO L85 PathProgramCache]: Analyzing trace with hash -322250057, now seen corresponding path program 1 times [2023-02-15 23:03:30,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:03:30,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066888181] [2023-02-15 23:03:30,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:03:30,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:03:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:03:31,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:03:31,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:03:31,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066888181] [2023-02-15 23:03:31,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066888181] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:03:31,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661817612] [2023-02-15 23:03:31,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:03:31,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:03:31,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:03:31,568 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 23:03:31,584 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 23:03:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:03:31,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 23:03:31,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:03:31,675 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 10 treesize of output 8 [2023-02-15 23:03:31,737 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 50 treesize of output 45 [2023-02-15 23:03:31,741 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 14 treesize of output 13 [2023-02-15 23:03:31,842 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 59 treesize of output 57 [2023-02-15 23:03:31,847 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 14 treesize of output 13 [2023-02-15 23:03:31,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 17 [2023-02-15 23:03:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:03:31,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:03:32,519 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 23:03:32,520 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 115 treesize of output 117 [2023-02-15 23:03:32,684 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 8 treesize of output 6 [2023-02-15 23:03:32,689 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 25 treesize of output 23 [2023-02-15 23:03:32,701 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:03:32,703 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 32 treesize of output 30 [2023-02-15 23:03:32,712 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 25 treesize of output 23 [2023-02-15 23:03:32,721 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 32 treesize of output 30 [2023-02-15 23:03:32,734 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 25 treesize of output 23 [2023-02-15 23:03:32,744 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 158 treesize of output 154 [2023-02-15 23:03:32,782 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 182 treesize of output 176 [2023-02-15 23:03:32,807 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 158 treesize of output 154 [2023-02-15 23:03:32,831 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 32 treesize of output 30 [2023-02-15 23:03:32,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:03:32,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661817612] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:03:32,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:03:32,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 30 [2023-02-15 23:03:32,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919435696] [2023-02-15 23:03:32,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:03:32,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 23:03:32,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:03:32,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 23:03:32,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=770, Unknown=0, NotChecked=0, Total=930 [2023-02-15 23:03:32,868 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 31 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:03:35,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:03:35,029 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2023-02-15 23:03:35,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-15 23:03:35,030 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-15 23:03:35,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:03:35,031 INFO L225 Difference]: With dead ends: 102 [2023-02-15 23:03:35,031 INFO L226 Difference]: Without dead ends: 101 [2023-02-15 23:03:35,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=812, Invalid=3220, Unknown=0, NotChecked=0, Total=4032 [2023-02-15 23:03:35,033 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 171 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 23:03:35,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 296 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 23:03:35,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-15 23:03:35,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 48. [2023-02-15 23:03:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 47 states have internal predecessors, (54), 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 23:03:35,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2023-02-15 23:03:35,040 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 17 [2023-02-15 23:03:35,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:03:35,040 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2023-02-15 23:03:35,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:03:35,040 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2023-02-15 23:03:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 23:03:35,041 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:03:35,041 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:03:35,059 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 23:03:35,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:03:35,247 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-02-15 23:03:35,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:03:35,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1399817078, now seen corresponding path program 1 times [2023-02-15 23:03:35,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:03:35,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205006372] [2023-02-15 23:03:35,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:03:35,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:03:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:03:36,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:03:36,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:03:36,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205006372] [2023-02-15 23:03:36,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205006372] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:03:36,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472745496] [2023-02-15 23:03:36,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:03:36,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:03:36,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:03:36,058 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 23:03:36,073 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 23:03:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:03:36,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 23:03:36,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:03:36,139 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 10 treesize of output 8 [2023-02-15 23:03:36,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 23:03:36,263 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 19 treesize of output 18 [2023-02-15 23:03:36,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 13 [2023-02-15 23:03:36,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:03:36,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:03:37,259 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 23:03:37,260 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 111 treesize of output 113 [2023-02-15 23:03:37,373 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 22 treesize of output 20 [2023-02-15 23:03:37,377 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:03:37,382 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 60 treesize of output 58 [2023-02-15 23:03:37,401 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 30 treesize of output 28 [2023-02-15 23:03:37,411 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 23:03:37,418 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 30 treesize of output 28 [2023-02-15 23:03:37,425 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:03:37,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:03:37,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472745496] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:03:37,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:03:37,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2023-02-15 23:03:37,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371391073] [2023-02-15 23:03:37,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:03:37,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 23:03:37,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:03:37,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 23:03:37,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2023-02-15 23:03:37,459 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 26 states, 25 states have (on average 2.0) internal successors, (50), 26 states have internal predecessors, (50), 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 23:03:40,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:03:40,885 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2023-02-15 23:03:40,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-15 23:03:40,885 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.0) internal successors, (50), 26 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-15 23:03:40,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:03:40,886 INFO L225 Difference]: With dead ends: 99 [2023-02-15 23:03:40,887 INFO L226 Difference]: Without dead ends: 98 [2023-02-15 23:03:40,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=467, Invalid=1884, Unknown=1, NotChecked=0, Total=2352 [2023-02-15 23:03:40,888 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 205 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 23:03:40,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 265 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 23:03:40,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-15 23:03:40,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 49. [2023-02-15 23:03:40,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 48 states have internal predecessors, (55), 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 23:03:40,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2023-02-15 23:03:40,894 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 18 [2023-02-15 23:03:40,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:03:40,894 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2023-02-15 23:03:40,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.0) internal successors, (50), 26 states have internal predecessors, (50), 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 23:03:40,894 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2023-02-15 23:03:40,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 23:03:40,894 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:03:40,894 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:03:40,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 23:03:41,099 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,SelfDestructingSolverStorable2 [2023-02-15 23:03:41,100 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-02-15 23:03:41,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:03:41,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2112995717, now seen corresponding path program 1 times [2023-02-15 23:03:41,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:03:41,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88080215] [2023-02-15 23:03:41,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:03:41,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:03:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:03:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 23:03:41,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:03:41,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88080215] [2023-02-15 23:03:41,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88080215] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:03:41,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281247724] [2023-02-15 23:03:41,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:03:41,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:03:41,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:03:41,217 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:03:41,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 23:03:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:03:41,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 23:03:41,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:03:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 23:03:41,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:03:41,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 23:03:41,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281247724] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:03:41,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:03:41,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2023-02-15 23:03:41,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601767262] [2023-02-15 23:03:41,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:03:41,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 23:03:41,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:03:41,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 23:03:41,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-02-15 23:03:41,398 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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 23:03:41,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:03:41,549 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2023-02-15 23:03:41,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 23:03:41,550 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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 21 [2023-02-15 23:03:41,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:03:41,550 INFO L225 Difference]: With dead ends: 117 [2023-02-15 23:03:41,550 INFO L226 Difference]: Without dead ends: 90 [2023-02-15 23:03:41,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-02-15 23:03:41,551 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 178 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 23:03:41,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 157 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 23:03:41,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-15 23:03:41,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2023-02-15 23:03:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 58 states have internal predecessors, (68), 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 23:03:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2023-02-15 23:03:41,559 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 21 [2023-02-15 23:03:41,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:03:41,559 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2023-02-15 23:03:41,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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 23:03:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2023-02-15 23:03:41,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 23:03:41,560 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:03:41,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:03:41,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 23:03:41,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:03:41,766 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-02-15 23:03:41,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:03:41,766 INFO L85 PathProgramCache]: Analyzing trace with hash 930598631, now seen corresponding path program 1 times [2023-02-15 23:03:41,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:03:41,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110017941] [2023-02-15 23:03:41,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:03:41,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:03:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:03:42,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:03:42,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:03:42,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110017941] [2023-02-15 23:03:42,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110017941] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:03:42,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245590025] [2023-02-15 23:03:42,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:03:42,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:03:42,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:03:42,860 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:03:42,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 23:03:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:03:42,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 23:03:42,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:03:42,943 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 23:03:42,944 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 23 treesize of output 19 [2023-02-15 23:03:42,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2023-02-15 23:03:42,980 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 14 treesize of output 13 [2023-02-15 23:03:43,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 57 [2023-02-15 23:03:43,089 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 14 treesize of output 13 [2023-02-15 23:03:43,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-15 23:03:43,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 17 [2023-02-15 23:03:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:03:43,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:03:43,399 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_142 (Array Int Int))) (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_142))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#B~0#1.base|) |c_ULTIMATE.start_main_~#B~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#A~0#1.base|) |c_ULTIMATE.start_main_~#A~0#1.offset|) 2147483649)))) is different from false [2023-02-15 23:03:43,523 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse0 (<= .cse5 2147483647)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|)) (.cse3 (* .cse5 4))) (and (or .cse0 (forall ((|ULTIMATE.start_main_~#B~0#1.offset| Int) (v_ArrVal_141 Int) (v_ArrVal_142 (Array Int Int))) (or (< (+ v_ArrVal_141 1000000) 0) (< 0 (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~#B~0#1.offset| .cse3 (- 17179869184)) v_ArrVal_141)) |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_142))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~#B~0#1.base|) |ULTIMATE.start_main_~#B~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~#A~0#1.base|) |c_ULTIMATE.start_main_~#A~0#1.offset|) 2147483649)))))) (or (not .cse0) (forall ((|ULTIMATE.start_main_~#B~0#1.offset| Int) (v_ArrVal_141 Int) (v_ArrVal_142 (Array Int Int))) (or (< (+ v_ArrVal_141 1000000) 0) (< 0 (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~#B~0#1.offset| .cse3) v_ArrVal_141)) |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_142))) (+ (select (select .cse4 |c_ULTIMATE.start_main_~#A~0#1.base|) |c_ULTIMATE.start_main_~#A~0#1.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~#B~0#1.base|) |ULTIMATE.start_main_~#B~0#1.offset|) 2147483649))))))))) is different from false [2023-02-15 23:03:43,532 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#B~0#1.offset| Int) (v_ArrVal_141 Int) (v_ArrVal_142 (Array Int Int))) (or (< (+ v_ArrVal_141 1000000) 0) (< 0 (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|) |ULTIMATE.start_main_~#B~0#1.offset| v_ArrVal_141)) |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_142))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#B~0#1.base|) |ULTIMATE.start_main_~#B~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#A~0#1.base|) |c_ULTIMATE.start_main_~#A~0#1.offset|) 2147483649))))) is different from false [2023-02-15 23:03:43,657 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 23:03:43,657 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 517 treesize of output 513 [2023-02-15 23:03:43,671 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 23:03:43,671 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 464 treesize of output 424 [2023-02-15 23:03:48,815 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 704 treesize of output 630 [2023-02-15 23:03:48,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:48,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:48,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:48,948 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 16 treesize of output 14 [2023-02-15 23:03:48,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:48,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:48,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:48,974 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 16 treesize of output 14 [2023-02-15 23:03:48,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:48,999 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 16 treesize of output 14 [2023-02-15 23:03:49,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:49,007 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:03:49,009 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 52 treesize of output 48 [2023-02-15 23:03:49,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:49,019 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 52 treesize of output 48 [2023-02-15 23:03:49,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:49,030 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:03:49,031 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 28 treesize of output 26 [2023-02-15 23:03:49,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:49,038 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 40 treesize of output 38 [2023-02-15 23:03:49,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:49,043 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:03:49,045 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 35 treesize of output 33 [2023-02-15 23:03:49,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:49,059 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 91 treesize of output 87 [2023-02-15 23:03:49,066 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:03:49,070 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:03:49,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:49,077 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:03:49,079 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 40 treesize of output 38 [2023-02-15 23:03:49,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:49,087 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 57 treesize of output 55 [2023-02-15 23:03:49,095 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:03:49,097 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:03:49,100 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:03:49,149 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 2642 treesize of output 2542 [2023-02-15 23:03:49,711 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 2916 treesize of output 2810 [2023-02-15 23:03:50,308 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 189 treesize of output 183 [2023-02-15 23:03:50,341 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 311 treesize of output 303 [2023-02-15 23:03:50,436 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 158 treesize of output 154 [2023-02-15 23:03:50,465 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 189 treesize of output 183 [2023-02-15 23:03:50,491 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 311 treesize of output 303 [2023-02-15 23:03:50,597 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 158 treesize of output 154 [2023-02-15 23:03:50,676 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:03:50,680 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:03:50,686 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:03:50,688 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:03:50,691 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:03:50,693 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:03:50,701 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:03:50,707 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:03:50,709 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:03:50,715 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:03:50,719 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:03:50,723 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:03:50,725 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:03:50,730 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:03:50,733 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:03:50,735 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:03:50,740 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:03:50,742 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:03:50,747 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:03:50,749 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:03:50,759 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:03:50,761 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:03:50,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:50,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:03:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-15 23:03:51,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245590025] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:03:51,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:03:51,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 34 [2023-02-15 23:03:51,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39607338] [2023-02-15 23:03:51,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:03:51,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 23:03:51,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:03:51,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 23:03:51,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=836, Unknown=3, NotChecked=186, Total=1190 [2023-02-15 23:03:51,065 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 35 states, 34 states have (on average 1.911764705882353) internal successors, (65), 35 states have internal predecessors, (65), 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 23:03:51,329 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|ULTIMATE.start_main_~#B~0#1.offset| Int) (v_ArrVal_141 Int) (v_ArrVal_142 (Array Int Int))) (or (< (+ v_ArrVal_141 1000000) 0) (< 0 (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|) |ULTIMATE.start_main_~#B~0#1.offset| v_ArrVal_141)) |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_142))) (+ (select (select .cse5 |c_ULTIMATE.start_main_~#B~0#1.base|) |ULTIMATE.start_main_~#B~0#1.offset|) (select (select .cse5 |c_ULTIMATE.start_main_~#A~0#1.base|) |c_ULTIMATE.start_main_~#A~0#1.offset|) 2147483649))))))) (and (or (not (<= 0 (+ |c_ULTIMATE.start_main_#t~mem5#1| 1000000))) .cse0) (or (let ((.cse4 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse1 (<= .cse4 2147483647)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#A~0#1.base|)) (.cse3 (* .cse4 4))) (and (or .cse1 (< (+ (select .cse2 (+ .cse3 |c_ULTIMATE.start_main_~#A~0#1.offset| (- 17179869184))) 1000000) 0)) (or (not .cse1) (< (+ (select .cse2 (+ .cse3 |c_ULTIMATE.start_main_~#A~0#1.offset|)) 1000000) 0))))) .cse0) .cse0)) is different from false [2023-02-15 23:03:51,637 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_142 (Array Int Int))) (< 0 (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_142))) (+ (select (select .cse5 |c_ULTIMATE.start_main_~#B~0#1.base|) |c_ULTIMATE.start_main_~#B~0#1.offset|) (select (select .cse5 |c_ULTIMATE.start_main_~#A~0#1.base|) |c_ULTIMATE.start_main_~#A~0#1.offset|) 2147483649)))))) (and (or .cse0 (not (<= 0 (+ |c_ULTIMATE.start_main_#t~mem9#1| 1000000)))) .cse0 (or .cse0 (let ((.cse4 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|)) (.cse3 (* .cse4 4)) (.cse1 (<= .cse4 2147483647))) (and (or .cse1 (< (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse3 (- 17179869184))) 1000000) 0)) (or (< (+ (select .cse2 (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse3)) 1000000) 0) (not .cse1)))))))) is different from false [2023-02-15 23:03:51,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:03:51,958 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2023-02-15 23:03:51,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-15 23:03:51,958 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.911764705882353) internal successors, (65), 35 states have internal predecessors, (65), 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 23 [2023-02-15 23:03:51,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:03:51,959 INFO L225 Difference]: With dead ends: 92 [2023-02-15 23:03:51,959 INFO L226 Difference]: Without dead ends: 91 [2023-02-15 23:03:51,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 24 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=343, Invalid=1553, Unknown=16, NotChecked=440, Total=2352 [2023-02-15 23:03:51,960 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 50 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 23 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 23:03:51,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 219 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 403 Invalid, 16 Unknown, 105 Unchecked, 0.3s Time] [2023-02-15 23:03:51,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-15 23:03:51,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2023-02-15 23:03:51,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 77 states have internal predecessors, (89), 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 23:03:51,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2023-02-15 23:03:51,972 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 23 [2023-02-15 23:03:51,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:03:51,972 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2023-02-15 23:03:51,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.911764705882353) internal successors, (65), 35 states have internal predecessors, (65), 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 23:03:51,973 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2023-02-15 23:03:51,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 23:03:51,973 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:03:51,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:03:51,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 23:03:52,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:03:52,179 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-02-15 23:03:52,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:03:52,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1216213396, now seen corresponding path program 1 times [2023-02-15 23:03:52,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:03:52,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632425324] [2023-02-15 23:03:52,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:03:52,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:03:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:03:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:03:53,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:03:53,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632425324] [2023-02-15 23:03:53,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632425324] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:03:53,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308273225] [2023-02-15 23:03:53,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:03:53,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:03:53,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:03:53,082 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:03:53,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 23:03:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:03:53,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 23:03:53,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:03:53,170 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 23:03:53,171 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 23 treesize of output 19 [2023-02-15 23:03:53,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 23:03:53,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-15 23:03:53,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-02-15 23:03:53,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 13 [2023-02-15 23:03:53,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:03:53,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:03:53,600 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_182))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#A~0#1.base|) |c_ULTIMATE.start_main_~#A~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#B~0#1.base|) |c_ULTIMATE.start_main_~#B~0#1.offset|))) 2147483648)) is different from false [2023-02-15 23:03:53,684 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse0 (<= .cse5 2147483647)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|)) (.cse3 (* .cse5 4))) (and (or .cse0 (forall ((v_ArrVal_182 (Array Int Int)) (|ULTIMATE.start_main_~#B~0#1.offset| Int) (v_ArrVal_180 Int)) (or (< 1000000 v_ArrVal_180) (< (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~#B~0#1.offset| .cse3 (- 17179869184)) v_ArrVal_180)) |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_182))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~#A~0#1.base|) |c_ULTIMATE.start_main_~#A~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~#B~0#1.base|) |ULTIMATE.start_main_~#B~0#1.offset|))) 2147483648)))) (or (not .cse0) (forall ((v_ArrVal_182 (Array Int Int)) (|ULTIMATE.start_main_~#B~0#1.offset| Int) (v_ArrVal_180 Int)) (or (< 1000000 v_ArrVal_180) (< (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~#B~0#1.offset| .cse3) v_ArrVal_180)) |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_182))) (+ (select (select .cse4 |c_ULTIMATE.start_main_~#A~0#1.base|) |c_ULTIMATE.start_main_~#A~0#1.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~#B~0#1.base|) |ULTIMATE.start_main_~#B~0#1.offset|))) 2147483648))))))) is different from false [2023-02-15 23:03:53,691 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int)) (|ULTIMATE.start_main_~#B~0#1.offset| Int) (v_ArrVal_180 Int)) (or (< 1000000 v_ArrVal_180) (< (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|) |ULTIMATE.start_main_~#B~0#1.offset| v_ArrVal_180)) |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_182))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#B~0#1.base|) |ULTIMATE.start_main_~#B~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#A~0#1.base|) |c_ULTIMATE.start_main_~#A~0#1.offset|))) 2147483648))) is different from false [2023-02-15 23:03:53,768 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 23:03:53,768 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 493 treesize of output 489 [2023-02-15 23:03:53,784 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 23:03:53,785 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 440 treesize of output 400 [2023-02-15 23:04:01,103 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:04:01,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 30 treesize of output 28 [2023-02-15 23:04:01,113 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 30 treesize of output 28 [2023-02-15 23:04:01,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:04:01,120 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:04:01,123 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:04:01,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:04:01,126 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:04:01,130 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 30 treesize of output 28 [2023-02-15 23:04:01,137 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 30 treesize of output 28 [2023-02-15 23:04:01,142 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 30 treesize of output 28 [2023-02-15 23:04:01,147 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 60 treesize of output 58 [2023-02-15 23:04:01,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:04:01,160 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:04:01,163 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:04:01,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:04:01,166 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:04:01,170 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:04:01,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:04:01,173 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:04:01,176 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:04:01,179 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 30 treesize of output 28 [2023-02-15 23:04:01,187 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 60 treesize of output 58 [2023-02-15 23:04:01,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:04:01,199 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:04:01,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:04:01,202 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:04:01,206 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:04:01,209 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 30 treesize of output 28 [2023-02-15 23:04:01,215 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 60 treesize of output 58 [2023-02-15 23:04:01,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:04:01,226 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:04:01,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:04:01,231 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:04:01,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:04:01,234 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:04:01,236 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:04:01,240 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 30 treesize of output 28 [2023-02-15 23:04:01,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:04:01,246 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:04:01,249 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:04:01,252 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 60 treesize of output 58 [2023-02-15 23:04:01,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:04:01,262 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:04:01,266 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:04:01,270 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 60 treesize of output 58 [2023-02-15 23:04:01,278 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 30 treesize of output 28 [2023-02-15 23:04:01,297 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 30 treesize of output 28 [2023-02-15 23:04:01,304 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 60 treesize of output 58 [2023-02-15 23:04:01,315 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 23:04:01,330 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 22 treesize of output 20 [2023-02-15 23:04:01,341 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 60 treesize of output 58 [2023-02-15 23:04:01,351 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 81 treesize of output 77 [2023-02-15 23:04:01,362 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 51 treesize of output 47 [2023-02-15 23:04:01,368 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 51 treesize of output 47 [2023-02-15 23:04:01,383 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 30 treesize of output 28 [2023-02-15 23:04:01,390 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 60 treesize of output 58 [2023-02-15 23:04:01,400 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 51 treesize of output 47 [2023-02-15 23:04:01,412 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 81 treesize of output 77 [2023-02-15 23:04:01,431 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 30 treesize of output 28 [2023-02-15 23:04:01,438 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 30 treesize of output 28 [2023-02-15 23:04:01,445 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 81 treesize of output 77 [2023-02-15 23:04:01,456 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 60 treesize of output 58 [2023-02-15 23:04:01,466 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 60 treesize of output 58 [2023-02-15 23:04:01,476 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 60 treesize of output 58 [2023-02-15 23:04:01,488 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 60 treesize of output 58 [2023-02-15 23:04:01,499 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 81 treesize of output 77 [2023-02-15 23:04:01,508 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 60 treesize of output 58 [2023-02-15 23:04:01,517 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 30 treesize of output 28 [2023-02-15 23:04:01,524 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 30 treesize of output 28 [2023-02-15 23:04:01,529 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 60 treesize of output 58 [2023-02-15 23:04:01,538 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 81 treesize of output 77 [2023-02-15 23:04:01,547 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 81 treesize of output 77 [2023-02-15 23:04:01,557 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 81 treesize of output 77 [2023-02-15 23:04:01,566 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 81 treesize of output 77 [2023-02-15 23:04:01,577 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 81 treesize of output 77 [2023-02-15 23:04:01,586 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 30 treesize of output 28 [2023-02-15 23:04:01,593 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 30 treesize of output 28 [2023-02-15 23:04:01,620 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 30 treesize of output 28 [2023-02-15 23:04:01,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:04:01,625 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:04:01,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:04:01,629 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:04:01,636 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 60 treesize of output 58 [2023-02-15 23:04:01,687 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 60 treesize of output 58 [2023-02-15 23:04:01,700 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 30 treesize of output 28 [2023-02-15 23:04:01,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:04:01,705 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:04:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-15 23:04:01,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308273225] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:04:01,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:04:01,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2023-02-15 23:04:01,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822098143] [2023-02-15 23:04:01,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:04:01,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 23:04:01,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:04:01,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 23:04:01,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=601, Unknown=3, NotChecked=156, Total=870 [2023-02-15 23:04:01,761 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 30 states have internal predecessors, (68), 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 23:04:14,493 WARN L233 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 39 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 23:04:14,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:04:14,792 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2023-02-15 23:04:14,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 23:04:14,792 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 30 states have internal predecessors, (68), 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 24 [2023-02-15 23:04:14,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:04:14,793 INFO L225 Difference]: With dead ends: 90 [2023-02-15 23:04:14,793 INFO L226 Difference]: Without dead ends: 63 [2023-02-15 23:04:14,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 29 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=249, Invalid=1156, Unknown=13, NotChecked=222, Total=1640 [2023-02-15 23:04:14,794 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 59 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 28 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 23:04:14,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 236 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 258 Invalid, 28 Unknown, 114 Unchecked, 0.3s Time] [2023-02-15 23:04:14,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-15 23:04:14,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-02-15 23:04:14,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 62 states have internal predecessors, (72), 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 23:04:14,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2023-02-15 23:04:14,800 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 24 [2023-02-15 23:04:14,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:04:14,801 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2023-02-15 23:04:14,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 30 states have internal predecessors, (68), 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 23:04:14,801 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2023-02-15 23:04:14,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 23:04:14,801 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:04:14,801 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:04:14,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-15 23:04:15,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:04:15,002 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-02-15 23:04:15,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:04:15,002 INFO L85 PathProgramCache]: Analyzing trace with hash 747240709, now seen corresponding path program 2 times [2023-02-15 23:04:15,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:04:15,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669648944] [2023-02-15 23:04:15,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:04:15,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:04:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:04:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:04:16,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:04:16,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669648944] [2023-02-15 23:04:16,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669648944] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:04:16,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012225956] [2023-02-15 23:04:16,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 23:04:16,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:04:16,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:04:16,512 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:04:16,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 23:04:16,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 23:04:16,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:04:16,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-15 23:04:16,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:04:16,582 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 10 treesize of output 8 [2023-02-15 23:04:16,607 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 50 treesize of output 45 [2023-02-15 23:04:16,611 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 14 treesize of output 13 [2023-02-15 23:04:16,731 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 59 treesize of output 52 [2023-02-15 23:04:16,737 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2023-02-15 23:04:16,737 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 97 [2023-02-15 23:04:16,759 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 23:04:16,961 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 70 treesize of output 66 [2023-02-15 23:04:16,967 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 23:04:16,971 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 14 treesize of output 13 [2023-02-15 23:04:17,217 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 87 treesize of output 81 [2023-02-15 23:04:17,228 INFO L321 Elim1Store]: treesize reduction 55, result has 1.8 percent of original size [2023-02-15 23:04:17,229 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 105 [2023-02-15 23:04:17,247 INFO L321 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2023-02-15 23:04:17,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 34 [2023-02-15 23:04:17,492 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 23:04:17,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 27 [2023-02-15 23:04:17,521 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:04:17,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:04:26,319 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 23:04:26,320 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 158 treesize of output 160 [2023-02-15 23:04:26,520 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 1526 treesize of output 1518 [2023-02-15 23:04:26,686 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 136 treesize of output 132 [2023-02-15 23:04:26,736 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 36 treesize of output 34 [2023-02-15 23:04:26,751 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 1526 treesize of output 1518 [2023-02-15 23:04:26,774 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 223 treesize of output 217 [2023-02-15 23:04:26,830 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 88 treesize of output 86 [2023-02-15 23:04:26,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:04:26,840 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:04:26,843 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:04:26,847 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 88 treesize of output 86 [2023-02-15 23:04:26,927 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:04:26,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012225956] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:04:26,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:04:26,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 19] total 51 [2023-02-15 23:04:26,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051760550] [2023-02-15 23:04:26,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:04:26,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-15 23:04:26,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:04:26,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-15 23:04:26,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=2191, Unknown=2, NotChecked=0, Total=2652 [2023-02-15 23:04:26,929 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 52 states, 51 states have (on average 1.392156862745098) internal successors, (71), 52 states have internal predecessors, (71), 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 23:04:45,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:04:45,952 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2023-02-15 23:04:45,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-02-15 23:04:45,953 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.392156862745098) internal successors, (71), 52 states have internal predecessors, (71), 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 25 [2023-02-15 23:04:45,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:04:45,954 INFO L225 Difference]: With dead ends: 128 [2023-02-15 23:04:45,954 INFO L226 Difference]: Without dead ends: 127 [2023-02-15 23:04:45,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3634 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=2089, Invalid=9681, Unknown=2, NotChecked=0, Total=11772 [2023-02-15 23:04:45,956 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 254 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-02-15 23:04:45,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 368 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-02-15 23:04:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-15 23:04:45,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 74. [2023-02-15 23:04:45,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 73 states have internal predecessors, (85), 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 23:04:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2023-02-15 23:04:45,974 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 25 [2023-02-15 23:04:45,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:04:45,974 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2023-02-15 23:04:45,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.392156862745098) internal successors, (71), 52 states have internal predecessors, (71), 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 23:04:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2023-02-15 23:04:45,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 23:04:45,975 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:04:45,975 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:04:45,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 23:04:46,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:04:46,180 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-02-15 23:04:46,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:04:46,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1689625596, now seen corresponding path program 2 times [2023-02-15 23:04:46,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:04:46,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930797255] [2023-02-15 23:04:46,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:04:46,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:04:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:04:47,154 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:04:47,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:04:47,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930797255] [2023-02-15 23:04:47,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930797255] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:04:47,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508851271] [2023-02-15 23:04:47,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 23:04:47,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:04:47,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:04:47,156 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:04:47,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 23:04:47,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 23:04:47,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:04:47,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-15 23:04:47,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:04:47,218 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 10 treesize of output 8 [2023-02-15 23:04:47,256 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 50 treesize of output 45 [2023-02-15 23:04:47,260 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 14 treesize of output 13 [2023-02-15 23:04:47,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 23:04:47,534 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 66 treesize of output 62 [2023-02-15 23:04:47,541 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 23:04:47,546 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 14 treesize of output 13 [2023-02-15 23:04:47,694 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 23:04:47,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 42 [2023-02-15 23:04:47,866 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 23:04:47,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 19 [2023-02-15 23:04:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:04:47,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:04:50,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 23:04:50,455 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 154 treesize of output 156 [2023-02-15 23:04:50,622 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 140 treesize of output 138 [2023-02-15 23:04:50,642 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:04:50,646 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 34 treesize of output 32 [2023-02-15 23:04:50,658 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 5130 treesize of output 5098 [2023-02-15 23:04:51,996 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 182 treesize of output 178 [2023-02-15 23:04:52,032 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 84 treesize of output 82 [2023-02-15 23:04:52,101 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:04:52,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508851271] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:04:52,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:04:52,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 40 [2023-02-15 23:04:52,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248701472] [2023-02-15 23:04:52,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:04:52,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-15 23:04:52,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:04:52,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-15 23:04:52,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1357, Unknown=0, NotChecked=0, Total=1640 [2023-02-15 23:04:52,103 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 41 states, 40 states have (on average 1.85) internal successors, (74), 41 states have internal predecessors, (74), 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 23:05:09,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:05:09,407 INFO L93 Difference]: Finished difference Result 172 states and 193 transitions. [2023-02-15 23:05:09,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-02-15 23:05:09,408 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.85) internal successors, (74), 41 states have internal predecessors, (74), 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 26 [2023-02-15 23:05:09,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:05:09,409 INFO L225 Difference]: With dead ends: 172 [2023-02-15 23:05:09,409 INFO L226 Difference]: Without dead ends: 171 [2023-02-15 23:05:09,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3396 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=2133, Invalid=8787, Unknown=0, NotChecked=0, Total=10920 [2023-02-15 23:05:09,411 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 292 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 23:05:09,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 346 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-15 23:05:09,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-15 23:05:09,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 96. [2023-02-15 23:05:09,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.2173913043478262) internal successors, (112), 95 states have internal predecessors, (112), 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 23:05:09,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2023-02-15 23:05:09,424 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 26 [2023-02-15 23:05:09,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:05:09,424 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2023-02-15 23:05:09,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.85) internal successors, (74), 41 states have internal predecessors, (74), 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 23:05:09,424 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2023-02-15 23:05:09,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 23:05:09,426 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:05:09,427 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:05:09,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 23:05:09,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:05:09,632 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-02-15 23:05:09,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:05:09,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1380480567, now seen corresponding path program 2 times [2023-02-15 23:05:09,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:05:09,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371786614] [2023-02-15 23:05:09,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:05:09,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:05:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:05:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:05:11,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:05:11,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371786614] [2023-02-15 23:05:11,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371786614] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:05:11,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735606627] [2023-02-15 23:05:11,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 23:05:11,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:05:11,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:05:11,437 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:05:11,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 23:05:11,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 23:05:11,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:05:11,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-15 23:05:11,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:05:11,525 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 23:05:11,525 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 23 treesize of output 19 [2023-02-15 23:05:11,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2023-02-15 23:05:11,608 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 23:05:11,611 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 14 treesize of output 13 [2023-02-15 23:05:11,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 23:05:11,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 59 [2023-02-15 23:05:11,869 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 23:05:11,873 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 14 treesize of output 13 [2023-02-15 23:05:12,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2023-02-15 23:05:12,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 41 treesize of output 17 [2023-02-15 23:05:12,183 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:05:12,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:05:12,354 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (or (let ((.cse1 (* .cse4 4)) (.cse2 (<= .cse4 2147483647))) (and (or (forall ((v_ArrVal_318 (Array Int Int))) (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_318))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse1)) (select (select .cse0 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#A~0#1.offset|)) 2147483649)))) (not .cse2)) (or (forall ((v_ArrVal_318 (Array Int Int))) (< 0 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_318))) (+ (select (select .cse3 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#A~0#1.offset| (- 17179869184))) (select (select .cse3 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse1 (- 17179869184))) 2147483649)))) .cse2))) (not (< .cse4 (mod |c_ULTIMATE.start_main_~M~0#1| 4294967296))))) is different from false [2023-02-15 23:05:12,861 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 23:05:12,861 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 54 treesize of output 46 [2023-02-15 23:05:12,871 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 23:05:12,871 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 52 treesize of output 45 [2023-02-15 23:05:12,880 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296)) (.cse6 (mod |c_ULTIMATE.start_main_~M~0#1| 4294967296))) (or (let ((.cse2 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 4)) (.cse0 (* .cse5 4)) (.cse3 (<= .cse5 2147483647))) (and (or (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (|ULTIMATE.start_main_~#B~0#1.offset| Int)) (or (< (+ (select v_arrayElimArr_5 (+ |ULTIMATE.start_main_~#B~0#1.offset| .cse0 (- 17179869184))) 1000000) 0) (< 0 (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_318))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse2) (select (select .cse1 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |ULTIMATE.start_main_~#B~0#1.offset| 4)) 2147483649))))) .cse3) (or (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (|ULTIMATE.start_main_~#B~0#1.offset| Int)) (or (< 0 (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_318))) (+ (select (select .cse4 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse2) (select (select .cse4 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |ULTIMATE.start_main_~#B~0#1.offset| 4)) 2147483649))) (< (+ (select v_arrayElimArr_6 (+ |ULTIMATE.start_main_~#B~0#1.offset| .cse0)) 1000000) 0))) (not .cse3)))) (not (< 1 .cse6)) (not (< .cse5 .cse6)))) is different from false [2023-02-15 23:05:13,160 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 419 treesize of output 415 [2023-02-15 23:05:13,178 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 23:05:13,178 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 374 treesize of output 318 [2023-02-15 23:05:13,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 23:05:13,222 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 319 treesize of output 275 [2023-02-15 23:05:13,233 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 23:05:13,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 88 [2023-02-15 23:05:13,353 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2023-02-15 23:05:13,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 205 treesize of output 156 [2023-02-15 23:05:13,362 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 23:05:13,362 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 152 treesize of output 136 [2023-02-15 23:05:13,718 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-02-15 23:05:13,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735606627] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:05:13,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:05:13,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 16] total 45 [2023-02-15 23:05:13,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330670272] [2023-02-15 23:05:13,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:05:13,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 23:05:13,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:05:13,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 23:05:13,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1650, Unknown=23, NotChecked=170, Total=2070 [2023-02-15 23:05:13,722 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand has 46 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 46 states have internal predecessors, (83), 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 23:05:22,591 WARN L233 SmtUtils]: Spent 8.16s on a formula simplification. DAG size of input: 101 DAG size of output: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 23:05:38,295 WARN L233 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 53 DAG size of output: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 23:05:48,701 WARN L233 SmtUtils]: Spent 8.18s on a formula simplification. DAG size of input: 112 DAG size of output: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 23:05:55,186 WARN L233 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 95 DAG size of output: 66 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 23:06:03,479 WARN L233 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 95 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 23:06:03,509 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (mod |c_ULTIMATE.start_main_~M~0#1| 4294967296))) (and (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (or (let ((.cse1 (* .cse4 4)) (.cse2 (<= .cse4 2147483647))) (and (or (forall ((v_ArrVal_318 (Array Int Int))) (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_318))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse1)) (select (select .cse0 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#A~0#1.offset|)) 2147483649)))) (not .cse2)) (or (forall ((v_ArrVal_318 (Array Int Int))) (< 0 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_318))) (+ (select (select .cse3 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#A~0#1.offset| (- 17179869184))) (select (select .cse3 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse1 (- 17179869184))) 2147483649)))) .cse2))) (not (< .cse4 .cse5)))) (or (forall ((v_ArrVal_318 (Array Int Int))) (< 0 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_318))) (+ (select (select .cse6 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 4)) (select (select .cse6 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 4)) 2147483649)))) (not (< 1 .cse5))))) is different from false [2023-02-15 23:06:11,862 WARN L233 SmtUtils]: Spent 8.18s on a formula simplification. DAG size of input: 100 DAG size of output: 52 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 23:06:11,891 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (or (let ((.cse1 (* .cse4 4)) (.cse2 (<= .cse4 2147483647))) (and (or (forall ((v_ArrVal_318 (Array Int Int))) (< 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_318))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse1)) (select (select .cse0 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#A~0#1.offset|)) 2147483649)))) (not .cse2)) (or (forall ((v_ArrVal_318 (Array Int Int))) (< 0 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_318))) (+ (select (select .cse3 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#A~0#1.offset| (- 17179869184))) (select (select .cse3 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse1 (- 17179869184))) 2147483649)))) .cse2))) (not (< .cse4 (mod |c_ULTIMATE.start_main_~M~0#1| 4294967296))))) (<= 0 (+ |c_ULTIMATE.start_main_#t~mem12#1| |c_ULTIMATE.start_main_#t~mem11#1| 2147483648))) is different from false [2023-02-15 23:06:20,229 WARN L233 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 89 DAG size of output: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 23:06:28,406 WARN L233 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 94 DAG size of output: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 23:06:36,940 WARN L233 SmtUtils]: Spent 8.20s on a formula simplification. DAG size of input: 94 DAG size of output: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 23:06:45,227 WARN L233 SmtUtils]: Spent 8.13s on a formula simplification. DAG size of input: 58 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 23:06:53,365 WARN L233 SmtUtils]: Spent 8.09s on a formula simplification. DAG size of input: 58 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 23:06:53,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:06:53,448 INFO L93 Difference]: Finished difference Result 198 states and 221 transitions. [2023-02-15 23:06:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-02-15 23:06:53,449 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 46 states have internal predecessors, (83), 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 29 [2023-02-15 23:06:53,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:06:53,450 INFO L225 Difference]: With dead ends: 198 [2023-02-15 23:06:53,450 INFO L226 Difference]: Without dead ends: 191 [2023-02-15 23:06:53,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1643 ImplicationChecksByTransitivity, 100.2s TimeCoverageRelationStatistics Valid=929, Invalid=5189, Unknown=60, NotChecked=628, Total=6806 [2023-02-15 23:06:53,451 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 342 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 102 mSolverCounterUnsat, 42 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 42 IncrementalHoareTripleChecker+Unknown, 261 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 23:06:53,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 556 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1127 Invalid, 42 Unknown, 261 Unchecked, 1.1s Time] [2023-02-15 23:06:53,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-15 23:06:53,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 109. [2023-02-15 23:06:53,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 105 states have (on average 1.2) internal successors, (126), 108 states have internal predecessors, (126), 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 23:06:53,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2023-02-15 23:06:53,470 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 29 [2023-02-15 23:06:53,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:06:53,470 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2023-02-15 23:06:53,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 46 states have internal predecessors, (83), 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 23:06:53,471 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2023-02-15 23:06:53,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 23:06:53,471 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:06:53,471 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:06:53,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 23:06:53,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-02-15 23:06:53,676 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-02-15 23:06:53,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:06:53,677 INFO L85 PathProgramCache]: Analyzing trace with hash 154775480, now seen corresponding path program 1 times [2023-02-15 23:06:53,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:06:53,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400485439] [2023-02-15 23:06:53,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:06:53,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:06:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:06:54,804 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:06:54,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:06:54,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400485439] [2023-02-15 23:06:54,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400485439] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:06:54,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204048185] [2023-02-15 23:06:54,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:06:54,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:06:54,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:06:54,806 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:06:54,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 23:06:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:06:54,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-15 23:06:54,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:06:54,874 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 23:06:54,874 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 23 treesize of output 19 [2023-02-15 23:06:54,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 23:06:55,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 23:06:55,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 23:06:55,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-15 23:06:55,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 13 [2023-02-15 23:06:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:06:55,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:06:55,518 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (let ((.cse1 (* .cse4 4)) (.cse2 (<= .cse4 2147483647))) (and (or (forall ((v_ArrVal_367 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_367))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse1)) (select (select .cse0 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#A~0#1.offset|)))) 2147483648)) (not .cse2)) (or (forall ((v_ArrVal_367 (Array Int Int))) (< (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_367))) (+ (select (select .cse3 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| .cse1 (- 17179869184))) (select (select .cse3 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#A~0#1.offset| (- 17179869184))))) 2147483648)) .cse2)))) is different from false [2023-02-15 23:06:55,536 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_367 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_367))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 4)) (select (select .cse0 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 4)))) 2147483648)) is different from false [2023-02-15 23:06:58,395 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 4)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base|)) (.cse3 (* .cse6 4)) (.cse4 (<= .cse6 2147483647))) (and (or (forall ((v_ArrVal_365 Int) (|ULTIMATE.start_main_~#B~0#1.offset| Int) (v_ArrVal_367 (Array Int Int))) (or (< 1000000 v_ArrVal_365) (< (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~#B~0#1.offset| .cse3 (- 17179869184)) v_ArrVal_365)) |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_367))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse1) (select (select .cse0 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |ULTIMATE.start_main_~#B~0#1.offset| 4)))) 2147483648))) .cse4) (or (forall ((v_ArrVal_365 Int) (|ULTIMATE.start_main_~#B~0#1.offset| Int) (v_ArrVal_367 (Array Int Int))) (or (< (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~#B~0#1.offset| .cse3) v_ArrVal_365)) |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_367))) (+ (select (select .cse5 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |ULTIMATE.start_main_~#B~0#1.offset| 4)) (select (select .cse5 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse1))) 2147483648) (< 1000000 v_ArrVal_365))) (not .cse4))))) is different from false [2023-02-15 23:06:58,436 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 23:06:58,437 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 53 treesize of output 45 [2023-02-15 23:06:58,445 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 23:06:58,445 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 51 treesize of output 44 [2023-02-15 23:06:58,453 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 4)) (.cse3 (* .cse5 4)) (.cse0 (<= .cse5 2147483647))) (and (or .cse0 (forall ((|ULTIMATE.start_main_~#B~0#1.offset| Int) (v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (or (< (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_9) |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_367))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse2) (select (select .cse1 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |ULTIMATE.start_main_~#B~0#1.offset| 4)))) 2147483648) (< 1000000 (select v_arrayElimArr_9 (+ |ULTIMATE.start_main_~#B~0#1.offset| .cse3 (- 17179869184))))))) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (|ULTIMATE.start_main_~#B~0#1.offset| Int) (v_ArrVal_367 (Array Int Int))) (or (< (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_10) |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_367))) (+ (select (select .cse4 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |ULTIMATE.start_main_~#B~0#1.offset| 4)) (select (select .cse4 |c_ULTIMATE.start_main_~#A~0#1.base|) .cse2))) 2147483648) (< 1000000 (select v_arrayElimArr_10 (+ |ULTIMATE.start_main_~#B~0#1.offset| .cse3))))) (not .cse0))))) is different from false [2023-02-15 23:06:58,463 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_10 (Array Int Int)) (|ULTIMATE.start_main_~#B~0#1.offset| Int) (v_ArrVal_367 (Array Int Int))) (let ((.cse0 (+ |ULTIMATE.start_main_~#B~0#1.offset| 4))) (or (< 1000000 (select v_arrayElimArr_10 .cse0)) (< (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#B~0#1.base| v_arrayElimArr_10) |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_367))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~#B~0#1.base|) .cse0) (select (select .cse1 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 4)))) 2147483648)))) is different from false [2023-02-15 23:06:58,573 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 219 treesize of output 215 [2023-02-15 23:06:58,584 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 23:06:58,584 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 181 treesize of output 161 [2023-02-15 23:06:58,595 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 23:06:58,596 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 150 treesize of output 126 [2023-02-15 23:06:58,607 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 23:06:58,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 88 [2023-02-15 23:06:59,028 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 137 treesize of output 102 [2023-02-15 23:06:59,099 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 12 treesize of output 3 [2023-02-15 23:06:59,102 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:06:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2023-02-15 23:06:59,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204048185] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:06:59,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:06:59,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 40 [2023-02-15 23:06:59,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902180417] [2023-02-15 23:06:59,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:06:59,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-15 23:06:59,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:06:59,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-15 23:06:59,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1117, Unknown=11, NotChecked=360, Total=1640 [2023-02-15 23:06:59,267 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand has 41 states, 40 states have (on average 2.15) internal successors, (86), 41 states have internal predecessors, (86), 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 23:07:19,392 WARN L233 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 43 DAG size of output: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 23:07:19,474 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_367 (Array Int Int))) (< (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#C~0#1.base| v_ArrVal_367))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~#B~0#1.base|) (+ |c_ULTIMATE.start_main_~#B~0#1.offset| 4)) (select (select .cse1 |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| 4)))) 2147483648)))) (and .cse0 (or .cse0 (not (<= |c_ULTIMATE.start_main_#t~mem8#1| 1000000))))) is different from false [2023-02-15 23:07:27,706 WARN L233 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 52 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 23:07:35,871 WARN L233 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 80 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 23:07:36,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:07:36,912 INFO L93 Difference]: Finished difference Result 191 states and 213 transitions. [2023-02-15 23:07:36,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-15 23:07:36,913 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.15) internal successors, (86), 41 states have internal predecessors, (86), 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 30 [2023-02-15 23:07:36,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:07:36,914 INFO L225 Difference]: With dead ends: 191 [2023-02-15 23:07:36,914 INFO L226 Difference]: Without dead ends: 190 [2023-02-15 23:07:36,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 35 SyntacticMatches, 9 SemanticMatches, 61 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 40.3s TimeCoverageRelationStatistics Valid=459, Invalid=2742, Unknown=15, NotChecked=690, Total=3906 [2023-02-15 23:07:36,915 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 442 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 93 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 462 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 23:07:36,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 506 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 660 Invalid, 16 Unknown, 462 Unchecked, 0.9s Time] [2023-02-15 23:07:36,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-02-15 23:07:36,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 110. [2023-02-15 23:07:36,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 106 states have (on average 1.1981132075471699) internal successors, (127), 109 states have internal predecessors, (127), 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 23:07:36,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 127 transitions. [2023-02-15 23:07:36,940 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 127 transitions. Word has length 30 [2023-02-15 23:07:36,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:07:36,940 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 127 transitions. [2023-02-15 23:07:36,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.15) internal successors, (86), 41 states have internal predecessors, (86), 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 23:07:36,941 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 127 transitions. [2023-02-15 23:07:36,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 23:07:36,941 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:07:36,941 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:07:36,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 23:07:37,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-15 23:07:37,146 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-02-15 23:07:37,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:07:37,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1040407541, now seen corresponding path program 2 times [2023-02-15 23:07:37,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:07:37,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905437834] [2023-02-15 23:07:37,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:07:37,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:07:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:07:37,311 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 23:07:37,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:07:37,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905437834] [2023-02-15 23:07:37,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905437834] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:07:37,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486847233] [2023-02-15 23:07:37,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 23:07:37,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:07:37,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:07:37,321 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:07:37,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 23:07:37,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 23:07:37,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:07:37,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 23:07:37,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:07:37,489 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 23:07:37,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:07:37,566 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 23:07:37,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486847233] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:07:37,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:07:37,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2023-02-15 23:07:37,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399485033] [2023-02-15 23:07:37,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:07:37,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 23:07:37,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:07:37,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 23:07:37,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-02-15 23:07:37,568 INFO L87 Difference]: Start difference. First operand 110 states and 127 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:07:37,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:07:37,759 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2023-02-15 23:07:37,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 23:07:37,760 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-15 23:07:37,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:07:37,761 INFO L225 Difference]: With dead ends: 143 [2023-02-15 23:07:37,761 INFO L226 Difference]: Without dead ends: 131 [2023-02-15 23:07:37,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2023-02-15 23:07:37,762 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 230 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 23:07:37,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 110 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 23:07:37,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-15 23:07:37,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 94. [2023-02-15 23:07:37,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 90 states have (on average 1.1777777777777778) internal successors, (106), 93 states have internal predecessors, (106), 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 23:07:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2023-02-15 23:07:37,778 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 31 [2023-02-15 23:07:37,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:07:37,778 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2023-02-15 23:07:37,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 23:07:37,778 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2023-02-15 23:07:37,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 23:07:37,781 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:07:37,781 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:07:37,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 23:07:37,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-15 23:07:37,986 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-02-15 23:07:37,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:07:37,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1878453107, now seen corresponding path program 3 times [2023-02-15 23:07:37,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:07:37,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608422605] [2023-02-15 23:07:37,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:07:37,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:07:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:07:38,266 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 23:07:38,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:07:38,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608422605] [2023-02-15 23:07:38,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608422605] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:07:38,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850963157] [2023-02-15 23:07:38,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 23:07:38,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:07:38,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:07:38,276 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:07:38,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 23:07:38,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 23:07:38,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:07:38,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 23:07:38,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:07:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 23:07:38,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:07:38,685 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 23:07:38,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850963157] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:07:38,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:07:38,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2023-02-15 23:07:38,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896837943] [2023-02-15 23:07:38,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:07:38,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 23:07:38,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:07:38,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 23:07:38,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2023-02-15 23:07:38,686 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 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 23:07:39,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:07:39,060 INFO L93 Difference]: Finished difference Result 191 states and 205 transitions. [2023-02-15 23:07:39,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 23:07:39,061 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 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 33 [2023-02-15 23:07:39,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:07:39,061 INFO L225 Difference]: With dead ends: 191 [2023-02-15 23:07:39,061 INFO L226 Difference]: Without dead ends: 160 [2023-02-15 23:07:39,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2023-02-15 23:07:39,062 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 125 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 23:07:39,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 391 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 23:07:39,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-15 23:07:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 115. [2023-02-15 23:07:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 111 states have (on average 1.2072072072072073) internal successors, (134), 114 states have internal predecessors, (134), 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 23:07:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 134 transitions. [2023-02-15 23:07:39,079 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 134 transitions. Word has length 33 [2023-02-15 23:07:39,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:07:39,079 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 134 transitions. [2023-02-15 23:07:39,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 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 23:07:39,079 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 134 transitions. [2023-02-15 23:07:39,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 23:07:39,080 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:07:39,080 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:07:39,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 23:07:39,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-15 23:07:39,285 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-02-15 23:07:39,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:07:39,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1602769235, now seen corresponding path program 3 times [2023-02-15 23:07:39,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:07:39,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505941967] [2023-02-15 23:07:39,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:07:39,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:07:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:07:41,126 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:07:41,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:07:41,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505941967] [2023-02-15 23:07:41,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505941967] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:07:41,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668831892] [2023-02-15 23:07:41,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 23:07:41,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:07:41,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:07:41,131 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:07:41,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 23:07:41,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-15 23:07:41,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:07:41,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 59 conjunts are in the unsatisfiable core [2023-02-15 23:07:41,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:07:41,318 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 10 treesize of output 8 [2023-02-15 23:07:41,346 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 50 treesize of output 45 [2023-02-15 23:07:41,349 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 23:07:41,354 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 14 treesize of output 13 [2023-02-15 23:07:41,562 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 67 treesize of output 60 [2023-02-15 23:07:41,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:07:41,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 118 [2023-02-15 23:07:41,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:07:41,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 38 [2023-02-15 23:07:41,786 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 84 treesize of output 75 [2023-02-15 23:07:41,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:07:41,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:07:41,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:07:41,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 149 [2023-02-15 23:07:41,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:07:41,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 34 [2023-02-15 23:07:42,232 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 81 treesize of output 75 [2023-02-15 23:07:42,242 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 14 treesize of output 13 [2023-02-15 23:07:42,520 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 90 treesize of output 82 [2023-02-15 23:07:42,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:07:42,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:07:42,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 102 [2023-02-15 23:07:42,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:07:42,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:07:42,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 26 [2023-02-15 23:07:42,849 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 107 treesize of output 97 [2023-02-15 23:07:42,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:07:42,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:07:42,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:07:42,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:07:42,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 133 [2023-02-15 23:07:42,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:07:42,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 34 [2023-02-15 23:07:43,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 37 [2023-02-15 23:07:43,353 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:07:43,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:07:53,177 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 23:07:53,178 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 135 treesize of output 137 [2023-02-15 23:07:53,315 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 1162 treesize of output 1146 [2023-02-15 23:07:53,635 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 8 treesize of output 6 [2023-02-15 23:07:53,643 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 2328 treesize of output 2296 [2023-02-15 23:07:53,976 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 1162 treesize of output 1146 [2023-02-15 23:07:54,374 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 32 treesize of output 30 [2023-02-15 23:07:54,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:07:54,400 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 306 treesize of output 304 [2023-02-15 23:07:54,439 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 1472 treesize of output 1454 [2023-02-15 23:07:55,023 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:07:55,026 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:07:55,028 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:07:55,028 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:07:55,029 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 23:07:55,030 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 23:07:55,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:07:55,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:07:55,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 23:07:55,420 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 23:07:55,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668831892] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:07:55,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:07:55,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25, 27] total 67 [2023-02-15 23:07:55,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655596289] [2023-02-15 23:07:55,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:07:55,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-02-15 23:07:55,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:07:55,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-02-15 23:07:55,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=877, Invalid=3679, Unknown=0, NotChecked=0, Total=4556 [2023-02-15 23:07:55,424 INFO L87 Difference]: Start difference. First operand 115 states and 134 transitions. Second operand has 68 states, 67 states have (on average 1.4029850746268657) internal successors, (94), 68 states have internal predecessors, (94), 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)