./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/cart.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5317dae 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/heap-data/cart.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 01:10:09,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 01:10:09,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 01:10:09,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 01:10:09,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 01:10:09,166 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 01:10:09,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 01:10:09,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 01:10:09,172 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 01:10:09,177 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 01:10:09,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 01:10:09,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 01:10:09,181 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 01:10:09,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 01:10:09,185 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 01:10:09,187 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 01:10:09,187 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 01:10:09,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 01:10:09,190 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 01:10:09,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 01:10:09,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 01:10:09,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 01:10:09,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 01:10:09,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 01:10:09,207 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 01:10:09,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 01:10:09,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 01:10:09,209 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 01:10:09,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 01:10:09,210 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 01:10:09,211 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 01:10:09,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 01:10:09,213 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 01:10:09,214 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 01:10:09,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 01:10:09,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 01:10:09,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 01:10:09,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 01:10:09,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 01:10:09,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 01:10:09,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 01:10:09,220 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 01:10:09,254 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 01:10:09,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 01:10:09,255 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 01:10:09,255 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 01:10:09,256 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 01:10:09,257 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 01:10:09,257 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 01:10:09,257 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 01:10:09,258 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 01:10:09,258 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 01:10:09,259 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 01:10:09,259 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 01:10:09,259 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 01:10:09,259 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 01:10:09,259 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 01:10:09,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 01:10:09,260 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 01:10:09,260 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 01:10:09,260 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 01:10:09,260 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 01:10:09,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 01:10:09,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 01:10:09,261 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 01:10:09,261 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 01:10:09,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 01:10:09,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 01:10:09,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 01:10:09,262 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 01:10:09,262 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 01:10:09,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 01:10:09,263 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 01:10:09,263 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 01:10:09,263 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 01:10:09,263 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 01:10:09,264 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 01:10:09,264 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 ! call(reach_error())) ) 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 -> 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af [2023-02-16 01:10:09,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 01:10:09,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 01:10:09,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 01:10:09,505 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 01:10:09,506 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 01:10:09,506 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/cart.i [2023-02-16 01:10:10,749 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 01:10:10,921 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 01:10:10,921 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i [2023-02-16 01:10:10,929 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8e3412d7/5ec4e4afecd24aee8a7be5f2cc3219f0/FLAG49d008a8a [2023-02-16 01:10:10,945 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8e3412d7/5ec4e4afecd24aee8a7be5f2cc3219f0 [2023-02-16 01:10:10,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 01:10:10,948 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 01:10:10,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 01:10:10,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 01:10:10,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 01:10:10,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:10:10" (1/1) ... [2023-02-16 01:10:10,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142ed0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:10:10, skipping insertion in model container [2023-02-16 01:10:10,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:10:10" (1/1) ... [2023-02-16 01:10:10,961 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 01:10:11,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 01:10:11,260 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/heap-data/cart.i[23713,23726] [2023-02-16 01:10:11,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 01:10:11,288 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 01:10:11,340 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/heap-data/cart.i[23713,23726] [2023-02-16 01:10:11,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 01:10:11,370 INFO L208 MainTranslator]: Completed translation [2023-02-16 01:10:11,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:10:11 WrapperNode [2023-02-16 01:10:11,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 01:10:11,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 01:10:11,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 01:10:11,372 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 01:10:11,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:10:11" (1/1) ... [2023-02-16 01:10:11,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:10:11" (1/1) ... [2023-02-16 01:10:11,431 INFO L138 Inliner]: procedures = 121, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2023-02-16 01:10:11,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 01:10:11,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 01:10:11,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 01:10:11,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 01:10:11,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:10:11" (1/1) ... [2023-02-16 01:10:11,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:10:11" (1/1) ... [2023-02-16 01:10:11,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:10:11" (1/1) ... [2023-02-16 01:10:11,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:10:11" (1/1) ... [2023-02-16 01:10:11,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:10:11" (1/1) ... [2023-02-16 01:10:11,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:10:11" (1/1) ... [2023-02-16 01:10:11,479 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:10:11" (1/1) ... [2023-02-16 01:10:11,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:10:11" (1/1) ... [2023-02-16 01:10:11,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 01:10:11,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 01:10:11,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 01:10:11,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 01:10:11,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:10:11" (1/1) ... [2023-02-16 01:10:11,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 01:10:11,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:10:11,543 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-16 01:10:11,575 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-16 01:10:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 01:10:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 01:10:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 01:10:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 01:10:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 01:10:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 01:10:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 01:10:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 01:10:11,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 01:10:11,730 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 01:10:11,732 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 01:10:11,955 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 01:10:11,959 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 01:10:11,959 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-16 01:10:11,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:10:11 BoogieIcfgContainer [2023-02-16 01:10:11,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 01:10:11,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 01:10:11,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 01:10:11,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 01:10:11,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 01:10:10" (1/3) ... [2023-02-16 01:10:11,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16926593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:10:11, skipping insertion in model container [2023-02-16 01:10:11,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:10:11" (2/3) ... [2023-02-16 01:10:11,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16926593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:10:11, skipping insertion in model container [2023-02-16 01:10:11,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:10:11" (3/3) ... [2023-02-16 01:10:11,971 INFO L112 eAbstractionObserver]: Analyzing ICFG cart.i [2023-02-16 01:10:11,983 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 01:10:11,983 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 01:10:12,014 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 01:10:12,019 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;@456d1d6c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 01:10:12,019 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 01:10:12,023 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 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-16 01:10:12,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-16 01:10:12,027 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:10:12,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:10:12,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:10:12,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:10:12,033 INFO L85 PathProgramCache]: Analyzing trace with hash -680841488, now seen corresponding path program 1 times [2023-02-16 01:10:12,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:10:12,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88614372] [2023-02-16 01:10:12,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:10:12,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:10:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:10:12,185 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-16 01:10:12,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:10:12,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88614372] [2023-02-16 01:10:12,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88614372] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:10:12,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:10:12,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 01:10:12,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317685319] [2023-02-16 01:10:12,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:10:12,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 01:10:12,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:10:12,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 01:10:12,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 01:10:12,247 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 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 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-16 01:10:12,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:10:12,260 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2023-02-16 01:10:12,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 01:10:12,262 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-16 01:10:12,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:10:12,269 INFO L225 Difference]: With dead ends: 34 [2023-02-16 01:10:12,270 INFO L226 Difference]: Without dead ends: 17 [2023-02-16 01:10:12,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 01:10:12,281 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:10:12,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:10:12,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-02-16 01:10:12,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-02-16 01:10:12,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:10:12,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2023-02-16 01:10:12,339 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 9 [2023-02-16 01:10:12,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:10:12,340 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2023-02-16 01:10:12,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-16 01:10:12,340 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2023-02-16 01:10:12,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-16 01:10:12,341 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:10:12,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:10:12,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 01:10:12,342 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:10:12,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:10:12,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1910225148, now seen corresponding path program 1 times [2023-02-16 01:10:12,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:10:12,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352721341] [2023-02-16 01:10:12,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:10:12,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:10:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:10:12,534 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-16 01:10:12,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:10:12,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352721341] [2023-02-16 01:10:12,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352721341] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:10:12,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:10:12,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 01:10:12,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26098170] [2023-02-16 01:10:12,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:10:12,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 01:10:12,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:10:12,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 01:10:12,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 01:10:12,541 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-16 01:10:12,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:10:12,611 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2023-02-16 01:10:12,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 01:10:12,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2023-02-16 01:10:12,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:10:12,613 INFO L225 Difference]: With dead ends: 36 [2023-02-16 01:10:12,614 INFO L226 Difference]: Without dead ends: 21 [2023-02-16 01:10:12,616 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-16 01:10:12,618 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 01:10:12,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 48 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 01:10:12,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-16 01:10:12,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-16 01:10:12,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:10:12,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2023-02-16 01:10:12,625 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 12 [2023-02-16 01:10:12,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:10:12,625 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2023-02-16 01:10:12,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-16 01:10:12,626 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2023-02-16 01:10:12,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 01:10:12,626 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:10:12,626 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:10:12,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 01:10:12,627 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:10:12,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:10:12,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1849394690, now seen corresponding path program 1 times [2023-02-16 01:10:12,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:10:12,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557166083] [2023-02-16 01:10:12,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:10:12,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:10:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:10:12,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:10:12,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:10:12,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557166083] [2023-02-16 01:10:12,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557166083] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:10:12,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:10:12,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 01:10:12,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354939779] [2023-02-16 01:10:12,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:10:12,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 01:10:12,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:10:12,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 01:10:12,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 01:10:12,815 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-16 01:10:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:10:12,866 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2023-02-16 01:10:12,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 01:10:12,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2023-02-16 01:10:12,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:10:12,868 INFO L225 Difference]: With dead ends: 36 [2023-02-16 01:10:12,869 INFO L226 Difference]: Without dead ends: 30 [2023-02-16 01:10:12,870 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-16 01:10:12,871 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 35 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:10:12,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 41 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:10:12,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-16 01:10:12,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2023-02-16 01:10:12,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:10:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2023-02-16 01:10:12,876 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 16 [2023-02-16 01:10:12,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:10:12,876 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2023-02-16 01:10:12,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-16 01:10:12,876 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2023-02-16 01:10:12,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 01:10:12,877 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:10:12,877 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:10:12,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 01:10:12,877 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:10:12,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:10:12,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1690179633, now seen corresponding path program 1 times [2023-02-16 01:10:12,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:10:12,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979215169] [2023-02-16 01:10:12,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:10:12,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:10:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:10:12,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:10:12,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:10:12,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979215169] [2023-02-16 01:10:12,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979215169] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:10:12,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:10:12,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 01:10:12,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99530684] [2023-02-16 01:10:12,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:10:12,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 01:10:12,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:10:12,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 01:10:12,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 01:10:12,952 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-16 01:10:12,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:10:12,965 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2023-02-16 01:10:12,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 01:10:12,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 20 [2023-02-16 01:10:12,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:10:12,967 INFO L225 Difference]: With dead ends: 37 [2023-02-16 01:10:12,968 INFO L226 Difference]: Without dead ends: 27 [2023-02-16 01:10:12,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 01:10:12,969 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:10:12,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:10:12,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-16 01:10:12,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-16 01:10:12,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:10:12,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2023-02-16 01:10:12,974 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 20 [2023-02-16 01:10:12,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:10:12,976 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2023-02-16 01:10:12,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-16 01:10:12,976 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2023-02-16 01:10:12,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 01:10:12,977 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:10:12,977 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:10:12,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 01:10:12,977 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:10:12,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:10:12,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1795441037, now seen corresponding path program 1 times [2023-02-16 01:10:12,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:10:12,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155513250] [2023-02-16 01:10:12,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:10:12,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:10:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:10:13,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:10:13,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:10:13,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155513250] [2023-02-16 01:10:13,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155513250] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:10:13,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596267043] [2023-02-16 01:10:13,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:10:13,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:10:13,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:10:13,498 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-16 01:10:13,530 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-16 01:10:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:10:13,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-16 01:10:13,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:10:13,726 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 37 treesize of output 25 [2023-02-16 01:10:13,791 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:13,792 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 1 case distinctions, treesize of input 26 treesize of output 10 [2023-02-16 01:10:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:10:13,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:10:13,958 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-16 01:10:13,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 426 treesize of output 379 [2023-02-16 01:10:14,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:10:14,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596267043] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:10:14,419 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:10:14,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 13 [2023-02-16 01:10:14,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55282697] [2023-02-16 01:10:14,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:10:14,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 01:10:14,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:10:14,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 01:10:14,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-02-16 01:10:14,421 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:10:14,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:10:14,612 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2023-02-16 01:10:14,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 01:10:14,612 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-16 01:10:14,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:10:14,613 INFO L225 Difference]: With dead ends: 48 [2023-02-16 01:10:14,613 INFO L226 Difference]: Without dead ends: 46 [2023-02-16 01:10:14,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2023-02-16 01:10:14,614 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 75 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 01:10:14,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 119 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 01:10:14,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-16 01:10:14,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2023-02-16 01:10:14,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:10:14,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2023-02-16 01:10:14,618 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 20 [2023-02-16 01:10:14,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:10:14,618 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2023-02-16 01:10:14,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:10:14,619 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2023-02-16 01:10:14,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 01:10:14,619 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:10:14,619 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:10:14,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-16 01:10:14,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:10:14,835 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:10:14,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:10:14,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1534874359, now seen corresponding path program 1 times [2023-02-16 01:10:14,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:10:14,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558049162] [2023-02-16 01:10:14,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:10:14,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:10:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:10:14,950 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:10:14,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:10:14,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558049162] [2023-02-16 01:10:14,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558049162] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:10:14,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137501337] [2023-02-16 01:10:14,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:10:14,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:10:14,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:10:14,952 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-16 01:10:14,954 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-16 01:10:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:10:15,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-16 01:10:15,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:10:15,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 treesize of output 5 [2023-02-16 01:10:15,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 treesize of output 5 [2023-02-16 01:10:15,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 01:10:15,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 01:10:15,117 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:10:15,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:10:15,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2023-02-16 01:10:15,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:15,160 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 36 treesize of output 40 [2023-02-16 01:10:15,162 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 39 treesize of output 35 [2023-02-16 01:10:15,167 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:15,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2023-02-16 01:10:15,191 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:10:15,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137501337] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:10:15,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:10:15,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 13 [2023-02-16 01:10:15,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854270083] [2023-02-16 01:10:15,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:10:15,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 01:10:15,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:10:15,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 01:10:15,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-02-16 01:10:15,193 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 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-16 01:10:15,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:10:15,360 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2023-02-16 01:10:15,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 01:10:15,360 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 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-16 01:10:15,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:10:15,361 INFO L225 Difference]: With dead ends: 59 [2023-02-16 01:10:15,361 INFO L226 Difference]: Without dead ends: 49 [2023-02-16 01:10:15,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2023-02-16 01:10:15,362 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 65 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 01:10:15,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 127 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 01:10:15,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-02-16 01:10:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2023-02-16 01:10:15,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 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-16 01:10:15,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2023-02-16 01:10:15,366 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 23 [2023-02-16 01:10:15,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:10:15,366 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2023-02-16 01:10:15,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 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-16 01:10:15,366 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2023-02-16 01:10:15,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 01:10:15,367 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:10:15,367 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:10:15,373 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-16 01:10:15,572 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,SelfDestructingSolverStorable5 [2023-02-16 01:10:15,573 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:10:15,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:10:15,573 INFO L85 PathProgramCache]: Analyzing trace with hash 379469720, now seen corresponding path program 2 times [2023-02-16 01:10:15,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:10:15,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078394933] [2023-02-16 01:10:15,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:10:15,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:10:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:10:15,898 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:10:15,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:10:15,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078394933] [2023-02-16 01:10:15,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078394933] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:10:15,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762277063] [2023-02-16 01:10:15,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 01:10:15,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:10:15,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:10:15,901 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-16 01:10:15,903 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-16 01:10:15,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 01:10:15,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:10:15,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-16 01:10:15,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:10:15,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-02-16 01:10:15,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-02-16 01:10:16,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 01:10:16,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 01:10:16,053 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:10:16,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:10:16,086 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:10:16,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762277063] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:10:16,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:10:16,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2023-02-16 01:10:16,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979591516] [2023-02-16 01:10:16,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:10:16,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 01:10:16,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:10:16,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 01:10:16,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-16 01:10:16,089 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:10:16,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:10:16,163 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2023-02-16 01:10:16,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 01:10:16,163 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-16 01:10:16,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:10:16,164 INFO L225 Difference]: With dead ends: 67 [2023-02-16 01:10:16,164 INFO L226 Difference]: Without dead ends: 40 [2023-02-16 01:10:16,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-16 01:10:16,165 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:10:16,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 86 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:10:16,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-16 01:10:16,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-02-16 01:10:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 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-16 01:10:16,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2023-02-16 01:10:16,169 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 24 [2023-02-16 01:10:16,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:10:16,169 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2023-02-16 01:10:16,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:10:16,170 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2023-02-16 01:10:16,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-16 01:10:16,170 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:10:16,170 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:10:16,176 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-16 01:10:16,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:10:16,376 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:10:16,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:10:16,377 INFO L85 PathProgramCache]: Analyzing trace with hash -3886178, now seen corresponding path program 3 times [2023-02-16 01:10:16,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:10:16,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561531985] [2023-02-16 01:10:16,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:10:16,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:10:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:10:16,981 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:10:16,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:10:16,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561531985] [2023-02-16 01:10:16,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561531985] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:10:16,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929950972] [2023-02-16 01:10:16,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 01:10:16,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:10:16,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:10:16,987 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-16 01:10:16,997 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-16 01:10:17,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-16 01:10:17,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:10:17,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 56 conjunts are in the unsatisfiable core [2023-02-16 01:10:17,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:10:17,140 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 6 treesize of output 5 [2023-02-16 01:10:17,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-02-16 01:10:17,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-02-16 01:10:17,175 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-16 01:10:17,175 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 15 treesize of output 15 [2023-02-16 01:10:17,301 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 7 treesize of output 3 [2023-02-16 01:10:17,305 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 37 treesize of output 25 [2023-02-16 01:10:17,309 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 16 treesize of output 8 [2023-02-16 01:10:17,334 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 20 treesize of output 20 [2023-02-16 01:10:17,356 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:17,356 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 1 case distinctions, treesize of input 26 treesize of output 10 [2023-02-16 01:10:17,358 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:10:17,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:10:17,531 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:17,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 59 [2023-02-16 01:10:17,575 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:17,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 87 [2023-02-16 01:10:17,580 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:17,580 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 13 treesize of output 5 [2023-02-16 01:10:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:10:17,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929950972] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:10:17,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:10:17,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2023-02-16 01:10:17,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303628830] [2023-02-16 01:10:17,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:10:17,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-16 01:10:17,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:10:17,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-16 01:10:17,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=344, Unknown=4, NotChecked=0, Total=420 [2023-02-16 01:10:17,735 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 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-16 01:10:18,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:10:18,202 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2023-02-16 01:10:18,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 01:10:18,203 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 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 28 [2023-02-16 01:10:18,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:10:18,203 INFO L225 Difference]: With dead ends: 65 [2023-02-16 01:10:18,203 INFO L226 Difference]: Without dead ends: 60 [2023-02-16 01:10:18,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=665, Unknown=4, NotChecked=0, Total=870 [2023-02-16 01:10:18,204 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 225 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 01:10:18,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 209 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 01:10:18,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-16 01:10:18,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2023-02-16 01:10:18,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 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-16 01:10:18,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2023-02-16 01:10:18,209 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 28 [2023-02-16 01:10:18,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:10:18,209 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2023-02-16 01:10:18,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 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-16 01:10:18,209 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2023-02-16 01:10:18,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 01:10:18,210 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:10:18,210 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:10:18,216 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-16 01:10:18,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:10:18,411 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:10:18,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:10:18,411 INFO L85 PathProgramCache]: Analyzing trace with hash 194884952, now seen corresponding path program 2 times [2023-02-16 01:10:18,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:10:18,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102201535] [2023-02-16 01:10:18,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:10:18,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:10:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:10:19,127 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:10:19,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:10:19,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102201535] [2023-02-16 01:10:19,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102201535] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:10:19,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97382532] [2023-02-16 01:10:19,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 01:10:19,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:10:19,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:10:19,129 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-16 01:10:19,135 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-16 01:10:19,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 01:10:19,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:10:19,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 63 conjunts are in the unsatisfiable core [2023-02-16 01:10:19,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:10:19,245 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 6 treesize of output 5 [2023-02-16 01:10:19,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-02-16 01:10:19,274 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-16 01:10:19,274 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 15 treesize of output 15 [2023-02-16 01:10:19,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-02-16 01:10:19,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:19,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:19,370 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 27 treesize of output 30 [2023-02-16 01:10:19,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:19,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:19,381 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 26 treesize of output 29 [2023-02-16 01:10:19,492 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 01:10:19,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 90 [2023-02-16 01:10:19,504 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 69 treesize of output 41 [2023-02-16 01:10:19,509 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 49 treesize of output 47 [2023-02-16 01:10:19,591 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 47 treesize of output 31 [2023-02-16 01:10:19,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 38 treesize of output 22 [2023-02-16 01:10:19,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:19,604 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 1 case distinctions, treesize of input 26 treesize of output 10 [2023-02-16 01:10:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:10:19,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:10:19,736 INFO L321 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2023-02-16 01:10:19,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1831 treesize of output 1526 [2023-02-16 01:10:30,862 WARN L837 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_528 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_528) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) |c_ULTIMATE.start_main_~i~0#1.base|))) (forall ((v_ArrVal_529 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_529) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))))) (forall ((v_ArrVal_528 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_528) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) |c_ULTIMATE.start_main_~i~0#1.base|)) (forall ((v_ArrVal_529 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_529) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) |c_ULTIMATE.start_main_~i~0#1.offset|))) is different from false [2023-02-16 01:10:31,118 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:31,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 35 [2023-02-16 01:10:31,121 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 30 treesize of output 22 [2023-02-16 01:10:31,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 01:10:31,141 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-02-16 01:10:31,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97382532] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:10:31,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:10:31,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2023-02-16 01:10:31,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682163937] [2023-02-16 01:10:31,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:10:31,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-16 01:10:31,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:10:31,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-16 01:10:31,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=4, NotChecked=44, Total=600 [2023-02-16 01:10:31,143 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 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-16 01:10:36,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:10:36,025 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2023-02-16 01:10:36,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 01:10:36,026 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 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 31 [2023-02-16 01:10:36,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:10:36,027 INFO L225 Difference]: With dead ends: 62 [2023-02-16 01:10:36,027 INFO L226 Difference]: Without dead ends: 60 [2023-02-16 01:10:36,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=244, Invalid=1016, Unknown=4, NotChecked=68, Total=1332 [2023-02-16 01:10:36,028 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 103 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 8 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 01:10:36,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 284 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 246 Invalid, 10 Unknown, 49 Unchecked, 0.4s Time] [2023-02-16 01:10:36,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-02-16 01:10:36,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2023-02-16 01:10:36,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 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-16 01:10:36,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2023-02-16 01:10:36,033 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 31 [2023-02-16 01:10:36,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:10:36,034 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2023-02-16 01:10:36,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 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-16 01:10:36,034 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2023-02-16 01:10:36,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-16 01:10:36,034 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:10:36,034 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:10:36,059 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-16 01:10:36,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:10:36,258 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:10:36,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:10:36,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1832566487, now seen corresponding path program 4 times [2023-02-16 01:10:36,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:10:36,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900405562] [2023-02-16 01:10:36,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:10:36,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:10:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:10:37,000 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:10:37,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:10:37,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900405562] [2023-02-16 01:10:37,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900405562] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:10:37,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804962412] [2023-02-16 01:10:37,001 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 01:10:37,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:10:37,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:10:37,009 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-16 01:10:37,011 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-16 01:10:37,333 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 01:10:37,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:10:37,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 72 conjunts are in the unsatisfiable core [2023-02-16 01:10:37,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:10:37,357 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 6 treesize of output 5 [2023-02-16 01:10:37,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-02-16 01:10:37,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-02-16 01:10:37,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-16 01:10:37,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-16 01:10:37,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:37,404 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 16 treesize of output 18 [2023-02-16 01:10:37,411 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-16 01:10:37,412 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 15 treesize of output 15 [2023-02-16 01:10:37,418 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 18 treesize of output 20 [2023-02-16 01:10:37,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2023-02-16 01:10:37,514 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 01:10:37,514 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 54 [2023-02-16 01:10:37,572 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 01:10:37,572 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2023-02-16 01:10:37,576 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-02-16 01:10:37,582 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:10:37,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:10:37,714 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:37,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2023-02-16 01:10:37,721 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:37,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 40 [2023-02-16 01:10:37,729 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 6 treesize of output 4 [2023-02-16 01:10:37,735 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 6 treesize of output 4 [2023-02-16 01:10:37,814 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:37,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 19 [2023-02-16 01:10:37,818 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:10:37,819 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 16 treesize of output 8 [2023-02-16 01:10:37,826 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:37,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 23 [2023-02-16 01:10:37,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 12 treesize of output 10 [2023-02-16 01:10:37,832 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:10:37,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 8 [2023-02-16 01:10:37,843 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:10:37,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804962412] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:10:37,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:10:37,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2023-02-16 01:10:37,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050681207] [2023-02-16 01:10:37,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:10:37,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 01:10:37,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:10:37,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 01:10:37,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-02-16 01:10:37,846 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 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-16 01:10:38,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:10:38,144 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2023-02-16 01:10:38,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 01:10:38,144 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 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) Word has length 32 [2023-02-16 01:10:38,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:10:38,145 INFO L225 Difference]: With dead ends: 96 [2023-02-16 01:10:38,145 INFO L226 Difference]: Without dead ends: 56 [2023-02-16 01:10:38,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-02-16 01:10:38,145 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 33 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 01:10:38,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 256 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 01:10:38,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-02-16 01:10:38,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-02-16 01:10:38,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 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-16 01:10:38,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2023-02-16 01:10:38,150 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 32 [2023-02-16 01:10:38,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:10:38,150 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2023-02-16 01:10:38,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 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-16 01:10:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2023-02-16 01:10:38,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 01:10:38,151 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:10:38,151 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:10:38,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-16 01:10:38,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:10:38,352 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:10:38,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:10:38,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1909608239, now seen corresponding path program 5 times [2023-02-16 01:10:38,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:10:38,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291608479] [2023-02-16 01:10:38,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:10:38,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:10:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:10:39,201 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:10:39,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:10:39,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291608479] [2023-02-16 01:10:39,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291608479] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:10:39,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633172896] [2023-02-16 01:10:39,202 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-16 01:10:39,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:10:39,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:10:39,213 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-16 01:10:39,233 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-16 01:10:42,704 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-02-16 01:10:42,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:10:42,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 76 conjunts are in the unsatisfiable core [2023-02-16 01:10:42,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:10:42,720 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 6 treesize of output 5 [2023-02-16 01:10:42,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-02-16 01:10:42,741 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-16 01:10:42,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 01:10:42,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-02-16 01:10:42,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-16 01:10:42,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:42,789 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 18 treesize of output 20 [2023-02-16 01:10:42,797 INFO L321 Elim1Store]: treesize reduction 37, result has 24.5 percent of original size [2023-02-16 01:10:42,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 22 [2023-02-16 01:10:42,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:42,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:42,931 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 01:10:42,931 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 40 [2023-02-16 01:10:42,936 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 37 treesize of output 25 [2023-02-16 01:10:42,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 01:10:43,005 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 01:10:43,005 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2023-02-16 01:10:43,009 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 22 treesize of output 22 [2023-02-16 01:10:43,030 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 18 treesize of output 18 [2023-02-16 01:10:43,050 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:43,051 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 1 case distinctions, treesize of input 26 treesize of output 10 [2023-02-16 01:10:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:10:43,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:10:43,128 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_897 (Array Int Int)) (v_ArrVal_892 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_892) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_897) |c_ULTIMATE.start_main_~l~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (+ (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) 1)))) is different from false [2023-02-16 01:10:43,198 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:43,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 119 [2023-02-16 01:10:43,227 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:43,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 391 treesize of output 403 [2023-02-16 01:10:43,231 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 352 treesize of output 336 [2023-02-16 01:10:43,234 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 336 treesize of output 304 [2023-02-16 01:10:43,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:43,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2023-02-16 01:10:43,506 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 6 treesize of output 4 [2023-02-16 01:10:43,558 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:43,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 24 [2023-02-16 01:10:43,560 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:10:43,560 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 21 treesize of output 9 [2023-02-16 01:10:43,562 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 11 treesize of output 9 [2023-02-16 01:10:43,594 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2023-02-16 01:10:43,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633172896] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:10:43,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:10:43,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2023-02-16 01:10:43,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745662805] [2023-02-16 01:10:43,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:10:43,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-16 01:10:43,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:10:43,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-16 01:10:43,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=504, Unknown=2, NotChecked=46, Total=650 [2023-02-16 01:10:43,596 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 26 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:10:44,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:10:44,286 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2023-02-16 01:10:44,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-16 01:10:44,287 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 26 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-16 01:10:44,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:10:44,287 INFO L225 Difference]: With dead ends: 87 [2023-02-16 01:10:44,287 INFO L226 Difference]: Without dead ends: 82 [2023-02-16 01:10:44,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=329, Invalid=1155, Unknown=2, NotChecked=74, Total=1560 [2023-02-16 01:10:44,289 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 343 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 01:10:44,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 267 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 203 Invalid, 0 Unknown, 62 Unchecked, 0.3s Time] [2023-02-16 01:10:44,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-16 01:10:44,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2023-02-16 01:10:44,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:10:44,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2023-02-16 01:10:44,305 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 36 [2023-02-16 01:10:44,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:10:44,306 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2023-02-16 01:10:44,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 26 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:10:44,306 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2023-02-16 01:10:44,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 01:10:44,312 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:10:44,312 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:10:44,331 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-16 01:10:44,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:10:44,530 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:10:44,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:10:44,530 INFO L85 PathProgramCache]: Analyzing trace with hash 368002532, now seen corresponding path program 3 times [2023-02-16 01:10:44,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:10:44,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820927166] [2023-02-16 01:10:44,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:10:44,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:10:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:10:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-16 01:10:45,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:10:45,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820927166] [2023-02-16 01:10:45,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820927166] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:10:45,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986392241] [2023-02-16 01:10:45,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 01:10:45,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:10:45,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:10:45,069 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-16 01:10:45,071 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-16 01:10:45,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-16 01:10:45,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:10:45,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-16 01:10:45,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:10:45,254 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 6 treesize of output 5 [2023-02-16 01:10:45,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-02-16 01:10:45,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-02-16 01:10:45,289 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-16 01:10:45,289 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 15 treesize of output 15 [2023-02-16 01:10:45,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:45,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:45,356 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 26 treesize of output 29 [2023-02-16 01:10:45,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:45,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:45,363 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 27 treesize of output 30 [2023-02-16 01:10:45,425 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 01:10:45,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 56 [2023-02-16 01:10:45,429 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 48 treesize of output 46 [2023-02-16 01:10:45,573 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 01:10:45,573 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2023-02-16 01:10:45,576 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-02-16 01:10:45,592 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 01:10:45,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:10:45,926 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 8)) (.cse4 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4)) (.cse5 (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse0 (select .cse6 |c_ULTIMATE.start_main_~i~0#1.offset|))) (and (forall ((v_ArrVal_1055 Int) (v_ArrVal_1056 Int) (v_ArrVal_1058 Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1060 Int)) (or (not (= 0 (select v_ArrVal_1065 .cse0))) (forall ((v_ArrVal_1066 (Array Int Int))) (or (= (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse2 .cse3 v_ArrVal_1055) .cse4 v_ArrVal_1060)) .cse5 v_ArrVal_1066))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse6 .cse3 v_ArrVal_1056) .cse4 v_ArrVal_1058)) .cse5 v_ArrVal_1065) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) 0) (not (= (select v_ArrVal_1066 .cse0) 0)))))) (forall ((v_ArrVal_1055 Int) (v_ArrVal_1056 Int) (v_ArrVal_1058 Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1060 Int)) (or (forall ((v_ArrVal_1066 (Array Int Int))) (or (= (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse6 .cse3 v_ArrVal_1056) .cse4 v_ArrVal_1058)) .cse5 v_ArrVal_1065))) (select (select .cse7 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse2 .cse3 v_ArrVal_1055) .cse4 v_ArrVal_1060)) .cse5 v_ArrVal_1066) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse7 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) 0) (not (= (select v_ArrVal_1066 .cse0) 0)))) (not (= 0 (select v_ArrVal_1065 .cse0)))))))) is different from false [2023-02-16 01:10:46,205 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:46,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 159 treesize of output 175 [2023-02-16 01:10:46,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:46,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 133 [2023-02-16 01:10:46,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 105 [2023-02-16 01:10:46,249 INFO L321 Elim1Store]: treesize reduction 23, result has 53.1 percent of original size [2023-02-16 01:10:46,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 186 treesize of output 175 [2023-02-16 01:10:46,268 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:46,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 164 [2023-02-16 01:10:46,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:46,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:46,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 351 treesize of output 361 [2023-02-16 01:10:46,310 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:46,311 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 311 treesize of output 311 [2023-02-16 01:10:46,321 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:46,321 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 274 treesize of output 252 [2023-02-16 01:10:46,338 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:46,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 243 treesize of output 243 [2023-02-16 01:10:46,372 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:46,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 239 treesize of output 251 [2023-02-16 01:10:47,277 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 6 treesize of output 4 [2023-02-16 01:10:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 6 not checked. [2023-02-16 01:10:47,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986392241] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:10:47,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:10:47,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 25 [2023-02-16 01:10:47,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830814047] [2023-02-16 01:10:47,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:10:47,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-16 01:10:47,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:10:47,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-16 01:10:47,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=468, Unknown=19, NotChecked=44, Total=600 [2023-02-16 01:10:47,334 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 25 states, 25 states have (on average 3.52) internal successors, (88), 25 states have internal predecessors, (88), 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-16 01:10:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:10:48,057 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2023-02-16 01:10:48,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 01:10:48,057 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.52) internal successors, (88), 25 states have internal predecessors, (88), 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 38 [2023-02-16 01:10:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:10:48,058 INFO L225 Difference]: With dead ends: 77 [2023-02-16 01:10:48,058 INFO L226 Difference]: Without dead ends: 66 [2023-02-16 01:10:48,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=207, Invalid=1038, Unknown=19, NotChecked=68, Total=1332 [2023-02-16 01:10:48,059 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 173 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 01:10:48,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 403 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 239 Invalid, 0 Unknown, 56 Unchecked, 0.3s Time] [2023-02-16 01:10:48,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-02-16 01:10:48,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2023-02-16 01:10:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:10:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2023-02-16 01:10:48,068 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 38 [2023-02-16 01:10:48,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:10:48,069 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2023-02-16 01:10:48,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.52) internal successors, (88), 25 states have internal predecessors, (88), 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-16 01:10:48,077 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2023-02-16 01:10:48,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-16 01:10:48,078 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:10:48,078 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:10:48,086 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-16 01:10:48,284 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,SelfDestructingSolverStorable11 [2023-02-16 01:10:48,284 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:10:48,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:10:48,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1993858009, now seen corresponding path program 4 times [2023-02-16 01:10:48,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:10:48,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530076150] [2023-02-16 01:10:48,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:10:48,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:10:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:10:49,555 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:10:49,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:10:49,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530076150] [2023-02-16 01:10:49,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530076150] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:10:49,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659546353] [2023-02-16 01:10:49,556 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 01:10:49,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:10:49,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:10:49,557 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-16 01:10:49,559 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-16 01:10:49,784 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 01:10:49,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:10:49,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 85 conjunts are in the unsatisfiable core [2023-02-16 01:10:49,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:10:49,818 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 6 treesize of output 5 [2023-02-16 01:10:49,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-02-16 01:10:49,850 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-16 01:10:49,850 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 21 treesize of output 29 [2023-02-16 01:10:49,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-16 01:10:49,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:49,896 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 30 treesize of output 28 [2023-02-16 01:10:49,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:49,905 INFO L321 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-02-16 01:10:49,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 28 treesize of output 22 [2023-02-16 01:10:49,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-02-16 01:10:50,017 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 01:10:50,017 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 44 [2023-02-16 01:10:50,027 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 58 treesize of output 53 [2023-02-16 01:10:50,151 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 01:10:50,152 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 81 [2023-02-16 01:10:50,173 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 45 treesize of output 29 [2023-02-16 01:10:50,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:50,179 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 18 treesize of output 20 [2023-02-16 01:10:50,261 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 01:10:50,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 71 [2023-02-16 01:10:50,265 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 34 treesize of output 30 [2023-02-16 01:10:50,281 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 22 treesize of output 24 [2023-02-16 01:10:50,377 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:10:50,378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 01:10:50,383 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:10:50,390 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2023-02-16 01:10:50,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 33 [2023-02-16 01:10:50,403 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:50,404 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 1 case distinctions, treesize of input 26 treesize of output 10 [2023-02-16 01:10:50,406 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:10:50,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:10:50,486 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1268 (Array Int Int)) (v_ArrVal_1271 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1271) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1268) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1269) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (< (select .cse0 (+ .cse1 8)) (+ (select .cse0 (+ .cse1 4)) 1)))) is different from false [2023-02-16 01:10:50,528 WARN L837 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_main_#t~short8#1| (forall ((v_ArrVal_1262 Int) (v_ArrVal_1264 Int) (v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1266 Int) (v_ArrVal_1268 (Array Int Int)) (v_ArrVal_1267 Int) (v_ArrVal_1261 (Array Int Int)) (v_ArrVal_1271 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (or (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse0 (let ((.cse4 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 8))) (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse3 .cse4 v_ArrVal_1264) .cse5 v_ArrVal_1262)) .cse2 v_ArrVal_1271) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse6 .cse4 v_ArrVal_1267) .cse5 v_ArrVal_1266)) .cse2 v_ArrVal_1268) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))) (.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1261) .cse2 v_ArrVal_1269) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (< (select .cse0 (+ .cse1 8)) (+ (select .cse0 (+ .cse1 4)) 1))))) (not (<= v_ArrVal_1264 |c_ULTIMATE.start_main_~order~0#1|)) (not (<= (select .cse3 .cse5) v_ArrVal_1262)))))) is different from false [2023-02-16 01:10:50,540 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:50,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 139 [2023-02-16 01:10:50,575 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:50,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 223 treesize of output 327 [2023-02-16 01:10:50,589 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 75 treesize of output 39 [2023-02-16 01:10:51,245 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse5 (select .cse12 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse3 (+ .cse5 8)) (.cse4 (+ .cse5 4)) (.cse7 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 8)) (.cse8 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4)) (.cse0 (select .cse6 |c_ULTIMATE.start_main_~i~0#1.offset|))) (and (forall ((v_ArrVal_1255 Int) (v_ArrVal_1266 Int) (v_ArrVal_1268 (Array Int Int)) (v_ArrVal_1257 Int) (v_ArrVal_1267 Int)) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse6 .cse7 v_ArrVal_1257) .cse8 v_ArrVal_1255)))) (let ((.cse2 (select .cse1 .cse0))) (store (store .cse1 .cse0 (store (store .cse2 .cse3 v_ArrVal_1267) .cse4 v_ArrVal_1266)) (select .cse2 .cse5) v_ArrVal_1268))) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (forall ((v_ArrVal_1255 Int) (v_ArrVal_1266 Int) (v_ArrVal_1268 (Array Int Int)) (v_ArrVal_1257 Int) (v_ArrVal_1267 Int)) (not (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse6 .cse7 v_ArrVal_1257) .cse8 v_ArrVal_1255)))) (let ((.cse10 (select .cse9 .cse0))) (let ((.cse11 (select .cse10 .cse5))) (= (select (select (store (store .cse9 .cse0 (store (store .cse10 .cse3 v_ArrVal_1267) .cse4 v_ArrVal_1266)) .cse11 v_ArrVal_1268) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse11)))))) (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1255 Int) (v_ArrVal_1254 Int) (v_ArrVal_1257 Int) (v_ArrVal_1256 Int) (v_ArrVal_1261 (Array Int Int))) (= .cse5 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse12 .cse7 v_ArrVal_1256) .cse8 v_ArrVal_1254)) .cse0 v_ArrVal_1261) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse6 .cse7 v_ArrVal_1257) .cse8 v_ArrVal_1255)) .cse0) .cse5) v_ArrVal_1269) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1255 Int) (v_ArrVal_1254 Int) (v_ArrVal_1257 Int) (v_ArrVal_1256 Int) (v_ArrVal_1261 (Array Int Int))) (let ((.cse13 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse12 .cse7 v_ArrVal_1256) .cse8 v_ArrVal_1254)) .cse0 v_ArrVal_1261) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse6 .cse7 v_ArrVal_1257) .cse8 v_ArrVal_1255)) .cse0) .cse5) v_ArrVal_1269) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= .cse13 .cse5) (= .cse13 .cse4)))))))) is different from false [2023-02-16 01:10:52,408 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:52,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 137 [2023-02-16 01:10:52,433 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:52,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 138 [2023-02-16 01:10:52,441 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 212 treesize of output 200 [2023-02-16 01:10:52,449 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 187 treesize of output 183 [2023-02-16 01:10:52,460 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 183 treesize of output 175 [2023-02-16 01:10:52,568 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 6 treesize of output 4 [2023-02-16 01:10:52,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 41 treesize of output 4 [2023-02-16 01:10:52,733 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:10:52,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 98 treesize of output 61 [2023-02-16 01:10:52,737 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:10:52,739 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 57 treesize of output 27 [2023-02-16 01:10:52,743 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-16 01:10:52,745 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 34 [2023-02-16 01:10:52,932 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2023-02-16 01:10:52,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659546353] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:10:52,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:10:52,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2023-02-16 01:10:52,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897298125] [2023-02-16 01:10:52,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:10:52,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-16 01:10:52,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:10:52,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-16 01:10:52,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=556, Unknown=10, NotChecked=150, Total=812 [2023-02-16 01:10:52,934 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand has 29 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 29 states have internal predecessors, (92), 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-16 01:10:54,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:10:54,991 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2023-02-16 01:10:54,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 01:10:54,991 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 29 states have internal predecessors, (92), 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 39 [2023-02-16 01:10:54,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:10:54,992 INFO L225 Difference]: With dead ends: 80 [2023-02-16 01:10:54,992 INFO L226 Difference]: Without dead ends: 78 [2023-02-16 01:10:54,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=274, Invalid=1060, Unknown=10, NotChecked=216, Total=1560 [2023-02-16 01:10:54,993 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 239 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 01:10:54,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 366 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 264 Invalid, 0 Unknown, 177 Unchecked, 0.7s Time] [2023-02-16 01:10:54,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-16 01:10:55,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 61. [2023-02-16 01:10:55,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 60 states have internal predecessors, (79), 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-16 01:10:55,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2023-02-16 01:10:55,000 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 79 transitions. Word has length 39 [2023-02-16 01:10:55,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:10:55,001 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 79 transitions. [2023-02-16 01:10:55,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 29 states have internal predecessors, (92), 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-16 01:10:55,001 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 79 transitions. [2023-02-16 01:10:55,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 01:10:55,002 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:10:55,002 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:10:55,011 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-16 01:10:55,202 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,SelfDestructingSolverStorable12 [2023-02-16 01:10:55,202 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:10:55,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:10:55,203 INFO L85 PathProgramCache]: Analyzing trace with hash -964121542, now seen corresponding path program 6 times [2023-02-16 01:10:55,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:10:55,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513020998] [2023-02-16 01:10:55,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:10:55,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:10:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:10:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:10:56,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:10:56,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513020998] [2023-02-16 01:10:56,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513020998] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:10:56,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573489732] [2023-02-16 01:10:56,299 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-16 01:10:56,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:10:56,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:10:56,301 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-16 01:10:56,304 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-16 01:10:57,420 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-02-16 01:10:57,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:10:57,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 107 conjunts are in the unsatisfiable core [2023-02-16 01:10:57,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:10:57,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-02-16 01:10:57,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-02-16 01:10:57,463 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 6 treesize of output 5 [2023-02-16 01:10:57,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-16 01:10:57,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-16 01:10:57,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:57,533 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 16 treesize of output 18 [2023-02-16 01:10:57,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:57,539 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 16 treesize of output 18 [2023-02-16 01:10:57,561 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-16 01:10:57,562 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 21 treesize of output 29 [2023-02-16 01:10:57,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-16 01:10:57,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-16 01:10:57,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:57,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:57,651 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-16 01:10:57,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:57,665 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-16 01:10:57,666 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 52 [2023-02-16 01:10:57,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:57,677 INFO L321 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-02-16 01:10:57,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 28 treesize of output 22 [2023-02-16 01:10:57,813 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-16 01:10:57,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 67 [2023-02-16 01:10:57,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:57,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 57 [2023-02-16 01:10:57,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:57,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:57,932 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-16 01:10:57,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 127 [2023-02-16 01:10:57,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:10:57,953 INFO L321 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2023-02-16 01:10:57,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 97 [2023-02-16 01:10:58,064 INFO L321 Elim1Store]: treesize reduction 85, result has 11.5 percent of original size [2023-02-16 01:10:58,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 74 [2023-02-16 01:10:58,075 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2023-02-16 01:10:58,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 25 [2023-02-16 01:10:58,081 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:10:58,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:11:01,120 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:01,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 157 treesize of output 192 [2023-02-16 01:11:01,203 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:01,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 156 [2023-02-16 01:11:01,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 41 treesize of output 4 [2023-02-16 01:11:01,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 41 treesize of output 4 [2023-02-16 01:11:01,519 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:01,520 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 169 treesize of output 164 [2023-02-16 01:11:01,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:01,529 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 157 treesize of output 152 [2023-02-16 01:11:01,921 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:01,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 114 treesize of output 89 [2023-02-16 01:11:01,924 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:11:01,933 INFO L321 Elim1Store]: treesize reduction 32, result has 11.1 percent of original size [2023-02-16 01:11:01,933 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 9960 treesize of output 9446 [2023-02-16 01:11:01,944 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:01,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 9438 treesize of output 6400 [2023-02-16 01:11:01,948 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:11:01,951 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 3352 treesize of output 3346 [2023-02-16 01:11:01,963 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 01:11:01,964 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 6228 treesize of output 5082 [2023-02-16 01:11:01,967 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 1771 treesize of output 1387 [2023-02-16 01:11:01,970 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 1387 treesize of output 1131 [2023-02-16 01:11:01,973 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 1116 treesize of output 1050 [2023-02-16 01:11:01,976 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:11:01,976 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:11:01,980 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 01:11:01,980 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 1 case distinctions, treesize of input 16 treesize of output 12 [2023-02-16 01:11:02,359 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:02,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 114 treesize of output 89 [2023-02-16 01:11:02,366 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:02,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 78 treesize of output 77 [2023-02-16 01:11:02,369 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:11:02,370 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:11:02,370 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:11:02,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:02,374 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 8 [2023-02-16 01:11:02,381 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 01:11:02,381 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 32 treesize of output 26 [2023-02-16 01:11:02,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 10 treesize of output 4 [2023-02-16 01:11:02,393 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:11:02,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573489732] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:11:02,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:11:02,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2023-02-16 01:11:02,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19221012] [2023-02-16 01:11:02,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:11:02,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-16 01:11:02,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:11:02,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-16 01:11:02,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2023-02-16 01:11:02,396 INFO L87 Difference]: Start difference. First operand 61 states and 79 transitions. Second operand has 21 states, 21 states have (on average 4.095238095238095) internal successors, (86), 21 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-16 01:11:03,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:11:03,570 INFO L93 Difference]: Finished difference Result 115 states and 148 transitions. [2023-02-16 01:11:03,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 01:11:03,571 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.095238095238095) internal successors, (86), 21 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 40 [2023-02-16 01:11:03,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:11:03,572 INFO L225 Difference]: With dead ends: 115 [2023-02-16 01:11:03,572 INFO L226 Difference]: Without dead ends: 94 [2023-02-16 01:11:03,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2023-02-16 01:11:03,573 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 60 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:11:03,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 396 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-16 01:11:03,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-16 01:11:03,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2023-02-16 01:11:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.303370786516854) internal successors, (116), 89 states have internal predecessors, (116), 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-16 01:11:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 116 transitions. [2023-02-16 01:11:03,603 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 116 transitions. Word has length 40 [2023-02-16 01:11:03,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:11:03,603 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 116 transitions. [2023-02-16 01:11:03,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.095238095238095) internal successors, (86), 21 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-16 01:11:03,603 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 116 transitions. [2023-02-16 01:11:03,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 01:11:03,604 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:11:03,604 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:11:03,619 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-16 01:11:03,813 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,SelfDestructingSolverStorable13 [2023-02-16 01:11:03,813 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:11:03,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:11:03,821 INFO L85 PathProgramCache]: Analyzing trace with hash 377654319, now seen corresponding path program 5 times [2023-02-16 01:11:03,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:11:03,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259229596] [2023-02-16 01:11:03,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:11:03,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:11:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:11:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:11:05,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:11:05,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259229596] [2023-02-16 01:11:05,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259229596] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:11:05,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193361325] [2023-02-16 01:11:05,605 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-16 01:11:05,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:11:05,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:11:05,609 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-16 01:11:05,611 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-16 01:11:09,574 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-02-16 01:11:09,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:11:09,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 106 conjunts are in the unsatisfiable core [2023-02-16 01:11:09,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:11:09,608 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 6 treesize of output 5 [2023-02-16 01:11:09,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-02-16 01:11:09,635 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-16 01:11:09,635 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 21 treesize of output 29 [2023-02-16 01:11:09,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-02-16 01:11:09,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-16 01:11:09,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2023-02-16 01:11:09,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:09,684 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 30 treesize of output 28 [2023-02-16 01:11:09,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:09,688 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 18 treesize of output 20 [2023-02-16 01:11:09,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:09,699 INFO L321 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-02-16 01:11:09,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 28 treesize of output 22 [2023-02-16 01:11:09,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:09,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2023-02-16 01:11:09,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:09,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:09,797 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:11:09,799 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 01:11:09,799 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2023-02-16 01:11:09,866 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 01:11:09,867 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 75 [2023-02-16 01:11:09,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:09,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 47 [2023-02-16 01:11:10,000 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 01:11:10,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 125 [2023-02-16 01:11:10,005 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 101 treesize of output 57 [2023-02-16 01:11:10,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:11:10,008 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 80 treesize of output 73 [2023-02-16 01:11:10,244 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:11:10,245 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:11:10,252 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-02-16 01:11:10,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 117 treesize of output 66 [2023-02-16 01:11:10,259 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 01:11:10,262 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 01:11:10,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 31 [2023-02-16 01:11:10,284 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:10,285 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 1 case distinctions, treesize of input 34 treesize of output 10 [2023-02-16 01:11:10,287 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:11:10,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:11:10,521 INFO L321 Elim1Store]: treesize reduction 54, result has 50.5 percent of original size [2023-02-16 01:11:10,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2022 treesize of output 1681 [2023-02-16 01:11:11,651 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1724 (Array Int Int)) (v_ArrVal_1722 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1724))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1722) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) |c_ULTIMATE.start_main_~i~0#1.offset|)) (forall ((v_ArrVal_1724 (Array Int Int)) (v_ArrVal_1722 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1724)) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1722))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (not (= (select (select .cse1 .cse2) .cse3) |c_ULTIMATE.start_main_~i~0#1.base|)) (not (= (select (select .cse4 .cse2) .cse3) (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))))))) (forall ((v_ArrVal_1724 (Array Int Int)) (v_ArrVal_1722 (Array Int Int))) (= (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1722))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1724) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) |c_ULTIMATE.start_main_~i~0#1.base|))) is different from false [2023-02-16 01:11:11,698 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 8)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4)) (.cse4 (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse10 (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|))) (and (forall ((v_ArrVal_1715 Int) (v_ArrVal_1724 (Array Int Int)) (v_ArrVal_1718 Int) (v_ArrVal_1717 Int) (v_ArrVal_1722 (Array Int Int)) (v_ArrVal_1719 Int)) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse1 .cse2 v_ArrVal_1717) .cse3 v_ArrVal_1715)) .cse4 v_ArrVal_1722))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse5 .cse2 v_ArrVal_1719) .cse3 v_ArrVal_1718)) .cse4 v_ArrVal_1724) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) .cse4)) (forall ((v_ArrVal_1715 Int) (v_ArrVal_1724 (Array Int Int)) (v_ArrVal_1718 Int) (v_ArrVal_1717 Int) (v_ArrVal_1722 (Array Int Int)) (v_ArrVal_1719 Int)) (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse5 .cse2 v_ArrVal_1719) .cse3 v_ArrVal_1718)) .cse4 v_ArrVal_1724)) (.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse1 .cse2 v_ArrVal_1717) .cse3 v_ArrVal_1715)) .cse4 v_ArrVal_1722))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (not (= (select (select .cse6 .cse7) .cse8) .cse4)) (not (= (select (select .cse9 .cse7) .cse8) (+ .cse10 4))))))) (forall ((v_ArrVal_1715 Int) (v_ArrVal_1724 (Array Int Int)) (v_ArrVal_1718 Int) (v_ArrVal_1717 Int) (v_ArrVal_1722 (Array Int Int)) (v_ArrVal_1719 Int)) (= (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse5 .cse2 v_ArrVal_1719) .cse3 v_ArrVal_1718)) .cse4 v_ArrVal_1724))) (select (select .cse11 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse1 .cse2 v_ArrVal_1717) .cse3 v_ArrVal_1715)) .cse4 v_ArrVal_1722) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse11 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) .cse10))))) is different from false [2023-02-16 01:11:20,891 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse11 (select .cse8 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse4 (+ .cse11 8)) (.cse5 (+ .cse11 4)) (.cse2 (select .cse12 |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse9 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse10 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))) (and (forall ((v_ArrVal_1715 Int) (v_ArrVal_1724 (Array Int Int)) (v_ArrVal_1707 Int) (v_ArrVal_1718 Int) (v_ArrVal_1717 Int) (v_ArrVal_1722 (Array Int Int)) (v_ArrVal_1709 Int) (v_ArrVal_1719 Int) (v_ArrVal_1710 Int) (v_ArrVal_1711 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse12 .cse9 v_ArrVal_1707) .cse10 v_ArrVal_1709)))) (let ((.cse3 (select .cse1 .cse2))) (let ((.cse6 (select .cse3 .cse11))) (= (select (let ((.cse0 (store (store .cse1 .cse2 (store (store .cse3 .cse4 v_ArrVal_1717) .cse5 v_ArrVal_1715)) .cse6 v_ArrVal_1722))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (select (select (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse8 .cse9 v_ArrVal_1711) .cse10 v_ArrVal_1710)))) (store .cse7 .cse2 (store (store (select .cse7 .cse2) .cse4 v_ArrVal_1719) .cse5 v_ArrVal_1718))) .cse6 v_ArrVal_1724) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) .cse6))))) (forall ((v_ArrVal_1715 Int) (v_ArrVal_1724 (Array Int Int)) (v_ArrVal_1707 Int) (v_ArrVal_1718 Int) (v_ArrVal_1717 Int) (v_ArrVal_1722 (Array Int Int)) (v_ArrVal_1709 Int) (v_ArrVal_1719 Int) (v_ArrVal_1710 Int) (v_ArrVal_1711 Int)) (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse12 .cse9 v_ArrVal_1707) .cse10 v_ArrVal_1709)))) (let ((.cse20 (select .cse19 .cse2)) (.cse21 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse8 .cse9 v_ArrVal_1711) .cse10 v_ArrVal_1710)))) (let ((.cse18 (select .cse21 .cse2)) (.cse16 (select .cse20 .cse11))) (let ((.cse17 (store (store .cse21 .cse2 (store (store .cse18 .cse4 v_ArrVal_1719) .cse5 v_ArrVal_1718)) .cse16 v_ArrVal_1724)) (.cse13 (store (store .cse19 .cse2 (store (store .cse20 .cse4 v_ArrVal_1717) .cse5 v_ArrVal_1715)) .cse16 v_ArrVal_1722))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse15 (select (select .cse17 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (not (= (select (select .cse13 .cse14) .cse15) .cse16)) (not (= (select (select .cse17 .cse14) .cse15) (+ (select .cse18 .cse11) 4)))))))))) (forall ((v_ArrVal_1715 Int) (v_ArrVal_1724 (Array Int Int)) (v_ArrVal_1707 Int) (v_ArrVal_1718 Int) (v_ArrVal_1717 Int) (v_ArrVal_1722 (Array Int Int)) (v_ArrVal_1709 Int) (v_ArrVal_1719 Int) (v_ArrVal_1710 Int) (v_ArrVal_1711 Int)) (let ((.cse26 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse8 .cse9 v_ArrVal_1711) .cse10 v_ArrVal_1710)))) (let ((.cse27 (select .cse26 .cse2))) (= (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse12 .cse9 v_ArrVal_1707) .cse10 v_ArrVal_1709)))) (let ((.cse24 (select .cse23 .cse2))) (let ((.cse25 (select .cse24 .cse11))) (let ((.cse22 (store (store .cse26 .cse2 (store (store .cse27 .cse4 v_ArrVal_1719) .cse5 v_ArrVal_1718)) .cse25 v_ArrVal_1724))) (select (select .cse22 (select (select (store (store .cse23 .cse2 (store (store .cse24 .cse4 v_ArrVal_1717) .cse5 v_ArrVal_1715)) .cse25 v_ArrVal_1722) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse22 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))) (select .cse27 .cse11))))))))) is different from false [2023-02-16 01:11:22,231 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:22,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 826 treesize of output 857 [2023-02-16 01:11:25,559 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:25,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 700 treesize of output 623 [2023-02-16 01:11:25,687 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 69 [2023-02-16 01:11:25,734 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 69 [2023-02-16 01:11:25,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 41 treesize of output 4 [2023-02-16 01:11:25,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 41 treesize of output 4 [2023-02-16 01:11:25,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 41 treesize of output 4 [2023-02-16 01:11:25,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 41 treesize of output 4 [2023-02-16 01:11:27,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:27,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 803 treesize of output 700 [2023-02-16 01:11:27,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:27,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 113468 treesize of output 107980 [2023-02-16 01:11:27,270 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:27,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 107974 treesize of output 67566 [2023-02-16 01:11:27,531 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:27,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 612165 treesize of output 558943 [2023-02-16 01:11:27,740 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:27,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 575417 treesize of output 568000 [2023-02-16 01:11:27,926 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:27,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 582384 treesize of output 543584 [2023-02-16 01:11:28,248 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:28,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 543532 treesize of output 511870 [2023-02-16 01:11:28,632 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:28,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 509470 treesize of output 504118 [2023-02-16 01:11:28,988 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 503981 treesize of output 503453 [2023-02-16 01:11:29,291 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 505756 treesize of output 504212 [2023-02-16 01:11:29,591 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 504212 treesize of output 501548 [2023-02-16 01:11:29,974 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:29,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 499563 treesize of output 499388 [2023-02-16 01:11:30,444 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:30,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 500716 treesize of output 500124 [2023-02-16 01:11:30,836 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 500039 treesize of output 499641 [2023-02-16 01:11:31,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:31,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 499696 treesize of output 496364 [2023-02-16 01:11:31,929 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:11:31,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 500894 treesize of output 492572