./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.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 --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 073ee5c5f9e0a51509973bbde311a97e7673effbb0d5db6a027ba4e786762a02 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 01:44:11,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 01:44:11,412 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 01:44:11,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 01:44:11,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 01:44:11,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 01:44:11,441 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 01:44:11,441 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 01:44:11,441 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 01:44:11,442 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 01:44:11,442 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 01:44:11,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 01:44:11,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 01:44:11,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 01:44:11,445 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 01:44:11,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 01:44:11,446 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 01:44:11,446 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 01:44:11,446 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 01:44:11,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 01:44:11,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 01:44:11,450 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 01:44:11,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 01:44:11,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 01:44:11,450 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 01:44:11,451 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 01:44:11,451 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 01:44:11,451 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 01:44:11,451 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 01:44:11,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 01:44:11,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 01:44:11,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 01:44:11,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:44:11,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 01:44:11,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 01:44:11,453 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 01:44:11,453 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 01:44:11,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 01:44:11,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 01:44:11,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 01:44:11,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 01:44:11,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 01:44:11,455 INFO L153 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 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 -> 073ee5c5f9e0a51509973bbde311a97e7673effbb0d5db6a027ba4e786762a02 [2024-10-14 01:44:11,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 01:44:11,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 01:44:11,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 01:44:11,742 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 01:44:11,746 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 01:44:11,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i [2024-10-14 01:44:13,176 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 01:44:13,413 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 01:44:13,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i [2024-10-14 01:44:13,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b3d6766/d1296b7db9a84b47968911dabe1cd768/FLAG7837ed389 [2024-10-14 01:44:13,445 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b3d6766/d1296b7db9a84b47968911dabe1cd768 [2024-10-14 01:44:13,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 01:44:13,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 01:44:13,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 01:44:13,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 01:44:13,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 01:44:13,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:44:13" (1/1) ... [2024-10-14 01:44:13,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58cf4281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:13, skipping insertion in model container [2024-10-14 01:44:13,460 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:44:13" (1/1) ... [2024-10-14 01:44:13,493 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 01:44:13,708 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i[24291,24304] [2024-10-14 01:44:13,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:44:13,722 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 01:44:13,758 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i[24291,24304] [2024-10-14 01:44:13,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:44:13,787 INFO L204 MainTranslator]: Completed translation [2024-10-14 01:44:13,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:13 WrapperNode [2024-10-14 01:44:13,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 01:44:13,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 01:44:13,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 01:44:13,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 01:44:13,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:13" (1/1) ... [2024-10-14 01:44:13,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:13" (1/1) ... [2024-10-14 01:44:13,864 INFO L138 Inliner]: procedures = 122, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 204 [2024-10-14 01:44:13,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 01:44:13,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 01:44:13,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 01:44:13,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 01:44:13,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:13" (1/1) ... [2024-10-14 01:44:13,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:13" (1/1) ... [2024-10-14 01:44:13,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:13" (1/1) ... [2024-10-14 01:44:13,908 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 26, 12]. 65 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 15 writes are split as follows [0, 10, 5]. [2024-10-14 01:44:13,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:13" (1/1) ... [2024-10-14 01:44:13,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:13" (1/1) ... [2024-10-14 01:44:13,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:13" (1/1) ... [2024-10-14 01:44:13,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:13" (1/1) ... [2024-10-14 01:44:13,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:13" (1/1) ... [2024-10-14 01:44:13,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:13" (1/1) ... [2024-10-14 01:44:13,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 01:44:13,921 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 01:44:13,922 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 01:44:13,922 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 01:44:13,922 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:13" (1/1) ... [2024-10-14 01:44:13,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:44:13,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:13,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 01:44:13,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 01:44:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-10-14 01:44:13,980 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-10-14 01:44:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 01:44:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 01:44:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 01:44:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 01:44:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 01:44:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 01:44:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 01:44:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 01:44:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 01:44:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 01:44:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 01:44:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 01:44:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 01:44:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 01:44:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 01:44:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 01:44:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 01:44:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 01:44:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 01:44:13,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 01:44:14,057 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 01:44:14,059 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 01:44:14,086 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-10-14 01:44:14,322 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-10-14 01:44:14,322 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 01:44:14,346 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 01:44:14,346 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-14 01:44:14,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:44:14 BoogieIcfgContainer [2024-10-14 01:44:14,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 01:44:14,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 01:44:14,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 01:44:14,351 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 01:44:14,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:44:13" (1/3) ... [2024-10-14 01:44:14,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28300f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:44:14, skipping insertion in model container [2024-10-14 01:44:14,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:13" (2/3) ... [2024-10-14 01:44:14,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28300f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:44:14, skipping insertion in model container [2024-10-14 01:44:14,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:44:14" (3/3) ... [2024-10-14 01:44:14,355 INFO L112 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-2.i [2024-10-14 01:44:14,371 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 01:44:14,371 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 01:44:14,424 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 01:44:14,429 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@3a8692f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 01:44:14,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 01:44:14,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 47 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:14,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 01:44:14,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:14,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:14,441 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:14,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:14,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1035494790, now seen corresponding path program 1 times [2024-10-14 01:44:14,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:14,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606714049] [2024-10-14 01:44:14,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:14,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:14,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:14,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:14,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606714049] [2024-10-14 01:44:14,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606714049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:44:14,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:44:14,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 01:44:14,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91032767] [2024-10-14 01:44:14,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:44:14,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 01:44:14,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:14,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 01:44:14,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 01:44:14,632 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.7045454545454546) internal successors, (75), 47 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 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 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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) [2024-10-14 01:44:14,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:14,678 INFO L93 Difference]: Finished difference Result 97 states and 155 transitions. [2024-10-14 01:44:14,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 01:44:14,693 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 01:44:14,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:14,702 INFO L225 Difference]: With dead ends: 97 [2024-10-14 01:44:14,702 INFO L226 Difference]: Without dead ends: 42 [2024-10-14 01:44:14,718 INFO L431 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 [2024-10-14 01:44:14,727 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:14,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:44:14,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-14 01:44:14,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-14 01:44:14,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 41 states have internal predecessors, (59), 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) [2024-10-14 01:44:14,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2024-10-14 01:44:14,759 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 15 [2024-10-14 01:44:14,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:14,759 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2024-10-14 01:44:14,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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) [2024-10-14 01:44:14,760 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2024-10-14 01:44:14,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 01:44:14,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:14,760 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:14,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 01:44:14,761 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:14,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:14,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1634113901, now seen corresponding path program 1 times [2024-10-14 01:44:14,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:14,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2599958] [2024-10-14 01:44:14,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:14,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:14,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:14,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2599958] [2024-10-14 01:44:14,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2599958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:44:14,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:44:14,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 01:44:14,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295400296] [2024-10-14 01:44:14,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:44:14,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 01:44:14,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:14,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 01:44:14,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 01:44:14,826 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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) [2024-10-14 01:44:14,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:14,839 INFO L93 Difference]: Finished difference Result 70 states and 96 transitions. [2024-10-14 01:44:14,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 01:44:14,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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 [2024-10-14 01:44:14,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:14,842 INFO L225 Difference]: With dead ends: 70 [2024-10-14 01:44:14,842 INFO L226 Difference]: Without dead ends: 50 [2024-10-14 01:44:14,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 01:44:14,843 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 30 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 91 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 [2024-10-14 01:44:14,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 91 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:44:14,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-14 01:44:14,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-14 01:44:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.469387755102041) internal successors, (72), 49 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) [2024-10-14 01:44:14,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2024-10-14 01:44:14,849 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 20 [2024-10-14 01:44:14,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:14,849 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2024-10-14 01:44:14,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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) [2024-10-14 01:44:14,850 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2024-10-14 01:44:14,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 01:44:14,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:14,851 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:14,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 01:44:14,851 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:14,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:14,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1678369216, now seen corresponding path program 1 times [2024-10-14 01:44:14,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:14,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895987978] [2024-10-14 01:44:14,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:14,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:15,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:15,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895987978] [2024-10-14 01:44:15,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895987978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:44:15,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:44:15,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 01:44:15,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463133324] [2024-10-14 01:44:15,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:44:15,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 01:44:15,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:15,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 01:44:15,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 01:44:15,099 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:15,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:15,301 INFO L93 Difference]: Finished difference Result 128 states and 190 transitions. [2024-10-14 01:44:15,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 01:44:15,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-14 01:44:15,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:15,311 INFO L225 Difference]: With dead ends: 128 [2024-10-14 01:44:15,311 INFO L226 Difference]: Without dead ends: 92 [2024-10-14 01:44:15,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 01:44:15,312 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 70 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:15,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 173 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:44:15,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-14 01:44:15,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 73. [2024-10-14 01:44:15,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.5) internal successors, (108), 72 states have internal predecessors, (108), 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) [2024-10-14 01:44:15,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2024-10-14 01:44:15,325 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 26 [2024-10-14 01:44:15,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:15,325 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2024-10-14 01:44:15,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:15,328 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2024-10-14 01:44:15,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 01:44:15,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:15,330 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:15,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 01:44:15,330 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:15,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:15,330 INFO L85 PathProgramCache]: Analyzing trace with hash 860720766, now seen corresponding path program 1 times [2024-10-14 01:44:15,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:15,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440114631] [2024-10-14 01:44:15,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:15,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:15,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:15,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:15,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440114631] [2024-10-14 01:44:15,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440114631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:44:15,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:44:15,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 01:44:15,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706174396] [2024-10-14 01:44:15,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:44:15,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 01:44:15,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:15,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 01:44:15,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 01:44:15,535 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:15,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:15,604 INFO L93 Difference]: Finished difference Result 90 states and 128 transitions. [2024-10-14 01:44:15,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 01:44:15,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-14 01:44:15,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:15,606 INFO L225 Difference]: With dead ends: 90 [2024-10-14 01:44:15,606 INFO L226 Difference]: Without dead ends: 86 [2024-10-14 01:44:15,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 01:44:15,607 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:15,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 187 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:44:15,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-14 01:44:15,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2024-10-14 01:44:15,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.4814814814814814) internal successors, (120), 81 states have internal predecessors, (120), 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) [2024-10-14 01:44:15,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 120 transitions. [2024-10-14 01:44:15,624 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 120 transitions. Word has length 26 [2024-10-14 01:44:15,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:15,625 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 120 transitions. [2024-10-14 01:44:15,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:15,625 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 120 transitions. [2024-10-14 01:44:15,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 01:44:15,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:15,626 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:15,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 01:44:15,626 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:15,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:15,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1727351847, now seen corresponding path program 1 times [2024-10-14 01:44:15,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:15,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367279187] [2024-10-14 01:44:15,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:15,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:15,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:15,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:15,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367279187] [2024-10-14 01:44:15,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367279187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:44:15,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:44:15,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 01:44:15,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063162029] [2024-10-14 01:44:15,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:44:15,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 01:44:15,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:15,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 01:44:15,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 01:44:15,774 INFO L87 Difference]: Start difference. First operand 82 states and 120 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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) [2024-10-14 01:44:15,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:15,828 INFO L93 Difference]: Finished difference Result 92 states and 130 transitions. [2024-10-14 01:44:15,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 01:44:15,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 [2024-10-14 01:44:15,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:15,830 INFO L225 Difference]: With dead ends: 92 [2024-10-14 01:44:15,830 INFO L226 Difference]: Without dead ends: 84 [2024-10-14 01:44:15,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 01:44:15,831 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 5 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:15,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 190 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:44:15,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-14 01:44:15,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2024-10-14 01:44:15,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.481012658227848) internal successors, (117), 79 states have internal predecessors, (117), 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) [2024-10-14 01:44:15,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 117 transitions. [2024-10-14 01:44:15,847 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 117 transitions. Word has length 28 [2024-10-14 01:44:15,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:15,847 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 117 transitions. [2024-10-14 01:44:15,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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) [2024-10-14 01:44:15,847 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 117 transitions. [2024-10-14 01:44:15,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 01:44:15,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:15,852 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:15,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 01:44:15,852 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:15,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:15,853 INFO L85 PathProgramCache]: Analyzing trace with hash -702648871, now seen corresponding path program 1 times [2024-10-14 01:44:15,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:15,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992272193] [2024-10-14 01:44:15,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:15,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:16,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:16,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992272193] [2024-10-14 01:44:16,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992272193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:44:16,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:44:16,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 01:44:16,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788759845] [2024-10-14 01:44:16,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:44:16,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 01:44:16,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:16,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 01:44:16,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 01:44:16,010 INFO L87 Difference]: Start difference. First operand 80 states and 117 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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) [2024-10-14 01:44:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:16,055 INFO L93 Difference]: Finished difference Result 92 states and 130 transitions. [2024-10-14 01:44:16,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 01:44:16,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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 [2024-10-14 01:44:16,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:16,057 INFO L225 Difference]: With dead ends: 92 [2024-10-14 01:44:16,057 INFO L226 Difference]: Without dead ends: 81 [2024-10-14 01:44:16,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 01:44:16,058 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 5 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:16,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 194 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:44:16,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-14 01:44:16,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2024-10-14 01:44:16,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.486842105263158) internal successors, (113), 76 states have internal predecessors, (113), 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) [2024-10-14 01:44:16,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 113 transitions. [2024-10-14 01:44:16,071 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 113 transitions. Word has length 28 [2024-10-14 01:44:16,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:16,071 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 113 transitions. [2024-10-14 01:44:16,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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) [2024-10-14 01:44:16,072 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 113 transitions. [2024-10-14 01:44:16,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 01:44:16,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:16,072 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:16,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 01:44:16,073 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:16,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:16,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1486366107, now seen corresponding path program 1 times [2024-10-14 01:44:16,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:16,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535880136] [2024-10-14 01:44:16,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:16,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:16,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:16,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:16,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535880136] [2024-10-14 01:44:16,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535880136] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:16,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500337173] [2024-10-14 01:44:16,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:16,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:16,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:16,336 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) [2024-10-14 01:44:16,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 01:44:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:16,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-14 01:44:16,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:16,503 INFO L378 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 [2024-10-14 01:44:16,552 INFO L378 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 [2024-10-14 01:44:16,570 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:44:16,570 INFO L378 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 11 treesize of output 11 [2024-10-14 01:44:16,613 INFO L378 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 27 treesize of output 11 [2024-10-14 01:44:16,634 INFO L378 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 11 [2024-10-14 01:44:16,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:16,650 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:16,668 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_200 (Array Int Int))) (= 2 (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2024-10-14 01:44:16,700 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_197 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (= 2 (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_197) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= v_ArrVal_197 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_197 .cse0))))))) is different from false [2024-10-14 01:44:16,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:16,738 INFO L378 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 70 treesize of output 74 [2024-10-14 01:44:16,744 INFO L378 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 50 treesize of output 46 [2024-10-14 01:44:16,767 INFO L378 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 [2024-10-14 01:44:16,785 INFO L378 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 102 treesize of output 98 [2024-10-14 01:44:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-14 01:44:16,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500337173] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:44:16,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:44:16,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-10-14 01:44:16,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078354019] [2024-10-14 01:44:16,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:16,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 01:44:16,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:16,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 01:44:16,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=69, Unknown=2, NotChecked=34, Total=132 [2024-10-14 01:44:16,868 INFO L87 Difference]: Start difference. First operand 77 states and 113 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:16,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:16,998 INFO L93 Difference]: Finished difference Result 94 states and 132 transitions. [2024-10-14 01:44:16,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 01:44:16,998 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-10-14 01:44:16,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:16,999 INFO L225 Difference]: With dead ends: 94 [2024-10-14 01:44:16,999 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 01:44:16,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=158, Unknown=2, NotChecked=54, Total=272 [2024-10-14 01:44:17,000 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 40 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:17,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 307 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 80 Invalid, 0 Unknown, 75 Unchecked, 0.1s Time] [2024-10-14 01:44:17,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 01:44:17,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2024-10-14 01:44:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 85 states have internal predecessors, (124), 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) [2024-10-14 01:44:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 124 transitions. [2024-10-14 01:44:17,009 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 124 transitions. Word has length 30 [2024-10-14 01:44:17,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:17,009 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 124 transitions. [2024-10-14 01:44:17,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 124 transitions. [2024-10-14 01:44:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 01:44:17,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:17,010 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:17,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 01:44:17,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:17,211 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:17,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:17,212 INFO L85 PathProgramCache]: Analyzing trace with hash -622964443, now seen corresponding path program 1 times [2024-10-14 01:44:17,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:17,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82311054] [2024-10-14 01:44:17,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:17,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:17,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:17,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82311054] [2024-10-14 01:44:17,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82311054] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:17,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678565058] [2024-10-14 01:44:17,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:17,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:17,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:17,407 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) [2024-10-14 01:44:17,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 01:44:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:17,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 01:44:17,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:17,543 INFO L378 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 [2024-10-14 01:44:17,565 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:44:17,565 INFO L378 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 11 treesize of output 11 [2024-10-14 01:44:17,570 INFO L378 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 [2024-10-14 01:44:17,591 INFO L378 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 27 treesize of output 11 [2024-10-14 01:44:17,615 INFO L378 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 11 [2024-10-14 01:44:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:17,626 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:17,633 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_275 (Array Int Int))) (= (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2024-10-14 01:44:17,653 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_273 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (or (not (= v_ArrVal_273 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_273 .cse0))))) (= (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_273) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2024-10-14 01:44:17,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:17,668 INFO L378 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 70 treesize of output 74 [2024-10-14 01:44:17,674 INFO L378 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 50 treesize of output 46 [2024-10-14 01:44:17,709 INFO L378 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 89 treesize of output 85 [2024-10-14 01:44:17,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-14 01:44:17,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678565058] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:44:17,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:44:17,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-10-14 01:44:17,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097687715] [2024-10-14 01:44:17,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:17,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 01:44:17,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:17,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 01:44:17,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=69, Unknown=2, NotChecked=34, Total=132 [2024-10-14 01:44:17,788 INFO L87 Difference]: Start difference. First operand 86 states and 124 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:17,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:17,937 INFO L93 Difference]: Finished difference Result 105 states and 146 transitions. [2024-10-14 01:44:17,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 01:44:17,937 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-10-14 01:44:17,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:17,938 INFO L225 Difference]: With dead ends: 105 [2024-10-14 01:44:17,938 INFO L226 Difference]: Without dead ends: 99 [2024-10-14 01:44:17,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=158, Unknown=2, NotChecked=54, Total=272 [2024-10-14 01:44:17,939 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 27 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:17,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 428 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 126 Invalid, 0 Unknown, 77 Unchecked, 0.1s Time] [2024-10-14 01:44:17,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-14 01:44:17,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2024-10-14 01:44:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 94 states have internal predecessors, (135), 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) [2024-10-14 01:44:17,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2024-10-14 01:44:17,943 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 30 [2024-10-14 01:44:17,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:17,943 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2024-10-14 01:44:17,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:17,943 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2024-10-14 01:44:17,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 01:44:17,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:17,944 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:17,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 01:44:18,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-14 01:44:18,144 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:18,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:18,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1874960896, now seen corresponding path program 1 times [2024-10-14 01:44:18,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:18,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161252069] [2024-10-14 01:44:18,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:18,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:18,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:18,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:18,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161252069] [2024-10-14 01:44:18,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161252069] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:18,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786902340] [2024-10-14 01:44:18,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:18,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:18,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:18,481 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) [2024-10-14 01:44:18,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 01:44:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:18,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-14 01:44:18,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:18,662 INFO L378 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 [2024-10-14 01:44:18,753 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:44:18,753 INFO L378 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 11 treesize of output 11 [2024-10-14 01:44:18,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 01:44:18,805 INFO L378 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 19 treesize of output 1 [2024-10-14 01:44:18,869 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 01:44:18,869 INFO L378 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 80 treesize of output 73 [2024-10-14 01:44:18,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2024-10-14 01:44:18,887 INFO L378 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 40 treesize of output 23 [2024-10-14 01:44:18,951 INFO L378 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 21 [2024-10-14 01:44:18,958 INFO L378 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 23 treesize of output 11 [2024-10-14 01:44:18,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:18,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:19,027 INFO L378 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 79 treesize of output 57 [2024-10-14 01:44:19,037 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_352 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2024-10-14 01:44:19,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:19,095 INFO L378 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 22 treesize of output 23 [2024-10-14 01:44:19,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:19,108 INFO L378 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 36 treesize of output 35 [2024-10-14 01:44:19,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 01:44:19,143 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-10-14 01:44:19,143 INFO L378 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 22 treesize of output 1 [2024-10-14 01:44:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-14 01:44:19,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786902340] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:44:19,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:44:19,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2024-10-14 01:44:19,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674612028] [2024-10-14 01:44:19,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:19,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 01:44:19,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:19,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 01:44:19,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=258, Unknown=1, NotChecked=32, Total=342 [2024-10-14 01:44:19,249 INFO L87 Difference]: Start difference. First operand 95 states and 135 transitions. Second operand has 19 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:19,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:19,492 INFO L93 Difference]: Finished difference Result 107 states and 148 transitions. [2024-10-14 01:44:19,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 01:44:19,493 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-14 01:44:19,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:19,494 INFO L225 Difference]: With dead ends: 107 [2024-10-14 01:44:19,494 INFO L226 Difference]: Without dead ends: 103 [2024-10-14 01:44:19,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=350, Unknown=1, NotChecked=38, Total=462 [2024-10-14 01:44:19,494 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 57 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:19,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 556 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 319 Invalid, 0 Unknown, 84 Unchecked, 0.2s Time] [2024-10-14 01:44:19,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-14 01:44:19,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2024-10-14 01:44:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 98 states have internal predecessors, (140), 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) [2024-10-14 01:44:19,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2024-10-14 01:44:19,499 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 140 transitions. Word has length 32 [2024-10-14 01:44:19,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:19,500 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 140 transitions. [2024-10-14 01:44:19,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:19,500 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 140 transitions. [2024-10-14 01:44:19,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 01:44:19,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:19,501 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:19,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 01:44:19,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:19,706 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:19,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:19,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1407460660, now seen corresponding path program 2 times [2024-10-14 01:44:19,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:19,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019220102] [2024-10-14 01:44:19,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:19,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:20,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:20,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:20,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019220102] [2024-10-14 01:44:20,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019220102] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:20,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625005486] [2024-10-14 01:44:20,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 01:44:20,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:20,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:20,409 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) [2024-10-14 01:44:20,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 01:44:20,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 01:44:20,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:44:20,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-14 01:44:20,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:20,538 INFO L378 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 [2024-10-14 01:44:20,594 INFO L378 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 [2024-10-14 01:44:20,615 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-14 01:44:20,615 INFO L378 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 19 treesize of output 16 [2024-10-14 01:44:20,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 01:44:20,666 INFO L378 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 [2024-10-14 01:44:20,671 INFO L378 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 23 treesize of output 11 [2024-10-14 01:44:20,703 INFO L378 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 11 [2024-10-14 01:44:20,709 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:44:20,709 INFO L378 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 11 treesize of output 11 [2024-10-14 01:44:20,741 INFO L378 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 11 [2024-10-14 01:44:20,775 INFO L378 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 11 [2024-10-14 01:44:20,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:20,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:20,842 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_462 (Array Int Int))) (= (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_462) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2024-10-14 01:44:20,915 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_29| Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_462 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (or (= 2 (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_455) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_460) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_462) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_455 .cse0))) v_ArrVal_455)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0)))) is different from false [2024-10-14 01:44:20,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:20,934 INFO L378 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 130 treesize of output 134 [2024-10-14 01:44:20,938 INFO L378 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 110 treesize of output 106 [2024-10-14 01:44:20,947 INFO L378 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 106 treesize of output 98 [2024-10-14 01:44:21,011 INFO L378 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 195 treesize of output 189 [2024-10-14 01:44:21,293 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-10-14 01:44:21,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625005486] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:44:21,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:44:21,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 26 [2024-10-14 01:44:21,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111043791] [2024-10-14 01:44:21,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:21,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 01:44:21,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:21,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 01:44:21,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=459, Unknown=11, NotChecked=90, Total=650 [2024-10-14 01:44:21,295 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. Second operand has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 26 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) [2024-10-14 01:44:25,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:25,542 INFO L93 Difference]: Finished difference Result 112 states and 155 transitions. [2024-10-14 01:44:25,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 01:44:25,543 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 26 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 34 [2024-10-14 01:44:25,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:25,543 INFO L225 Difference]: With dead ends: 112 [2024-10-14 01:44:25,544 INFO L226 Difference]: Without dead ends: 108 [2024-10-14 01:44:25,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=111, Invalid=535, Unknown=12, NotChecked=98, Total=756 [2024-10-14 01:44:25,544 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 50 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:25,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 571 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 277 Invalid, 0 Unknown, 147 Unchecked, 0.2s Time] [2024-10-14 01:44:25,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-14 01:44:25,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2024-10-14 01:44:25,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 103 states have internal predecessors, (146), 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) [2024-10-14 01:44:25,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2024-10-14 01:44:25,549 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 34 [2024-10-14 01:44:25,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:25,549 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2024-10-14 01:44:25,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 26 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) [2024-10-14 01:44:25,549 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2024-10-14 01:44:25,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 01:44:25,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:25,550 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:25,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 01:44:25,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:25,755 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:25,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:25,755 INFO L85 PathProgramCache]: Analyzing trace with hash -2000163109, now seen corresponding path program 2 times [2024-10-14 01:44:25,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:25,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347570224] [2024-10-14 01:44:25,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:25,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:26,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:26,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347570224] [2024-10-14 01:44:26,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347570224] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:26,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276371618] [2024-10-14 01:44:26,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 01:44:26,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:26,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:26,075 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) [2024-10-14 01:44:26,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 01:44:26,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 01:44:26,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:44:26,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-14 01:44:26,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:26,176 INFO L378 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 [2024-10-14 01:44:26,209 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:44:26,209 INFO L378 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 11 treesize of output 11 [2024-10-14 01:44:26,224 INFO L378 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 15 treesize of output 1 [2024-10-14 01:44:26,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 01:44:26,258 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 01:44:26,259 INFO L378 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 64 treesize of output 57 [2024-10-14 01:44:26,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-10-14 01:44:26,266 INFO L378 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 32 treesize of output 19 [2024-10-14 01:44:26,299 INFO L378 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 31 treesize of output 19 [2024-10-14 01:44:26,302 INFO L378 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 19 treesize of output 11 [2024-10-14 01:44:26,306 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:26,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:26,343 INFO L378 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 52 treesize of output 30 [2024-10-14 01:44:26,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:26,382 INFO L378 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 22 treesize of output 23 [2024-10-14 01:44:26,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:26,387 INFO L378 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 36 treesize of output 35 [2024-10-14 01:44:26,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 01:44:26,399 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-10-14 01:44:26,399 INFO L378 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 22 treesize of output 1 [2024-10-14 01:44:26,480 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:26,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276371618] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:44:26,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:44:26,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2024-10-14 01:44:26,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675263018] [2024-10-14 01:44:26,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:26,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 01:44:26,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:26,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 01:44:26,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=257, Unknown=4, NotChecked=0, Total=306 [2024-10-14 01:44:26,481 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 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) [2024-10-14 01:44:26,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:26,964 INFO L93 Difference]: Finished difference Result 120 states and 163 transitions. [2024-10-14 01:44:26,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 01:44:26,965 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 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 34 [2024-10-14 01:44:26,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:26,966 INFO L225 Difference]: With dead ends: 120 [2024-10-14 01:44:26,966 INFO L226 Difference]: Without dead ends: 110 [2024-10-14 01:44:26,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=458, Unknown=4, NotChecked=0, Total=552 [2024-10-14 01:44:26,966 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 65 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:26,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 539 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 01:44:26,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-14 01:44:26,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2024-10-14 01:44:26,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.42) internal successors, (142), 100 states have internal predecessors, (142), 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) [2024-10-14 01:44:26,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 142 transitions. [2024-10-14 01:44:26,977 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 142 transitions. Word has length 34 [2024-10-14 01:44:26,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:26,977 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 142 transitions. [2024-10-14 01:44:26,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 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) [2024-10-14 01:44:26,978 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 142 transitions. [2024-10-14 01:44:26,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 01:44:26,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:26,978 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:27,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 01:44:27,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-14 01:44:27,179 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:27,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:27,179 INFO L85 PathProgramCache]: Analyzing trace with hash 216589019, now seen corresponding path program 1 times [2024-10-14 01:44:27,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:27,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97367116] [2024-10-14 01:44:27,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:27,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:44:27,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:27,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97367116] [2024-10-14 01:44:27,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97367116] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:27,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516488880] [2024-10-14 01:44:27,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:27,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:27,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:27,465 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) [2024-10-14 01:44:27,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 01:44:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:27,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-14 01:44:27,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:27,566 INFO L378 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 [2024-10-14 01:44:27,588 INFO L378 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 [2024-10-14 01:44:27,596 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:44:27,597 INFO L378 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 11 treesize of output 11 [2024-10-14 01:44:27,608 INFO L378 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 27 treesize of output 11 [2024-10-14 01:44:27,621 INFO L378 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 11 [2024-10-14 01:44:27,625 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:44:27,625 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:27,659 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_614 (Array Int Int)) (v_ArrVal_616 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_614) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_616) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (not (= v_ArrVal_614 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_614 .cse0))))))) is different from false [2024-10-14 01:44:27,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:27,672 INFO L378 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 75 treesize of output 79 [2024-10-14 01:44:27,676 INFO L378 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 54 treesize of output 50 [2024-10-14 01:44:27,698 INFO L378 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 [2024-10-14 01:44:27,703 INFO L378 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 96 treesize of output 92 [2024-10-14 01:44:27,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 01:44:27,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516488880] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:44:27,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:44:27,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-10-14 01:44:27,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596820937] [2024-10-14 01:44:27,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:27,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 01:44:27,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:27,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 01:44:27,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=123, Unknown=2, NotChecked=22, Total=182 [2024-10-14 01:44:27,762 INFO L87 Difference]: Start difference. First operand 101 states and 142 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:27,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:27,882 INFO L93 Difference]: Finished difference Result 116 states and 158 transitions. [2024-10-14 01:44:27,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 01:44:27,883 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-14 01:44:27,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:27,884 INFO L225 Difference]: With dead ends: 116 [2024-10-14 01:44:27,884 INFO L226 Difference]: Without dead ends: 103 [2024-10-14 01:44:27,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=235, Unknown=2, NotChecked=32, Total=342 [2024-10-14 01:44:27,884 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 37 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:27,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 361 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 103 Invalid, 0 Unknown, 34 Unchecked, 0.1s Time] [2024-10-14 01:44:27,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-14 01:44:27,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2024-10-14 01:44:27,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.41) internal successors, (141), 100 states have internal predecessors, (141), 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) [2024-10-14 01:44:27,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2024-10-14 01:44:27,889 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 34 [2024-10-14 01:44:27,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:27,889 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2024-10-14 01:44:27,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:27,890 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2024-10-14 01:44:27,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 01:44:27,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:27,891 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:27,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 01:44:28,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:28,093 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:28,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:28,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1107758708, now seen corresponding path program 1 times [2024-10-14 01:44:28,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:28,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315535380] [2024-10-14 01:44:28,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:28,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:28,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:28,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:28,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315535380] [2024-10-14 01:44:28,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315535380] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:28,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979194425] [2024-10-14 01:44:28,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:28,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:28,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:28,384 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) [2024-10-14 01:44:28,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 01:44:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:28,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-14 01:44:28,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:28,530 INFO L378 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 [2024-10-14 01:44:28,533 INFO L378 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 [2024-10-14 01:44:28,575 INFO L378 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 23 treesize of output 11 [2024-10-14 01:44:28,621 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:44:28,622 INFO L378 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 11 treesize of output 11 [2024-10-14 01:44:28,636 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-14 01:44:28,636 INFO L378 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 1 case distinctions, treesize of input 19 treesize of output 22 [2024-10-14 01:44:28,694 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 01:44:28,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2024-10-14 01:44:28,863 INFO L349 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2024-10-14 01:44:28,864 INFO L378 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 50 [2024-10-14 01:44:29,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:29,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:31,291 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:44:31,298 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:44:31,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:31,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 556 treesize of output 574 [2024-10-14 01:44:31,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-14 01:44:31,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:31,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-10-14 01:44:31,794 INFO L349 Elim1Store]: treesize reduction 26, result has 53.6 percent of original size [2024-10-14 01:44:31,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 91 [2024-10-14 01:44:31,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:31,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2024-10-14 01:44:31,963 INFO L378 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 37 treesize of output 29 [2024-10-14 01:44:32,117 INFO L349 Elim1Store]: treesize reduction 179, result has 30.4 percent of original size [2024-10-14 01:44:32,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 572 treesize of output 633 [2024-10-14 01:44:32,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:44:32,283 INFO L349 Elim1Store]: treesize reduction 142, result has 19.3 percent of original size [2024-10-14 01:44:32,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 57 [2024-10-14 01:44:32,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:44:32,443 INFO L349 Elim1Store]: treesize reduction 142, result has 19.3 percent of original size [2024-10-14 01:44:32,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 57 [2024-10-14 01:44:32,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:44:32,578 INFO L349 Elim1Store]: treesize reduction 142, result has 19.3 percent of original size [2024-10-14 01:44:32,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 57 [2024-10-14 01:44:33,413 INFO L378 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 15 treesize of output 11 [2024-10-14 01:44:33,437 INFO L378 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 15 treesize of output 11 [2024-10-14 01:44:33,446 INFO L378 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 15 treesize of output 11 [2024-10-14 01:44:33,449 INFO L378 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 15 treesize of output 11 [2024-10-14 01:44:33,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:33,475 INFO L378 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 112 treesize of output 136 [2024-10-14 01:44:33,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:33,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979194425] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:44:33,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:44:33,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 33 [2024-10-14 01:44:33,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683495650] [2024-10-14 01:44:33,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:33,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-14 01:44:33,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:33,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-14 01:44:33,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=872, Unknown=11, NotChecked=0, Total=1056 [2024-10-14 01:44:33,624 INFO L87 Difference]: Start difference. First operand 101 states and 141 transitions. Second operand has 33 states, 33 states have (on average 2.272727272727273) internal successors, (75), 33 states have internal predecessors, (75), 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) [2024-10-14 01:44:38,243 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (forall ((v_ArrVal_722 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_40| Int) (v_ArrVal_717 (Array Int Int))) (let ((.cse4 (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_717))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_722))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= v_ArrVal_717 (store .cse0 .cse1 (select v_ArrVal_717 .cse1)))) (= (select (select (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_40| (store (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_40|) 0 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_40|) 0)) (= .cse3 2) (= .cse3 1) (not (= v_ArrVal_722 (let ((.cse5 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (store (store (select .cse4 |c_ULTIMATE.start_main_~t~0#1.base|) |c_ULTIMATE.start_main_~t~0#1.offset| 2) .cse5 (select v_ArrVal_722 .cse5)))))))))) (forall ((v_ArrVal_722 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_40| Int)) (let ((.cse7 (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_722))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 2 .cse6) (not (= v_ArrVal_722 (store (store .cse0 |c_ULTIMATE.start_main_~p~0#1.offset| 2) .cse1 (select v_ArrVal_722 .cse1)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_40|) 0)) (= .cse6 1) (= (select (select (store .cse7 |v_ULTIMATE.start_main_~t~0#1.base_40| (store (select .cse7 |v_ULTIMATE.start_main_~t~0#1.base_40|) 0 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3))))) (forall ((v_ArrVal_722 (Array Int Int))) (let ((.cse9 (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_722))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 2 .cse8) (= (select (select (store .cse9 |c_ULTIMATE.start_main_~t~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~t~0#1.base|) |c_ULTIMATE.start_main_~t~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (not (= v_ArrVal_722 (store .cse0 .cse1 (select v_ArrVal_722 .cse1)))) (= .cse8 1))))) (let ((.cse10 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 3 (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= .cse10 1) (= .cse10 2))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (let ((.cse11 (select .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|))) (or (= .cse11 2) (= .cse11 3))))) is different from false [2024-10-14 01:44:38,662 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (let ((.cse0 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse0) (and (not .cse0) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (forall ((v_ArrVal_722 (Array Int Int))) (let ((.cse2 (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_722))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= 2 .cse1) (= (select (select (store .cse2 |c_ULTIMATE.start_main_~t~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~t~0#1.base|) |c_ULTIMATE.start_main_~t~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (not (= v_ArrVal_722 (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 (select v_ArrVal_722 .cse3))))) (= .cse1 1))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2024-10-14 01:44:49,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-14 01:44:55,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-14 01:44:56,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-14 01:44:57,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:57,249 INFO L93 Difference]: Finished difference Result 165 states and 218 transitions. [2024-10-14 01:44:57,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-14 01:44:57,250 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.272727272727273) internal successors, (75), 33 states have internal predecessors, (75), 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 34 [2024-10-14 01:44:57,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:57,250 INFO L225 Difference]: With dead ends: 165 [2024-10-14 01:44:57,250 INFO L226 Difference]: Without dead ends: 154 [2024-10-14 01:44:57,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=460, Invalid=2391, Unknown=19, NotChecked=210, Total=3080 [2024-10-14 01:44:57,252 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 83 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 38 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:57,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 728 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 475 Invalid, 24 Unknown, 62 Unchecked, 12.6s Time] [2024-10-14 01:44:57,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-14 01:44:57,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2024-10-14 01:44:57,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.3865546218487395) internal successors, (165), 119 states have internal predecessors, (165), 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) [2024-10-14 01:44:57,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 165 transitions. [2024-10-14 01:44:57,257 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 165 transitions. Word has length 34 [2024-10-14 01:44:57,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:57,258 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 165 transitions. [2024-10-14 01:44:57,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.272727272727273) internal successors, (75), 33 states have internal predecessors, (75), 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) [2024-10-14 01:44:57,258 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 165 transitions. [2024-10-14 01:44:57,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 01:44:57,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:57,259 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:57,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 01:44:57,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:57,464 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:57,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:57,465 INFO L85 PathProgramCache]: Analyzing trace with hash 516290971, now seen corresponding path program 1 times [2024-10-14 01:44:57,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:57,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869211511] [2024-10-14 01:44:57,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:57,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:57,831 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:57,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:57,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869211511] [2024-10-14 01:44:57,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869211511] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:57,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583404426] [2024-10-14 01:44:57,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:57,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:57,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:57,833 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) [2024-10-14 01:44:57,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 01:44:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:57,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-14 01:44:57,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:57,938 INFO L378 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 [2024-10-14 01:44:58,006 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:44:58,007 INFO L378 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 11 treesize of output 11 [2024-10-14 01:44:58,047 INFO L378 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 19 treesize of output 1 [2024-10-14 01:44:58,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 01:44:58,133 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 01:44:58,133 INFO L378 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 80 treesize of output 73 [2024-10-14 01:44:58,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2024-10-14 01:44:58,142 INFO L378 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 40 treesize of output 23 [2024-10-14 01:44:58,183 INFO L378 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 21 [2024-10-14 01:44:58,188 INFO L378 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 23 treesize of output 11 [2024-10-14 01:44:58,195 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:58,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:58,280 INFO L378 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 52 treesize of output 30 [2024-10-14 01:44:58,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:58,387 INFO L378 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 22 treesize of output 23 [2024-10-14 01:44:58,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:58,400 INFO L378 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 36 treesize of output 35 [2024-10-14 01:44:58,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 01:44:58,420 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-10-14 01:44:58,421 INFO L378 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 22 treesize of output 1 [2024-10-14 01:44:58,539 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:58,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583404426] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:44:58,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:44:58,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2024-10-14 01:44:58,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468717207] [2024-10-14 01:44:58,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:58,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 01:44:58,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:58,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 01:44:58,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=355, Unknown=6, NotChecked=0, Total=420 [2024-10-14 01:44:58,541 INFO L87 Difference]: Start difference. First operand 120 states and 165 transitions. Second operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:59,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:59,018 INFO L93 Difference]: Finished difference Result 132 states and 178 transitions. [2024-10-14 01:44:59,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 01:44:59,018 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-14 01:44:59,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:59,019 INFO L225 Difference]: With dead ends: 132 [2024-10-14 01:44:59,019 INFO L226 Difference]: Without dead ends: 119 [2024-10-14 01:44:59,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=632, Unknown=6, NotChecked=0, Total=756 [2024-10-14 01:44:59,020 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 87 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:59,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 417 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 01:44:59,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-14 01:44:59,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2024-10-14 01:44:59,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.3879310344827587) internal successors, (161), 116 states have internal predecessors, (161), 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) [2024-10-14 01:44:59,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 161 transitions. [2024-10-14 01:44:59,025 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 161 transitions. Word has length 34 [2024-10-14 01:44:59,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:59,025 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 161 transitions. [2024-10-14 01:44:59,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:59,025 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 161 transitions. [2024-10-14 01:44:59,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 01:44:59,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:59,026 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:59,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 01:44:59,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-14 01:44:59,227 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:59,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:59,227 INFO L85 PathProgramCache]: Analyzing trace with hash -244357044, now seen corresponding path program 2 times [2024-10-14 01:44:59,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:59,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722121366] [2024-10-14 01:44:59,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:59,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:59,636 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:44:59,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:59,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722121366] [2024-10-14 01:44:59,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722121366] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:59,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755001001] [2024-10-14 01:44:59,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 01:44:59,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:59,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:59,642 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) [2024-10-14 01:44:59,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 01:44:59,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 01:44:59,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:44:59,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-14 01:44:59,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:59,790 INFO L378 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 [2024-10-14 01:44:59,840 INFO L378 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 [2024-10-14 01:44:59,873 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-14 01:44:59,874 INFO L378 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 19 treesize of output 16 [2024-10-14 01:44:59,968 INFO L378 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 23 treesize of output 11 [2024-10-14 01:45:00,044 INFO L378 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 11 [2024-10-14 01:45:00,069 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:45:00,069 INFO L378 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 11 treesize of output 11 [2024-10-14 01:45:00,152 INFO L378 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 16 treesize of output 11 [2024-10-14 01:45:00,198 INFO L378 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 11 [2024-10-14 01:45:00,253 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:45:00,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:45:00,310 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_911 (Array Int Int))) (= (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_911) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2024-10-14 01:45:00,483 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_911 (Array Int Int)) (v_ArrVal_906 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_48| Int) (v_ArrVal_909 (Array Int Int))) (or (not (= v_ArrVal_906 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_906 .cse0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_48|) 0)) (= (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_906) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_909) |v_ULTIMATE.start_main_~t~0#1.base_48| v_ArrVal_911) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2024-10-14 01:45:00,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:00,517 INFO L378 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 252 treesize of output 254 [2024-10-14 01:45:00,538 INFO L378 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 110 treesize of output 102 [2024-10-14 01:45:00,569 INFO L378 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 50 treesize of output 46 [2024-10-14 01:45:00,721 INFO L378 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 143 treesize of output 137 [2024-10-14 01:45:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-10-14 01:45:03,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755001001] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:45:03,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:45:03,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 25 [2024-10-14 01:45:03,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599407352] [2024-10-14 01:45:03,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:45:03,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 01:45:03,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:45:03,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 01:45:03,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=411, Unknown=16, NotChecked=86, Total=600 [2024-10-14 01:45:03,100 INFO L87 Difference]: Start difference. First operand 117 states and 161 transitions. Second operand has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 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) [2024-10-14 01:45:03,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:45:03,491 INFO L93 Difference]: Finished difference Result 130 states and 176 transitions. [2024-10-14 01:45:03,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 01:45:03,492 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 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 34 [2024-10-14 01:45:03,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:45:03,493 INFO L225 Difference]: With dead ends: 130 [2024-10-14 01:45:03,493 INFO L226 Difference]: Without dead ends: 122 [2024-10-14 01:45:03,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=112, Invalid=480, Unknown=16, NotChecked=94, Total=702 [2024-10-14 01:45:03,494 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 34 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 01:45:03,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 681 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 247 Invalid, 0 Unknown, 73 Unchecked, 0.3s Time] [2024-10-14 01:45:03,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-14 01:45:03,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 98. [2024-10-14 01:45:03,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.4123711340206186) internal successors, (137), 97 states have internal predecessors, (137), 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) [2024-10-14 01:45:03,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 137 transitions. [2024-10-14 01:45:03,497 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 137 transitions. Word has length 34 [2024-10-14 01:45:03,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:45:03,498 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 137 transitions. [2024-10-14 01:45:03,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 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) [2024-10-14 01:45:03,498 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2024-10-14 01:45:03,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 01:45:03,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:45:03,498 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:45:03,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-14 01:45:03,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 01:45:03,703 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:45:03,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:45:03,703 INFO L85 PathProgramCache]: Analyzing trace with hash 393684135, now seen corresponding path program 3 times [2024-10-14 01:45:03,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:45:03,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772279522] [2024-10-14 01:45:03,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:45:03,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:45:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:45:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:45:04,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:45:04,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772279522] [2024-10-14 01:45:04,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772279522] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:45:04,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018290304] [2024-10-14 01:45:04,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 01:45:04,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:45:04,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:45:04,425 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) [2024-10-14 01:45:04,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 01:45:04,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-14 01:45:04,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:45:04,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-10-14 01:45:04,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:45:04,577 INFO L378 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 [2024-10-14 01:45:04,674 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:45:04,675 INFO L378 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 11 treesize of output 11 [2024-10-14 01:45:04,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 01:45:04,771 INFO L378 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 [2024-10-14 01:45:04,923 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-14 01:45:04,923 INFO L378 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 1 case distinctions, treesize of input 24 treesize of output 17 [2024-10-14 01:45:04,938 INFO L378 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 [2024-10-14 01:45:04,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:04,949 INFO L378 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 11 [2024-10-14 01:45:05,135 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 01:45:05,135 INFO L378 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 93 treesize of output 80 [2024-10-14 01:45:05,148 INFO L378 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 39 treesize of output 15 [2024-10-14 01:45:05,168 INFO L378 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 27 treesize of output 22 [2024-10-14 01:45:05,352 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 01:45:05,354 INFO L378 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 1 case distinctions, treesize of input 39 treesize of output 34 [2024-10-14 01:45:05,424 INFO L349 Elim1Store]: treesize reduction 28, result has 45.1 percent of original size [2024-10-14 01:45:05,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 33 [2024-10-14 01:45:05,455 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-10-14 01:45:05,455 INFO L378 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 1 case distinctions, treesize of input 21 treesize of output 26 [2024-10-14 01:45:05,486 INFO L378 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 37 treesize of output 27 [2024-10-14 01:45:05,892 INFO L378 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 73 treesize of output 53 [2024-10-14 01:45:05,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 37 [2024-10-14 01:45:06,189 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:45:06,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:45:06,617 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1023 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1018)) (.cse4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1020) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_1024) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (.cse2 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse4 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_1023) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) (.cse3 (store .cse0 |v_ULTIMATE.start_main_~p~0#1.base_95| (store (select .cse0 |v_ULTIMATE.start_main_~p~0#1.base_95|) |c_ULTIMATE.start_main_~t~0#1.offset| 3)))) (or (= 2 (select (select .cse0 .cse1) .cse2)) (= 3 (select (select .cse3 .cse1) .cse2)) (not (= v_ArrVal_1018 (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base|) .cse4 (select v_ArrVal_1018 .cse4)))) (not (= (select (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))))) is different from false [2024-10-14 01:45:06,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:06,699 INFO L378 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 753 treesize of output 779 [2024-10-14 01:45:06,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:06,717 INFO L378 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 479 treesize of output 437 [2024-10-14 01:45:06,803 INFO L378 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 [2024-10-14 01:45:06,811 INFO L378 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 [2024-10-14 01:45:06,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-14 01:45:07,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2024-10-14 01:45:07,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:07,320 INFO L378 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 81 treesize of output 71 [2024-10-14 01:45:07,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:07,421 INFO L378 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 65 treesize of output 55 [2024-10-14 01:45:07,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:07,521 INFO L378 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 255 treesize of output 231 [2024-10-14 01:45:07,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:07,698 INFO L378 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 3431 treesize of output 3209 [2024-10-14 01:45:09,178 INFO L378 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 112 treesize of output 96 [2024-10-14 01:45:09,182 INFO L378 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 92 treesize of output 84 [2024-10-14 01:45:09,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2024-10-14 01:45:09,190 INFO L378 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 80 treesize of output 76 [2024-10-14 01:45:09,193 INFO L378 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 76 treesize of output 68 [2024-10-14 01:45:09,197 INFO L378 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 68 treesize of output 64 [2024-10-14 01:45:09,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-14 01:45:09,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-14 01:45:09,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-14 01:45:09,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-14 01:45:09,464 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse2 (forall ((v_arrayElimArr_10 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1020) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_1024) |c_ULTIMATE.start_main_~a~0#1.base|) 4) |v_ULTIMATE.start_main_~p~0#1.base_95|)) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_1023 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_10) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_1023) |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (or (= .cse15 |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse15 0)))))) (not (= (select v_arrayElimArr_10 .cse1) 0))))) (.cse3 (forall ((v_arrayElimArr_10 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_1023 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_10) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_1023) |c_ULTIMATE.start_main_~a~0#1.base|) 4) 0)) (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1020) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_1024) |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (or (= .cse14 |v_ULTIMATE.start_main_~p~0#1.base_95|) (= .cse14 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|))) (not (= (select v_arrayElimArr_10 .cse1) 0))))) (.cse6 (= .cse1 0)) (.cse11 (not .cse5)) (.cse7 (forall ((v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1023 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_10) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_1023) |c_ULTIMATE.start_main_~a~0#1.base|) 4) 0) (not (= (select v_arrayElimArr_10 .cse1) 0)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1020) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_1024) |c_ULTIMATE.start_main_~a~0#1.base|) 4) |c_ULTIMATE.start_main_~p~0#1.base|))))) (and (or (and (forall ((v_arrayElimArr_10 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_1023 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_10) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_1023) |c_ULTIMATE.start_main_~a~0#1.base|) 4) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1020) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_1024) |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (or (= .cse0 |v_ULTIMATE.start_main_~p~0#1.base_95|) (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)))))) (not (= (select v_arrayElimArr_10 .cse1) 0)))) .cse2 .cse3 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1020) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_1024) |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (or (= .cse4 |v_ULTIMATE.start_main_~p~0#1.base_95|) (= .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse4 |c_ULTIMATE.start_main_~p~0#1.base|))))) .cse5) (or .cse6 (and .cse2 .cse3)) (or .cse6 .cse7) (or (let ((.cse8 (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse10 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1020) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_1024) |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (or (= .cse10 |v_ULTIMATE.start_main_~p~0#1.base_95|) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse10 |c_ULTIMATE.start_main_~p~0#1.base|)))))) (and (or .cse6 (and (forall ((v_arrayElimArr_10 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1020) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_1024) |c_ULTIMATE.start_main_~a~0#1.base|) 4) |v_ULTIMATE.start_main_~p~0#1.base_95|)) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_1023 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_10) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_1023) |c_ULTIMATE.start_main_~a~0#1.base|) 4) .cse1))))) (not (= (select v_arrayElimArr_10 .cse1) 0)))) .cse8)) (or (not (= |c_ULTIMATE.start_main_~p~0#1.offset| 0)) .cse8) (or (and (forall ((v_arrayElimArr_10 (Array Int Int))) (or (not (= (select v_arrayElimArr_10 0) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int)) (or (forall ((v_ArrVal_1023 (Array Int Int))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_10) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_1023) |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (or (= .cse9 0) (= (+ .cse9 4) 0)))) (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1020) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_1024) |c_ULTIMATE.start_main_~a~0#1.base|) 4) |v_ULTIMATE.start_main_~p~0#1.base_95|)) (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|))))) .cse8) (not .cse6)))) .cse11) (or .cse11 .cse7) (forall ((v_arrayElimArr_10 (Array Int Int))) (or (not (= (select v_arrayElimArr_10 .cse1) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_95| Int) (v_ArrVal_1023 (Array Int Int))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_95| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1020) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_1024) |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (or (= .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse12 |c_ULTIMATE.start_main_~p~0#1.base|)))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_10) |v_ULTIMATE.start_main_~p~0#1.base_95| v_ArrVal_1023) |c_ULTIMATE.start_main_~a~0#1.base|) 4) 0))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (forall ((v_ArrVal_1023 (Array Int Int))) (let ((.cse13 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1023) |c_ULTIMATE.start_main_~a~0#1.base|) 4))) (or (= .cse13 0) (= .cse13 |c_ULTIMATE.start_main_~p~0#1.offset|)))) .cse5 (forall ((v_ArrVal_1024 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1024) |c_ULTIMATE.start_main_~a~0#1.base|) 4) |c_ULTIMATE.start_main_~p~0#1.base|))))))) is different from false [2024-10-14 01:45:09,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:09,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-10-14 01:45:09,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:09,924 INFO L378 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 23 treesize of output 24 [2024-10-14 01:45:09,930 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:09,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:09,947 INFO L378 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 32 treesize of output 33 [2024-10-14 01:45:09,952 INFO L378 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 [2024-10-14 01:45:09,962 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:09,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:09,973 INFO L378 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 32 treesize of output 33 [2024-10-14 01:45:09,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:09,996 INFO L378 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 18 treesize of output 20 [2024-10-14 01:45:10,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:10,018 INFO L378 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 47 treesize of output 37 [2024-10-14 01:45:10,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:10,022 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:10,024 INFO L378 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 15 [2024-10-14 01:45:10,027 INFO L378 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 [2024-10-14 01:45:10,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:10,035 INFO L378 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 49 treesize of output 41 [2024-10-14 01:45:10,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:10,042 INFO L378 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 23 treesize of output 24 [2024-10-14 01:45:10,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:10,045 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:10,047 INFO L378 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 25 treesize of output 19 [2024-10-14 01:45:10,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:10,050 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:10,051 INFO L378 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 10 [2024-10-14 01:45:10,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:10,062 INFO L378 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 23 treesize of output 24 [2024-10-14 01:45:10,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:10,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 37 [2024-10-14 01:45:10,071 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:10,072 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:10,079 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-14 01:45:10,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 8 [2024-10-14 01:45:10,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-14 01:45:10,084 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:10,085 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:10,099 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-14 01:45:10,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 18 [2024-10-14 01:45:10,109 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 01:45:10,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:45:10,111 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:10,113 INFO L378 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 8 treesize of output 4 [2024-10-14 01:45:10,118 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 01:45:10,118 INFO L378 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 37 treesize of output 1 [2024-10-14 01:45:10,125 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-14 01:45:10,132 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 01:45:10,132 INFO L378 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 43 treesize of output 1 [2024-10-14 01:45:10,140 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 01:45:10,140 INFO L378 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 21 treesize of output 1 [2024-10-14 01:45:10,146 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 01:45:10,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 1 [2024-10-14 01:45:10,150 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-14 01:45:10,157 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 01:45:10,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 1 [2024-10-14 01:45:10,397 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-10-14 01:45:10,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018290304] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:45:10,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:45:10,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 34 [2024-10-14 01:45:10,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265890052] [2024-10-14 01:45:10,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:45:10,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-14 01:45:10,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:45:10,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-14 01:45:10,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=893, Unknown=2, NotChecked=122, Total=1122 [2024-10-14 01:45:10,398 INFO L87 Difference]: Start difference. First operand 98 states and 137 transitions. Second operand has 34 states, 34 states have (on average 2.411764705882353) internal successors, (82), 34 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) [2024-10-14 01:45:12,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:45:12,048 INFO L93 Difference]: Finished difference Result 126 states and 168 transitions. [2024-10-14 01:45:12,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 01:45:12,048 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.411764705882353) internal successors, (82), 34 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 [2024-10-14 01:45:12,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:45:12,049 INFO L225 Difference]: With dead ends: 126 [2024-10-14 01:45:12,049 INFO L226 Difference]: Without dead ends: 122 [2024-10-14 01:45:12,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=218, Invalid=1768, Unknown=2, NotChecked=174, Total=2162 [2024-10-14 01:45:12,052 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 99 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 01:45:12,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 884 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 521 Invalid, 0 Unknown, 168 Unchecked, 0.7s Time] [2024-10-14 01:45:12,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-14 01:45:12,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2024-10-14 01:45:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.3962264150943395) internal successors, (148), 106 states have internal predecessors, (148), 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) [2024-10-14 01:45:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 148 transitions. [2024-10-14 01:45:12,059 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 148 transitions. Word has length 36 [2024-10-14 01:45:12,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:45:12,060 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 148 transitions. [2024-10-14 01:45:12,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.411764705882353) internal successors, (82), 34 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) [2024-10-14 01:45:12,060 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 148 transitions. [2024-10-14 01:45:12,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 01:45:12,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:45:12,060 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:45:12,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-14 01:45:12,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-14 01:45:12,265 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:45:12,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:45:12,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1418387111, now seen corresponding path program 2 times [2024-10-14 01:45:12,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:45:12,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181121343] [2024-10-14 01:45:12,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:45:12,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:45:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:45:12,616 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:45:12,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:45:12,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181121343] [2024-10-14 01:45:12,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181121343] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:45:12,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769284030] [2024-10-14 01:45:12,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 01:45:12,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:45:12,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:45:12,618 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) [2024-10-14 01:45:12,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 01:45:12,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 01:45:12,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:45:12,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-14 01:45:12,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:45:12,845 INFO L378 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 [2024-10-14 01:45:12,893 INFO L378 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 23 treesize of output 11 [2024-10-14 01:45:12,938 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-14 01:45:12,938 INFO L378 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 1 case distinctions, treesize of input 19 treesize of output 18 [2024-10-14 01:45:12,993 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 01:45:12,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-10-14 01:45:13,049 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-14 01:45:13,050 INFO L378 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 1 case distinctions, treesize of input 19 treesize of output 22 [2024-10-14 01:45:13,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:13,095 INFO L378 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 31 treesize of output 23 [2024-10-14 01:45:13,103 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 01:45:13,103 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:45:13,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:13,503 INFO L378 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 2349 treesize of output 2329 [2024-10-14 01:45:13,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:13,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-10-14 01:45:14,991 INFO L378 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 72 treesize of output 68 [2024-10-14 01:45:15,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:15,012 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:15,017 INFO L378 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 133 treesize of output 129 [2024-10-14 01:45:15,033 INFO L378 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 [2024-10-14 01:45:15,051 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:15,053 INFO L378 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 15 treesize of output 13 [2024-10-14 01:45:15,064 INFO L378 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 38 treesize of output 36 [2024-10-14 01:45:15,085 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:15,088 INFO L378 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 15 treesize of output 13 [2024-10-14 01:45:15,094 INFO L378 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 [2024-10-14 01:45:15,104 INFO L378 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 44 treesize of output 42 [2024-10-14 01:45:15,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:15,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:15,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:15,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:15,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:15,142 INFO L378 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 [2024-10-14 01:45:15,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:15,155 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:15,155 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:15,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:15,159 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:15,159 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:15,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:15,168 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:15,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:15,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:15,175 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:15,175 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:15,250 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:45:15,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769284030] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:45:15,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:45:15,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2024-10-14 01:45:15,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305615701] [2024-10-14 01:45:15,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:45:15,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 01:45:15,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:45:15,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 01:45:15,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=473, Unknown=12, NotChecked=0, Total=600 [2024-10-14 01:45:15,252 INFO L87 Difference]: Start difference. First operand 107 states and 148 transitions. Second operand has 25 states, 25 states have (on average 3.0) internal successors, (75), 25 states have internal predecessors, (75), 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) [2024-10-14 01:45:15,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:45:15,790 INFO L93 Difference]: Finished difference Result 117 states and 159 transitions. [2024-10-14 01:45:15,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 01:45:15,791 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.0) internal successors, (75), 25 states have internal predecessors, (75), 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 [2024-10-14 01:45:15,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:45:15,791 INFO L225 Difference]: With dead ends: 117 [2024-10-14 01:45:15,792 INFO L226 Difference]: Without dead ends: 109 [2024-10-14 01:45:15,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=209, Invalid=771, Unknown=12, NotChecked=0, Total=992 [2024-10-14 01:45:15,792 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 59 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 01:45:15,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 463 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 01:45:15,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-14 01:45:15,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2024-10-14 01:45:15,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 106 states have internal predecessors, (146), 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) [2024-10-14 01:45:15,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 146 transitions. [2024-10-14 01:45:15,797 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 146 transitions. Word has length 36 [2024-10-14 01:45:15,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:45:15,797 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 146 transitions. [2024-10-14 01:45:15,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.0) internal successors, (75), 25 states have internal predecessors, (75), 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) [2024-10-14 01:45:15,798 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 146 transitions. [2024-10-14 01:45:15,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 01:45:15,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:45:15,798 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:45:15,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-14 01:45:15,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-14 01:45:15,999 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:45:15,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:45:15,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1669154151, now seen corresponding path program 1 times [2024-10-14 01:45:15,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:45:15,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809670875] [2024-10-14 01:45:15,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:45:15,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:45:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:45:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:45:16,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:45:16,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809670875] [2024-10-14 01:45:16,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809670875] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:45:16,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89672870] [2024-10-14 01:45:16,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:45:16,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:45:16,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:45:16,695 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:45:16,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-14 01:45:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:45:16,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-10-14 01:45:16,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:45:16,840 INFO L378 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 [2024-10-14 01:45:16,894 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 01:45:16,894 INFO L378 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 12 treesize of output 14 [2024-10-14 01:45:16,982 INFO L378 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 [2024-10-14 01:45:16,994 INFO L378 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 15 treesize of output 1 [2024-10-14 01:45:17,096 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 01:45:17,096 INFO L378 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 1 case distinctions, treesize of input 25 treesize of output 22 [2024-10-14 01:45:17,120 INFO L349 Elim1Store]: treesize reduction 18, result has 37.9 percent of original size [2024-10-14 01:45:17,120 INFO L378 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 18 treesize of output 20 [2024-10-14 01:45:17,127 INFO L378 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 8 [2024-10-14 01:45:17,142 INFO L378 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 [2024-10-14 01:45:17,167 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 01:45:17,168 INFO L378 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-14 01:45:17,304 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-14 01:45:17,304 INFO L378 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 1 case distinctions, treesize of input 40 treesize of output 28 [2024-10-14 01:45:17,324 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 01:45:17,324 INFO L378 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 1 case distinctions, treesize of input 20 treesize of output 19 [2024-10-14 01:45:17,328 INFO L378 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 23 treesize of output 11 [2024-10-14 01:45:17,508 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2024-10-14 01:45:17,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 76 [2024-10-14 01:45:17,537 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-14 01:45:17,538 INFO L378 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 1 case distinctions, treesize of input 73 treesize of output 68 [2024-10-14 01:45:17,581 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2024-10-14 01:45:17,581 INFO L378 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 79 [2024-10-14 01:45:17,803 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 01:45:17,803 INFO L378 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 47 treesize of output 22 [2024-10-14 01:45:17,810 INFO L378 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 [2024-10-14 01:45:17,971 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:45:17,972 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:45:18,078 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1245 (Array Int Int)) (v_ArrVal_1244 (Array Int Int)) (v_ArrVal_1243 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1243))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1245) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1244) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 2)))) is different from false [2024-10-14 01:45:18,113 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int)) (v_ArrVal_1245 (Array Int Int)) (v_ArrVal_1244 (Array Int Int)) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1241 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1239) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1243)) (.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= 2 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1245) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1241) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1244) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (not (= (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1 (select v_ArrVal_1239 .cse1)) v_ArrVal_1239))))) is different from false [2024-10-14 01:45:18,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:18,140 INFO L378 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 42 treesize of output 46 [2024-10-14 01:45:18,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:18,169 INFO L378 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 686 treesize of output 700 [2024-10-14 01:45:18,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:18,199 INFO L378 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 179 treesize of output 163 [2024-10-14 01:45:18,333 INFO L378 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 21 treesize of output 3 [2024-10-14 01:45:18,829 INFO L378 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 160 treesize of output 142 [2024-10-14 01:45:18,851 INFO L378 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 160 treesize of output 142 [2024-10-14 01:45:18,864 INFO L378 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 [2024-10-14 01:45:18,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:18,907 INFO L378 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 204 treesize of output 208 [2024-10-14 01:45:18,977 INFO L378 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 160 treesize of output 142 [2024-10-14 01:45:19,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:19,016 INFO L378 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 166 treesize of output 170 [2024-10-14 01:45:19,047 INFO L378 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 181 treesize of output 145 [2024-10-14 01:45:19,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:19,086 INFO L378 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 187 treesize of output 173 [2024-10-14 01:45:19,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:19,129 INFO L378 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 225 treesize of output 211 [2024-10-14 01:45:19,206 INFO L378 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 181 treesize of output 145 [2024-10-14 01:45:19,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:19,229 INFO L378 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 187 treesize of output 173 [2024-10-14 01:45:19,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:19,256 INFO L378 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 225 treesize of output 211 [2024-10-14 01:45:19,316 INFO L378 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 160 treesize of output 142 [2024-10-14 01:45:19,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2024-10-14 01:45:19,336 INFO L378 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 160 treesize of output 142 [2024-10-14 01:45:19,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:19,350 INFO L378 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 28 treesize of output 32 [2024-10-14 01:45:19,372 INFO L378 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 [2024-10-14 01:45:19,380 INFO L378 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 44 treesize of output 42 [2024-10-14 01:45:19,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:19,417 INFO L378 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 204 treesize of output 208 [2024-10-14 01:45:19,470 INFO L378 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 160 treesize of output 142 [2024-10-14 01:45:19,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:19,496 INFO L378 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 166 treesize of output 170 [2024-10-14 01:45:19,512 INFO L378 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 [2024-10-14 01:45:19,519 INFO L378 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 44 treesize of output 42 [2024-10-14 01:45:19,541 INFO L378 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 [2024-10-14 01:45:19,550 INFO L378 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 44 treesize of output 42 [2024-10-14 01:45:19,576 INFO L378 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 [2024-10-14 01:45:19,586 INFO L378 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 44 treesize of output 42 [2024-10-14 01:45:19,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:19,633 INFO L378 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 90 treesize of output 92 [2024-10-14 01:45:19,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-10-14 01:45:19,913 INFO L378 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 38 treesize of output 26 [2024-10-14 01:45:19,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 01:45:19,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-10-14 01:45:20,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:20,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 54 [2024-10-14 01:45:20,628 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:20,629 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:20,644 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-14 01:45:20,644 INFO L378 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 23 [2024-10-14 01:45:20,649 INFO L378 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 18 treesize of output 10 [2024-10-14 01:45:20,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:20,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-10-14 01:45:20,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:20,677 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:20,679 INFO L378 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 18 treesize of output 12 [2024-10-14 01:45:20,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 01:45:20,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:20,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-10-14 01:45:20,697 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:20,698 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:20,714 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-14 01:45:20,714 INFO L378 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 20 treesize of output 15 [2024-10-14 01:45:20,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2024-10-14 01:45:20,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:20,740 INFO L378 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 34 treesize of output 35 [2024-10-14 01:45:20,743 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:20,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:20,755 INFO L378 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 47 treesize of output 46 [2024-10-14 01:45:20,760 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:20,761 INFO L378 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 41 treesize of output 25 [2024-10-14 01:45:20,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:20,809 INFO L378 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 29 treesize of output 30 [2024-10-14 01:45:20,814 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:20,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:20,825 INFO L378 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 36 treesize of output 35 [2024-10-14 01:45:20,829 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:20,830 INFO L378 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 22 treesize of output 14 [2024-10-14 01:45:20,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:20,854 INFO L378 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 59 treesize of output 49 [2024-10-14 01:45:20,859 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:20,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:20,870 INFO L378 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 61 treesize of output 54 [2024-10-14 01:45:20,876 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:20,876 INFO L378 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 33 treesize of output 21 [2024-10-14 01:45:20,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:20,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 49 [2024-10-14 01:45:20,903 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:20,903 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:20,918 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-14 01:45:20,918 INFO L378 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 29 treesize of output 18 [2024-10-14 01:45:20,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2024-10-14 01:45:20,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:20,946 INFO L378 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 26 [2024-10-14 01:45:20,949 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:20,950 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:20,967 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-14 01:45:20,968 INFO L378 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 20 treesize of output 15 [2024-10-14 01:45:20,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:20,988 INFO L378 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 64 treesize of output 54 [2024-10-14 01:45:20,993 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:21,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:21,005 INFO L378 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 72 treesize of output 65 [2024-10-14 01:45:21,012 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:21,013 INFO L378 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 52 treesize of output 32 [2024-10-14 01:45:21,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:21,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2024-10-14 01:45:21,092 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:21,094 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:21,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:21,106 INFO L378 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 25 treesize of output 24 [2024-10-14 01:45:21,110 INFO L378 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 26 treesize of output 18 [2024-10-14 01:45:22,423 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-14 01:45:22,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89672870] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:45:22,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:45:22,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 29 [2024-10-14 01:45:22,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795178750] [2024-10-14 01:45:22,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:45:22,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-14 01:45:22,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:45:22,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-14 01:45:22,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=617, Unknown=2, NotChecked=102, Total=812 [2024-10-14 01:45:22,425 INFO L87 Difference]: Start difference. First operand 107 states and 146 transitions. Second operand has 29 states, 29 states have (on average 2.6551724137931036) internal successors, (77), 29 states have internal predecessors, (77), 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) [2024-10-14 01:45:24,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:45:24,137 INFO L93 Difference]: Finished difference Result 134 states and 177 transitions. [2024-10-14 01:45:24,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 01:45:24,137 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.6551724137931036) internal successors, (77), 29 states have internal predecessors, (77), 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 [2024-10-14 01:45:24,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:45:24,138 INFO L225 Difference]: With dead ends: 134 [2024-10-14 01:45:24,138 INFO L226 Difference]: Without dead ends: 126 [2024-10-14 01:45:24,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=232, Invalid=1496, Unknown=2, NotChecked=162, Total=1892 [2024-10-14 01:45:24,139 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 90 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 01:45:24,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 676 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 504 Invalid, 0 Unknown, 176 Unchecked, 0.8s Time] [2024-10-14 01:45:24,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-14 01:45:24,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2024-10-14 01:45:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 113 states have internal predecessors, (154), 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) [2024-10-14 01:45:24,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 154 transitions. [2024-10-14 01:45:24,157 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 154 transitions. Word has length 36 [2024-10-14 01:45:24,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:45:24,157 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 154 transitions. [2024-10-14 01:45:24,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.6551724137931036) internal successors, (77), 29 states have internal predecessors, (77), 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) [2024-10-14 01:45:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 154 transitions. [2024-10-14 01:45:24,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 01:45:24,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:45:24,158 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:45:24,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-14 01:45:24,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-14 01:45:24,358 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:45:24,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:45:24,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1825502169, now seen corresponding path program 2 times [2024-10-14 01:45:24,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:45:24,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471979740] [2024-10-14 01:45:24,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:45:24,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:45:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:45:25,166 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:45:25,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:45:25,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471979740] [2024-10-14 01:45:25,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471979740] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:45:25,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162031568] [2024-10-14 01:45:25,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 01:45:25,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:45:25,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:45:25,167 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:45:25,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-14 01:45:25,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 01:45:25,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:45:25,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-10-14 01:45:25,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:45:25,325 INFO L378 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 [2024-10-14 01:45:25,399 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 01:45:25,400 INFO L378 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 17 treesize of output 21 [2024-10-14 01:45:25,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 01:45:25,524 INFO L378 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 15 treesize of output 1 [2024-10-14 01:45:25,608 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 01:45:25,608 INFO L378 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-14 01:45:25,614 INFO L378 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 [2024-10-14 01:45:25,636 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-14 01:45:25,637 INFO L378 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 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-14 01:45:25,662 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-14 01:45:25,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-14 01:45:25,677 INFO L378 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 [2024-10-14 01:45:25,768 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2024-10-14 01:45:25,768 INFO L378 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 175 treesize of output 125 [2024-10-14 01:45:25,783 INFO L378 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 128 treesize of output 105 [2024-10-14 01:45:25,790 INFO L378 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 55 treesize of output 19 [2024-10-14 01:45:25,956 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-10-14 01:45:25,956 INFO L378 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 172 treesize of output 135 [2024-10-14 01:45:25,968 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-14 01:45:25,969 INFO L378 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 128 treesize of output 121 [2024-10-14 01:45:25,974 INFO L378 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 52 treesize of output 19 [2024-10-14 01:45:26,031 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-10-14 01:45:26,031 INFO L378 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 71 treesize of output 30 [2024-10-14 01:45:26,034 INFO L378 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 19 treesize of output 11 [2024-10-14 01:45:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:45:26,065 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:45:26,105 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1355 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1357) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1356) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1355) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 1)) is different from false [2024-10-14 01:45:26,129 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1355 (Array Int Int)) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1353 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1354) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1357) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1356) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1353) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1355) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 1) (not (= v_ArrVal_1354 (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_1354 .cse0))))))) is different from false [2024-10-14 01:45:26,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:26,147 INFO L378 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 42 treesize of output 46 [2024-10-14 01:45:26,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:26,159 INFO L378 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 540 treesize of output 526 [2024-10-14 01:45:26,179 INFO L378 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 108 treesize of output 72 [2024-10-14 01:45:26,241 INFO L378 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 181 treesize of output 145 [2024-10-14 01:45:26,255 INFO L378 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 21 treesize of output 3 [2024-10-14 01:45:26,264 INFO L378 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 160 treesize of output 142 [2024-10-14 01:45:26,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-10-14 01:45:26,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:26,401 INFO L378 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 34 treesize of output 35 [2024-10-14 01:45:26,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:26,412 INFO L378 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 205 treesize of output 198 [2024-10-14 01:45:26,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:26,424 INFO L378 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 93 treesize of output 69 [2024-10-14 01:45:26,429 INFO L378 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 54 treesize of output 46 [2024-10-14 01:45:26,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:26,523 INFO L378 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 29 treesize of output 30 [2024-10-14 01:45:26,527 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:26,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:26,536 INFO L378 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 36 treesize of output 35 [2024-10-14 01:45:26,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:26,553 INFO L378 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 22 treesize of output 22 [2024-10-14 01:45:26,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:26,563 INFO L378 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 26 [2024-10-14 01:45:26,567 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:45:26,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:26,576 INFO L378 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 38 treesize of output 31 [2024-10-14 01:45:26,582 INFO L378 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 7 [2024-10-14 01:45:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-10-14 01:45:27,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162031568] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:45:27,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:45:27,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2024-10-14 01:45:27,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201506703] [2024-10-14 01:45:27,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:45:27,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 01:45:27,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:45:27,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 01:45:27,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=478, Unknown=3, NotChecked=90, Total=650 [2024-10-14 01:45:27,146 INFO L87 Difference]: Start difference. First operand 114 states and 154 transitions. Second operand has 26 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 26 states have internal predecessors, (75), 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) [2024-10-14 01:45:28,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:45:28,049 INFO L93 Difference]: Finished difference Result 135 states and 178 transitions. [2024-10-14 01:45:28,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 01:45:28,050 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 26 states have internal predecessors, (75), 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 [2024-10-14 01:45:28,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:45:28,050 INFO L225 Difference]: With dead ends: 135 [2024-10-14 01:45:28,051 INFO L226 Difference]: Without dead ends: 129 [2024-10-14 01:45:28,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=122, Invalid=695, Unknown=3, NotChecked=110, Total=930 [2024-10-14 01:45:28,055 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 63 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 01:45:28,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 880 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 571 Invalid, 0 Unknown, 169 Unchecked, 0.7s Time] [2024-10-14 01:45:28,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-14 01:45:28,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2024-10-14 01:45:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.3524590163934427) internal successors, (165), 122 states have internal predecessors, (165), 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) [2024-10-14 01:45:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 165 transitions. [2024-10-14 01:45:28,061 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 165 transitions. Word has length 36 [2024-10-14 01:45:28,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:45:28,061 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 165 transitions. [2024-10-14 01:45:28,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 26 states have internal predecessors, (75), 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) [2024-10-14 01:45:28,061 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 165 transitions. [2024-10-14 01:45:28,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 01:45:28,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:45:28,062 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:45:28,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-14 01:45:28,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:45:28,263 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:45:28,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:45:28,264 INFO L85 PathProgramCache]: Analyzing trace with hash 422011842, now seen corresponding path program 4 times [2024-10-14 01:45:28,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:45:28,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604774213] [2024-10-14 01:45:28,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:45:28,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:45:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:45:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:45:29,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:45:29,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604774213] [2024-10-14 01:45:29,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604774213] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:45:29,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001438934] [2024-10-14 01:45:29,115 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 01:45:29,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:45:29,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:45:29,116 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 01:45:29,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-14 01:45:29,244 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 01:45:29,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:45:29,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-10-14 01:45:29,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:45:29,260 INFO L378 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 [2024-10-14 01:45:29,321 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 01:45:29,321 INFO L378 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 17 treesize of output 21 [2024-10-14 01:45:29,387 INFO L378 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 15 treesize of output 1 [2024-10-14 01:45:29,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 01:45:29,464 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 01:45:29,465 INFO L378 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-14 01:45:29,468 INFO L378 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 [2024-10-14 01:45:29,485 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-14 01:45:29,485 INFO L378 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 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-14 01:45:29,505 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-14 01:45:29,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-14 01:45:29,588 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2024-10-14 01:45:29,589 INFO L378 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 147 treesize of output 109 [2024-10-14 01:45:29,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 82 [2024-10-14 01:45:29,721 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-10-14 01:45:29,721 INFO L378 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 177 treesize of output 140 [2024-10-14 01:45:29,745 INFO L349 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2024-10-14 01:45:29,745 INFO L378 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 133 treesize of output 129 [2024-10-14 01:45:29,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-10-14 01:45:30,076 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-10-14 01:45:30,076 INFO L378 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 86 treesize of output 35 [2024-10-14 01:45:30,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-14 01:45:30,163 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 01:45:30,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:45:30,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:30,323 INFO L378 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 202 treesize of output 205 [2024-10-14 01:45:30,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:30,558 INFO L378 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 109 treesize of output 103 [2024-10-14 01:45:30,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:30,565 INFO L378 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 122 treesize of output 116 [2024-10-14 01:45:30,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:30,902 INFO L378 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 85 treesize of output 86 [2024-10-14 01:45:30,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:30,910 INFO L378 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 99 treesize of output 90 [2024-10-14 01:45:30,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:30,924 INFO L378 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 346 treesize of output 243 [2024-10-14 01:45:31,744 INFO L349 Elim1Store]: treesize reduction 390, result has 58.3 percent of original size [2024-10-14 01:45:31,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 12128 treesize of output 11135 [2024-10-14 01:45:31,878 INFO L378 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 656 treesize of output 584 [2024-10-14 01:45:32,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:32,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 634 treesize of output 522 [2024-10-14 01:45:32,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:32,094 INFO L378 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 456 treesize of output 380 [2024-10-14 01:45:32,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:32,148 INFO L378 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 255 treesize of output 183