./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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.3.0-?-8fc3dc6-m [2025-03-16 17:33:32,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:33:32,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:33:32,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:33:32,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:33:32,560 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:33:32,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:33:32,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:33:32,562 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:33:32,563 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:33:32,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:33:32,563 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:33:32,563 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:33:32,564 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:33:32,564 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:33:32,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:33:32,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:33:32,564 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:33:32,565 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:33:32,565 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:33:32,565 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:33:32,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:33:32,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:33:32,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:33:32,565 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:33:32,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:33:32,565 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:33:32,565 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:33:32,565 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:33:32,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:33:32,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:33:32,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:33:32,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:33:32,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:33:32,566 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:33:32,566 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:33:32,566 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:33:32,566 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:33:32,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:33:32,567 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:33:32,567 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:33:32,567 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:33:32,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:33:32,567 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2025-03-16 17:33:32,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:33:32,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:33:32,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:33:32,861 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:33:32,861 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:33:32,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i [2025-03-16 17:33:33,955 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/923097079/0e445af71bd1478c98622a9e5b4afcff/FLAGaddba2986 [2025-03-16 17:33:34,196 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:33:34,196 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr-2.i [2025-03-16 17:33:34,204 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/923097079/0e445af71bd1478c98622a9e5b4afcff/FLAGaddba2986 [2025-03-16 17:33:34,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/923097079/0e445af71bd1478c98622a9e5b4afcff [2025-03-16 17:33:34,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:33:34,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:33:34,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:33:34,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:33:34,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:33:34,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:33:34" (1/1) ... [2025-03-16 17:33:34,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27b8530a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:34, skipping insertion in model container [2025-03-16 17:33:34,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:33:34" (1/1) ... [2025-03-16 17:33:34,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:33:34,737 WARN L250 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] [2025-03-16 17:33:34,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:33:34,748 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:33:34,789 WARN L250 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] [2025-03-16 17:33:34,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:33:34,808 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:33:34,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:34 WrapperNode [2025-03-16 17:33:34,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:33:34,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:33:34,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:33:34,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:33:34,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:34" (1/1) ... [2025-03-16 17:33:34,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:34" (1/1) ... [2025-03-16 17:33:34,839 INFO L138 Inliner]: procedures = 122, calls = 54, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 194 [2025-03-16 17:33:34,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:33:34,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:33:34,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:33:34,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:33:34,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:34" (1/1) ... [2025-03-16 17:33:34,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:34" (1/1) ... [2025-03-16 17:33:34,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:34" (1/1) ... [2025-03-16 17:33:34,860 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 12, 26]. 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, 5, 10]. [2025-03-16 17:33:34,860 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:34" (1/1) ... [2025-03-16 17:33:34,860 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:34" (1/1) ... [2025-03-16 17:33:34,866 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:34" (1/1) ... [2025-03-16 17:33:34,867 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:34" (1/1) ... [2025-03-16 17:33:34,868 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:34" (1/1) ... [2025-03-16 17:33:34,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:34" (1/1) ... [2025-03-16 17:33:34,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:33:34,871 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:33:34,871 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:33:34,871 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:33:34,871 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:34" (1/1) ... [2025-03-16 17:33:34,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:33:34,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:33:34,900 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) [2025-03-16 17:33:34,903 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 [2025-03-16 17:33:34,917 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-03-16 17:33:34,918 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-03-16 17:33:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 17:33:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 17:33:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 17:33:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 17:33:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 17:33:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 17:33:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 17:33:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:33:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 17:33:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 17:33:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-16 17:33:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 17:33:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 17:33:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-16 17:33:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 17:33:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:33:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 17:33:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 17:33:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:33:34,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:33:34,995 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:33:34,996 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:33:35,039 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-03-16 17:33:35,294 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-03-16 17:33:35,294 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:33:35,305 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:33:35,305 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:33:35,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:33:35 BoogieIcfgContainer [2025-03-16 17:33:35,306 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:33:35,308 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:33:35,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:33:35,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:33:35,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:33:34" (1/3) ... [2025-03-16 17:33:35,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b0a309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:33:35, skipping insertion in model container [2025-03-16 17:33:35,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:33:34" (2/3) ... [2025-03-16 17:33:35,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b0a309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:33:35, skipping insertion in model container [2025-03-16 17:33:35,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:33:35" (3/3) ... [2025-03-16 17:33:35,315 INFO L128 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-2.i [2025-03-16 17:33:35,328 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:33:35,330 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG list_and_tree_cnstr-2.i that has 2 procedures, 50 locations, 1 initial locations, 8 loop locations, and 1 error locations. [2025-03-16 17:33:35,370 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:33:35,378 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;@2c244740, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:33:35,378 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 17:33:35,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 47 states have internal predecessors, (74), 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) [2025-03-16 17:33:35,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 17:33:35,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:33:35,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:33:35,386 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:33:35,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:33:35,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1531692346, now seen corresponding path program 1 times [2025-03-16 17:33:35,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:33:35,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684794004] [2025-03-16 17:33:35,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:33:35,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:33:35,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 17:33:35,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 17:33:35,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:33:35,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:33:35,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:33:35,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684794004] [2025-03-16 17:33:35,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684794004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:33:35,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:33:35,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 17:33:35,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337109] [2025-03-16 17:33:35,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:33:35,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 17:33:35,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:33:35,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 17:33:35,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 17:33:35,541 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 47 states have internal predecessors, (74), 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.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:35,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:33:35,553 INFO L93 Difference]: Finished difference Result 97 states and 153 transitions. [2025-03-16 17:33:35,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 17:33:35,554 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2025-03-16 17:33:35,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:33:35,558 INFO L225 Difference]: With dead ends: 97 [2025-03-16 17:33:35,558 INFO L226 Difference]: Without dead ends: 41 [2025-03-16 17:33:35,560 INFO L434 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 [2025-03-16 17:33:35,562 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:33:35,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:33:35,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-16 17:33:35,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-16 17:33:35,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.45) internal successors, (58), 40 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:35,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2025-03-16 17:33:35,584 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 14 [2025-03-16 17:33:35,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:33:35,584 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2025-03-16 17:33:35,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:35,585 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2025-03-16 17:33:35,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 17:33:35,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:33:35,585 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:33:35,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:33:35,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:33:35,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:33:35,586 INFO L85 PathProgramCache]: Analyzing trace with hash -955677162, now seen corresponding path program 1 times [2025-03-16 17:33:35,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:33:35,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776966776] [2025-03-16 17:33:35,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:33:35,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:33:35,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 17:33:35,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 17:33:35,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:33:35,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:35,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:33:35,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:33:35,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776966776] [2025-03-16 17:33:35,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776966776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:33:35,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:33:35,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 17:33:35,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249338046] [2025-03-16 17:33:35,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:33:35,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:33:35,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:33:35,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:33:35,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:33:35,680 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:35,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:33:35,696 INFO L93 Difference]: Finished difference Result 68 states and 94 transitions. [2025-03-16 17:33:35,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:33:35,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2025-03-16 17:33:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:33:35,699 INFO L225 Difference]: With dead ends: 68 [2025-03-16 17:33:35,699 INFO L226 Difference]: Without dead ends: 49 [2025-03-16 17:33:35,700 INFO L434 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 [2025-03-16 17:33:35,701 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 30 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:33:35,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 90 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:33:35,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-16 17:33:35,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-16 17:33:35,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 48 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:35,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2025-03-16 17:33:35,706 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 19 [2025-03-16 17:33:35,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:33:35,707 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2025-03-16 17:33:35,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:35,707 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2025-03-16 17:33:35,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-16 17:33:35,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:33:35,708 INFO L218 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] [2025-03-16 17:33:35,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 17:33:35,709 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:33:35,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:33:35,710 INFO L85 PathProgramCache]: Analyzing trace with hash 915772894, now seen corresponding path program 1 times [2025-03-16 17:33:35,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:33:35,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022148217] [2025-03-16 17:33:35,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:33:35,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:33:35,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 17:33:35,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 17:33:35,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:33:35,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:35,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:33:35,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:33:35,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022148217] [2025-03-16 17:33:35,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022148217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:33:35,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:33:35,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:33:35,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566585631] [2025-03-16 17:33:35,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:33:35,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:33:35,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:33:35,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:33:35,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:33:35,954 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:33:36,018 INFO L93 Difference]: Finished difference Result 66 states and 91 transitions. [2025-03-16 17:33:36,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:33:36,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-16 17:33:36,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:33:36,020 INFO L225 Difference]: With dead ends: 66 [2025-03-16 17:33:36,020 INFO L226 Difference]: Without dead ends: 62 [2025-03-16 17:33:36,020 INFO L434 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 [2025-03-16 17:33:36,021 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:33:36,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 184 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:33:36,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-16 17:33:36,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2025-03-16 17:33:36,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.456140350877193) internal successors, (83), 57 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. [2025-03-16 17:33:36,030 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 83 transitions. Word has length 25 [2025-03-16 17:33:36,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:33:36,031 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 83 transitions. [2025-03-16 17:33:36,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:36,031 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 83 transitions. [2025-03-16 17:33:36,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 17:33:36,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:33:36,031 INFO L218 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] [2025-03-16 17:33:36,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 17:33:36,032 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:33:36,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:33:36,032 INFO L85 PathProgramCache]: Analyzing trace with hash -377145729, now seen corresponding path program 1 times [2025-03-16 17:33:36,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:33:36,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894487923] [2025-03-16 17:33:36,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:33:36,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:33:36,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 17:33:36,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 17:33:36,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:33:36,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:33:36,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:33:36,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894487923] [2025-03-16 17:33:36,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894487923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:33:36,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:33:36,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:33:36,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316134705] [2025-03-16 17:33:36,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:33:36,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:33:36,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:33:36,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:33:36,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:33:36,171 INFO L87 Difference]: Start difference. First operand 58 states and 83 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:36,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:33:36,219 INFO L93 Difference]: Finished difference Result 68 states and 93 transitions. [2025-03-16 17:33:36,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:33:36,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-16 17:33:36,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:33:36,220 INFO L225 Difference]: With dead ends: 68 [2025-03-16 17:33:36,220 INFO L226 Difference]: Without dead ends: 60 [2025-03-16 17:33:36,220 INFO L434 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 [2025-03-16 17:33:36,225 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 5 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:33:36,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 187 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:33:36,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-16 17:33:36,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2025-03-16 17:33:36,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 55 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:36,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2025-03-16 17:33:36,230 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 27 [2025-03-16 17:33:36,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:33:36,230 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2025-03-16 17:33:36,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:36,230 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2025-03-16 17:33:36,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 17:33:36,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:33:36,231 INFO L218 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] [2025-03-16 17:33:36,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 17:33:36,231 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:33:36,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:33:36,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1756102145, now seen corresponding path program 1 times [2025-03-16 17:33:36,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:33:36,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000964986] [2025-03-16 17:33:36,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:33:36,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:33:36,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 17:33:36,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 17:33:36,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:33:36,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:36,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:33:36,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:33:36,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000964986] [2025-03-16 17:33:36,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000964986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:33:36,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:33:36,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:33:36,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434955204] [2025-03-16 17:33:36,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:33:36,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:33:36,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:33:36,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:33:36,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:33:36,361 INFO L87 Difference]: Start difference. First operand 56 states and 80 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:36,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:33:36,410 INFO L93 Difference]: Finished difference Result 68 states and 93 transitions. [2025-03-16 17:33:36,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:33:36,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-16 17:33:36,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:33:36,411 INFO L225 Difference]: With dead ends: 68 [2025-03-16 17:33:36,411 INFO L226 Difference]: Without dead ends: 57 [2025-03-16 17:33:36,412 INFO L434 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 [2025-03-16 17:33:36,416 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 5 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:33:36,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 191 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:33:36,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-16 17:33:36,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2025-03-16 17:33:36,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 52 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2025-03-16 17:33:36,421 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 27 [2025-03-16 17:33:36,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:33:36,422 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2025-03-16 17:33:36,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:36,423 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2025-03-16 17:33:36,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-16 17:33:36,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:33:36,424 INFO L218 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] [2025-03-16 17:33:36,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 17:33:36,424 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:33:36,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:33:36,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1872517434, now seen corresponding path program 1 times [2025-03-16 17:33:36,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:33:36,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984564695] [2025-03-16 17:33:36,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:33:36,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:33:36,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-16 17:33:36,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 17:33:36,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:33:36,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:36,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:33:36,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:33:36,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984564695] [2025-03-16 17:33:36,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984564695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:33:36,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400841264] [2025-03-16 17:33:36,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:33:36,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:33:36,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:33:36,780 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) [2025-03-16 17:33:36,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 17:33:36,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-16 17:33:36,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 17:33:36,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:33:36,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:36,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-16 17:33:36,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:33:36,905 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 [2025-03-16 17:33:36,943 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 [2025-03-16 17:33:36,957 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-16 17:33:36,957 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 [2025-03-16 17:33:36,999 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 [2025-03-16 17:33:37,019 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 [2025-03-16 17:33:37,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:33:37,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:33:37,095 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_178) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 2 .cse0)))) is different from false [2025-03-16 17:33:37,122 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_177 (Array Int Int)) (v_ArrVal_178 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_177) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_178) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 2 .cse0) (not (= v_ArrVal_177 (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1 (select v_ArrVal_177 .cse1)))))))) is different from false [2025-03-16 17:33:37,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:37,154 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 245 treesize of output 243 [2025-03-16 17:33:37,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 49 treesize of output 41 [2025-03-16 17:33:37,231 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 [2025-03-16 17:33:37,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 193 treesize of output 185 [2025-03-16 17:33:37,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2025-03-16 17:33:37,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400841264] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:33:37,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:33:37,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 15 [2025-03-16 17:33:37,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142995737] [2025-03-16 17:33:37,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:33:37,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 17:33:37,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:33:37,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 17:33:37,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=122, Unknown=2, NotChecked=46, Total=210 [2025-03-16 17:33:37,362 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:37,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:33:37,592 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2025-03-16 17:33:37,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 17:33:37,592 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-16 17:33:37,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:33:37,593 INFO L225 Difference]: With dead ends: 74 [2025-03-16 17:33:37,593 INFO L226 Difference]: Without dead ends: 66 [2025-03-16 17:33:37,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=290, Unknown=2, NotChecked=74, Total=462 [2025-03-16 17:33:37,594 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 26 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:33:37,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 458 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 133 Invalid, 0 Unknown, 73 Unchecked, 0.1s Time] [2025-03-16 17:33:37,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-16 17:33:37,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2025-03-16 17:33:37,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 61 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:37,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2025-03-16 17:33:37,597 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 29 [2025-03-16 17:33:37,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:33:37,597 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2025-03-16 17:33:37,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:37,597 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2025-03-16 17:33:37,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-16 17:33:37,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:33:37,598 INFO L218 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] [2025-03-16 17:33:37,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 17:33:37,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-16 17:33:37,799 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:33:37,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:33:37,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1073110086, now seen corresponding path program 1 times [2025-03-16 17:33:37,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:33:37,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655167861] [2025-03-16 17:33:37,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:33:37,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:33:37,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-16 17:33:37,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 17:33:37,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:33:37,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:38,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:33:38,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:33:38,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655167861] [2025-03-16 17:33:38,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655167861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:33:38,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470684895] [2025-03-16 17:33:38,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:33:38,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:33:38,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:33:38,029 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) [2025-03-16 17:33:38,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 17:33:38,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-16 17:33:38,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 17:33:38,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:33:38,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:38,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-16 17:33:38,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:33:38,120 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 [2025-03-16 17:33:38,139 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-16 17:33:38,139 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 [2025-03-16 17:33:38,144 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 [2025-03-16 17:33:38,164 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 [2025-03-16 17:33:38,195 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 [2025-03-16 17:33:38,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:33:38,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:33:38,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:38,271 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 2 case distinctions, treesize of input 23 treesize of output 29 [2025-03-16 17:33:38,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:38,283 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 30 treesize of output 33 [2025-03-16 17:33:38,288 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 9 treesize of output 7 [2025-03-16 17:33:38,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:33:38,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470684895] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:33:38,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:33:38,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-16 17:33:38,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694070123] [2025-03-16 17:33:38,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:33:38,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 17:33:38,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:33:38,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 17:33:38,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=118, Unknown=5, NotChecked=0, Total=156 [2025-03-16 17:33:38,349 INFO L87 Difference]: Start difference. First operand 62 states and 86 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:38,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:33:38,791 INFO L93 Difference]: Finished difference Result 77 states and 103 transitions. [2025-03-16 17:33:38,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 17:33:38,791 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-16 17:33:38,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:33:38,792 INFO L225 Difference]: With dead ends: 77 [2025-03-16 17:33:38,792 INFO L226 Difference]: Without dead ends: 71 [2025-03-16 17:33:38,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=201, Unknown=5, NotChecked=0, Total=272 [2025-03-16 17:33:38,792 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 22 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 17:33:38,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 457 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 17:33:38,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-16 17:33:38,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2025-03-16 17:33:38,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 68 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:38,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 94 transitions. [2025-03-16 17:33:38,798 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 94 transitions. Word has length 29 [2025-03-16 17:33:38,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:33:38,798 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 94 transitions. [2025-03-16 17:33:38,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:38,799 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 94 transitions. [2025-03-16 17:33:38,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-16 17:33:38,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:33:38,800 INFO L218 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] [2025-03-16 17:33:38,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 17:33:39,000 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,SelfDestructingSolverStorable6 [2025-03-16 17:33:39,001 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:33:39,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:33:39,001 INFO L85 PathProgramCache]: Analyzing trace with hash -68644133, now seen corresponding path program 1 times [2025-03-16 17:33:39,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:33:39,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407051225] [2025-03-16 17:33:39,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:33:39,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:33:39,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 17:33:39,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 17:33:39,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:33:39,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:39,440 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:33:39,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:33:39,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407051225] [2025-03-16 17:33:39,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407051225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:33:39,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251719682] [2025-03-16 17:33:39,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:33:39,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:33:39,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:33:39,443 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) [2025-03-16 17:33:39,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 17:33:39,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 17:33:39,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 17:33:39,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:33:39,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:39,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-16 17:33:39,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:33:39,535 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 [2025-03-16 17:33:39,584 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-16 17:33:39,584 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 [2025-03-16 17:33:39,614 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 [2025-03-16 17:33:39,618 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 [2025-03-16 17:33:39,661 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-16 17:33:39,662 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 [2025-03-16 17:33:39,670 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 [2025-03-16 17:33:39,673 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 [2025-03-16 17:33:39,703 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 [2025-03-16 17:33:39,710 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 [2025-03-16 17:33:39,720 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:33:39,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:33:39,750 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 [2025-03-16 17:33:39,755 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_330 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_330) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_332 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2025-03-16 17:33:39,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:39,770 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 [2025-03-16 17:33:39,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:39,776 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 [2025-03-16 17:33:39,779 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 [2025-03-16 17:33:39,790 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-16 17:33:39,791 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 22 treesize of output 1 [2025-03-16 17:33:39,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2025-03-16 17:33:39,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251719682] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:33:39,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:33:39,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2025-03-16 17:33:39,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842402003] [2025-03-16 17:33:39,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:33:39,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 17:33:39,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:33:39,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 17:33:39,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=258, Unknown=1, NotChecked=32, Total=342 [2025-03-16 17:33:39,886 INFO L87 Difference]: Start difference. First operand 69 states and 94 transitions. Second operand has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:40,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:33:40,124 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2025-03-16 17:33:40,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 17:33:40,124 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-16 17:33:40,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:33:40,125 INFO L225 Difference]: With dead ends: 92 [2025-03-16 17:33:40,125 INFO L226 Difference]: Without dead ends: 88 [2025-03-16 17:33:40,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=350, Unknown=1, NotChecked=38, Total=462 [2025-03-16 17:33:40,126 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 78 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:33:40,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 406 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 237 Invalid, 0 Unknown, 83 Unchecked, 0.2s Time] [2025-03-16 17:33:40,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-16 17:33:40,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2025-03-16 17:33:40,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:40,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 110 transitions. [2025-03-16 17:33:40,130 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 110 transitions. Word has length 31 [2025-03-16 17:33:40,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:33:40,131 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 110 transitions. [2025-03-16 17:33:40,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2025-03-16 17:33:40,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 17:33:40,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:33:40,131 INFO L218 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] [2025-03-16 17:33:40,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 17:33:40,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:33:40,335 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:33:40,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:33:40,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1509103556, now seen corresponding path program 2 times [2025-03-16 17:33:40,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:33:40,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589198661] [2025-03-16 17:33:40,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:33:40,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:33:40,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-16 17:33:40,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 17:33:40,356 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:33:40,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:40,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:33:40,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:33:40,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589198661] [2025-03-16 17:33:40,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589198661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:33:40,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841969940] [2025-03-16 17:33:40,727 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:33:40,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:33:40,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:33:40,729 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) [2025-03-16 17:33:40,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 17:33:40,792 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-16 17:33:40,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 17:33:40,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:33:40,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:40,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-16 17:33:40,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:33:40,824 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 [2025-03-16 17:33:40,862 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-16 17:33:40,862 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 [2025-03-16 17:33:40,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 15 treesize of output 1 [2025-03-16 17:33:40,883 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 [2025-03-16 17:33:40,916 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-16 17:33:40,916 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 [2025-03-16 17:33:40,922 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 [2025-03-16 17:33:40,924 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 [2025-03-16 17:33:40,956 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 [2025-03-16 17:33:40,960 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 [2025-03-16 17:33:40,965 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:33:40,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:33:41,007 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 [2025-03-16 17:33:41,012 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_406 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_406) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_407 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_407) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2025-03-16 17:33:41,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:41,029 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 [2025-03-16 17:33:41,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:41,035 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 [2025-03-16 17:33:41,039 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 [2025-03-16 17:33:41,047 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-16 17:33:41,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2025-03-16 17:33:41,152 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2025-03-16 17:33:41,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841969940] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:33:41,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:33:41,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2025-03-16 17:33:41,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799957839] [2025-03-16 17:33:41,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:33:41,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 17:33:41,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:33:41,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 17:33:41,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=231, Unknown=1, NotChecked=30, Total=306 [2025-03-16 17:33:41,155 INFO L87 Difference]: Start difference. First operand 82 states and 110 transitions. Second operand has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:41,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:33:41,395 INFO L93 Difference]: Finished difference Result 94 states and 122 transitions. [2025-03-16 17:33:41,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 17:33:41,396 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-16 17:33:41,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:33:41,396 INFO L225 Difference]: With dead ends: 94 [2025-03-16 17:33:41,396 INFO L226 Difference]: Without dead ends: 81 [2025-03-16 17:33:41,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=422, Unknown=1, NotChecked=42, Total=552 [2025-03-16 17:33:41,397 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 66 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:33:41,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 453 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 235 Invalid, 0 Unknown, 80 Unchecked, 0.1s Time] [2025-03-16 17:33:41,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-16 17:33:41,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2025-03-16 17:33:41,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:41,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2025-03-16 17:33:41,403 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 99 transitions. Word has length 33 [2025-03-16 17:33:41,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:33:41,404 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 99 transitions. [2025-03-16 17:33:41,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:41,404 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 99 transitions. [2025-03-16 17:33:41,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 17:33:41,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:33:41,404 INFO L218 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] [2025-03-16 17:33:41,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 17:33:41,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:33:41,605 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:33:41,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:33:41,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1989807766, now seen corresponding path program 2 times [2025-03-16 17:33:41,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:33:41,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157752862] [2025-03-16 17:33:41,606 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:33:41,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:33:41,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-16 17:33:41,628 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 17:33:41,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:33:41,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:41,936 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:33:41,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:33:41,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157752862] [2025-03-16 17:33:41,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157752862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:33:41,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879168549] [2025-03-16 17:33:41,937 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:33:41,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:33:41,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:33:41,939 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) [2025-03-16 17:33:41,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 17:33:42,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-16 17:33:42,025 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 17:33:42,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:33:42,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:42,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-16 17:33:42,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:33:42,044 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 [2025-03-16 17:33:42,073 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 [2025-03-16 17:33:42,086 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-16 17:33:42,086 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 [2025-03-16 17:33:42,126 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 [2025-03-16 17:33:42,171 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-16 17:33:42,171 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 [2025-03-16 17:33:42,175 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 [2025-03-16 17:33:42,213 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 [2025-03-16 17:33:42,233 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 [2025-03-16 17:33:42,272 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:33:42,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:33:42,330 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_515) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2025-03-16 17:33:42,374 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_26| Int) (v_ArrVal_511 (Array Int Int))) (or (= 2 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_511) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_514) |v_ULTIMATE.start_main_~t~0#1.base_26| v_ArrVal_515) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_26|) 0)) (not (= v_ArrVal_511 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_511 .cse0))))))) is different from false [2025-03-16 17:33:42,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:42,394 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 496 treesize of output 494 [2025-03-16 17:33:42,410 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 55 treesize of output 51 [2025-03-16 17:33:42,425 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 [2025-03-16 17:33:42,478 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 [2025-03-16 17:33:42,484 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 [2025-03-16 17:33:43,525 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2025-03-16 17:33:43,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879168549] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:33:43,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:33:43,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 25 [2025-03-16 17:33:43,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915199291] [2025-03-16 17:33:43,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:33:43,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-16 17:33:43,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:33:43,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-16 17:33:43,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=420, Unknown=9, NotChecked=86, Total=600 [2025-03-16 17:33:43,527 INFO L87 Difference]: Start difference. First operand 73 states and 99 transitions. Second operand has 25 states, 25 states have (on average 2.88) internal successors, (72), 25 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) [2025-03-16 17:33:43,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:33:43,760 INFO L93 Difference]: Finished difference Result 81 states and 108 transitions. [2025-03-16 17:33:43,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 17:33:43,760 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.88) internal successors, (72), 25 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) Word has length 33 [2025-03-16 17:33:43,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:33:43,761 INFO L225 Difference]: With dead ends: 81 [2025-03-16 17:33:43,761 INFO L226 Difference]: Without dead ends: 77 [2025-03-16 17:33:43,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=113, Invalid=536, Unknown=9, NotChecked=98, Total=756 [2025-03-16 17:33:43,762 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 52 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:33:43,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 519 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 256 Invalid, 0 Unknown, 144 Unchecked, 0.2s Time] [2025-03-16 17:33:43,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-16 17:33:43,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-16 17:33:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.368421052631579) internal successors, (104), 76 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 104 transitions. [2025-03-16 17:33:43,767 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 104 transitions. Word has length 33 [2025-03-16 17:33:43,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:33:43,768 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 104 transitions. [2025-03-16 17:33:43,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.88) internal successors, (72), 25 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) [2025-03-16 17:33:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 104 transitions. [2025-03-16 17:33:43,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 17:33:43,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:33:43,769 INFO L218 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] [2025-03-16 17:33:43,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 17:33:43,969 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,SelfDestructingSolverStorable9 [2025-03-16 17:33:43,969 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:33:43,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:33:43,970 INFO L85 PathProgramCache]: Analyzing trace with hash 887728572, now seen corresponding path program 1 times [2025-03-16 17:33:43,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:33:43,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309690603] [2025-03-16 17:33:43,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:33:43,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:33:43,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 17:33:43,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 17:33:43,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:33:43,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:33:44,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:33:44,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309690603] [2025-03-16 17:33:44,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309690603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:33:44,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040935417] [2025-03-16 17:33:44,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:33:44,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:33:44,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:33:44,254 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) [2025-03-16 17:33:44,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 17:33:44,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 17:33:44,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 17:33:44,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:33:44,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:44,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-16 17:33:44,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:33:44,353 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 [2025-03-16 17:33:44,385 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-16 17:33:44,386 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 [2025-03-16 17:33:44,410 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 [2025-03-16 17:33:44,414 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 [2025-03-16 17:33:44,456 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-16 17:33:44,457 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 [2025-03-16 17:33:44,461 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 [2025-03-16 17:33:44,464 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 [2025-03-16 17:33:44,485 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 [2025-03-16 17:33:44,487 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 [2025-03-16 17:33:44,491 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:33:44,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:33:44,531 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 [2025-03-16 17:33:44,536 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_592 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_592) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_591 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_591) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2025-03-16 17:33:44,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:44,564 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 [2025-03-16 17:33:44,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:44,572 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 [2025-03-16 17:33:44,575 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 [2025-03-16 17:33:44,586 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-16 17:33:44,587 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 22 treesize of output 1 [2025-03-16 17:33:44,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2025-03-16 17:33:44,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040935417] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:33:44,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:33:44,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2025-03-16 17:33:44,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364395951] [2025-03-16 17:33:44,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:33:44,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 17:33:44,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:33:44,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 17:33:44,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=326, Unknown=1, NotChecked=36, Total=420 [2025-03-16 17:33:44,642 INFO L87 Difference]: Start difference. First operand 77 states and 104 transitions. Second operand has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:44,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:33:44,877 INFO L93 Difference]: Finished difference Result 93 states and 121 transitions. [2025-03-16 17:33:44,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 17:33:44,877 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-16 17:33:44,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:33:44,877 INFO L225 Difference]: With dead ends: 93 [2025-03-16 17:33:44,877 INFO L226 Difference]: Without dead ends: 80 [2025-03-16 17:33:44,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=591, Unknown=1, NotChecked=50, Total=756 [2025-03-16 17:33:44,878 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 87 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:33:44,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 418 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 198 Invalid, 0 Unknown, 72 Unchecked, 0.1s Time] [2025-03-16 17:33:44,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-16 17:33:44,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2025-03-16 17:33:44,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2025-03-16 17:33:44,884 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 33 [2025-03-16 17:33:44,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:33:44,884 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2025-03-16 17:33:44,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:44,885 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2025-03-16 17:33:44,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 17:33:44,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:33:44,885 INFO L218 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] [2025-03-16 17:33:44,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 17:33:45,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:33:45,089 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:33:45,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:33:45,089 INFO L85 PathProgramCache]: Analyzing trace with hash 978215223, now seen corresponding path program 3 times [2025-03-16 17:33:45,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:33:45,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997229161] [2025-03-16 17:33:45,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:33:45,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:33:45,098 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-03-16 17:33:45,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 17:33:45,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-16 17:33:45,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:33:45,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:33:45,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997229161] [2025-03-16 17:33:45,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997229161] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:33:45,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027461649] [2025-03-16 17:33:45,629 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:33:45,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:33:45,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:33:45,631 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) [2025-03-16 17:33:45,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 17:33:45,706 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 3 equivalence classes. [2025-03-16 17:33:45,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 17:33:45,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-16 17:33:45,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:45,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-16 17:33:45,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:33:45,751 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 [2025-03-16 17:33:45,786 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:33:45,787 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 [2025-03-16 17:33:45,828 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 [2025-03-16 17:33:45,836 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 [2025-03-16 17:33:45,894 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-16 17:33:45,894 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 [2025-03-16 17:33:45,905 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-16 17:33:45,905 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 [2025-03-16 17:33:45,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:33:45,915 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 [2025-03-16 17:33:45,919 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 [2025-03-16 17:33:45,969 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2025-03-16 17:33:45,970 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 [2025-03-16 17:33:45,973 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 [2025-03-16 17:33:45,982 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 [2025-03-16 17:33:46,047 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2025-03-16 17:33:46,048 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 [2025-03-16 17:33:46,062 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-16 17:33:46,062 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 [2025-03-16 17:33:46,067 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 [2025-03-16 17:33:46,123 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-03-16 17:33:46,124 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 [2025-03-16 17:33:46,127 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 [2025-03-16 17:33:46,145 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:33:46,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:33:46,172 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_702) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 2)) is different from false [2025-03-16 17:33:46,193 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= v_ArrVal_701 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_701 .cse0)))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_701) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_702) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#1.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_703) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_700) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 2)))) is different from false [2025-03-16 17:33:46,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:46,207 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 [2025-03-16 17:33:46,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:46,216 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 [2025-03-16 17:33:46,228 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 [2025-03-16 17:33:46,277 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 [2025-03-16 17:33:46,288 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 379 treesize of output 325 [2025-03-16 17:33:46,298 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 358 treesize of output 322 [2025-03-16 17:33:46,330 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 [2025-03-16 17:33:46,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:46,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 [2025-03-16 17:33:46,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:46,408 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 107 treesize of output 106 [2025-03-16 17:33:46,412 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 90 treesize of output 82 [2025-03-16 17:33:46,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:46,418 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 61 [2025-03-16 17:33:46,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:46,494 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 [2025-03-16 17:33:46,497 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:33:46,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:46,503 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 [2025-03-16 17:33:46,507 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 [2025-03-16 17:33:46,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:46,527 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 [2025-03-16 17:33:46,531 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:33:46,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:46,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 [2025-03-16 17:33:46,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:46,548 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 [2025-03-16 17:33:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-03-16 17:33:46,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027461649] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:33:46,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:33:46,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2025-03-16 17:33:46,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627063964] [2025-03-16 17:33:46,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:33:46,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-16 17:33:46,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:33:46,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-16 17:33:46,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=478, Unknown=3, NotChecked=90, Total=650 [2025-03-16 17:33:46,959 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:47,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:33:47,433 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2025-03-16 17:33:47,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 17:33:47,433 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-16 17:33:47,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:33:47,434 INFO L225 Difference]: With dead ends: 104 [2025-03-16 17:33:47,434 INFO L226 Difference]: Without dead ends: 100 [2025-03-16 17:33:47,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=695, Unknown=3, NotChecked=110, Total=930 [2025-03-16 17:33:47,435 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 65 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 17:33:47,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 635 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 404 Invalid, 0 Unknown, 171 Unchecked, 0.3s Time] [2025-03-16 17:33:47,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-16 17:33:47,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2025-03-16 17:33:47,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 89 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:47,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 119 transitions. [2025-03-16 17:33:47,443 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 119 transitions. Word has length 35 [2025-03-16 17:33:47,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:33:47,446 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 119 transitions. [2025-03-16 17:33:47,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:47,446 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 119 transitions. [2025-03-16 17:33:47,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 17:33:47,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:33:47,446 INFO L218 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] [2025-03-16 17:33:47,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 17:33:47,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:33:47,647 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:33:47,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:33:47,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1565344183, now seen corresponding path program 2 times [2025-03-16 17:33:47,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:33:47,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680778414] [2025-03-16 17:33:47,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:33:47,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:33:47,655 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-16 17:33:47,662 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 17:33:47,662 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:33:47,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:48,113 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:33:48,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:33:48,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680778414] [2025-03-16 17:33:48,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680778414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:33:48,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535523619] [2025-03-16 17:33:48,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:33:48,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:33:48,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:33:48,116 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) [2025-03-16 17:33:48,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 17:33:48,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-16 17:33:48,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 17:33:48,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:33:48,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:48,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-16 17:33:48,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:33:48,232 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 [2025-03-16 17:33:48,260 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:33:48,260 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 [2025-03-16 17:33:48,307 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 [2025-03-16 17:33:48,313 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 [2025-03-16 17:33:48,355 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-16 17:33:48,356 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 [2025-03-16 17:33:48,361 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 [2025-03-16 17:33:48,365 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 [2025-03-16 17:33:48,376 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-16 17:33:48,376 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 [2025-03-16 17:33:48,391 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-16 17:33:48,392 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 [2025-03-16 17:33:48,454 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2025-03-16 17:33:48,454 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 201 treesize of output 147 [2025-03-16 17:33:48,458 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 154 treesize of output 124 [2025-03-16 17:33:48,469 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 [2025-03-16 17:33:48,570 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2025-03-16 17:33:48,571 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 192 treesize of output 153 [2025-03-16 17:33:48,585 INFO L349 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2025-03-16 17:33:48,586 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 148 treesize of output 142 [2025-03-16 17:33:48,591 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 55 treesize of output 40 [2025-03-16 17:33:48,677 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-03-16 17:33:48,677 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 109 treesize of output 50 [2025-03-16 17:33:48,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2025-03-16 17:33:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:33:48,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:33:49,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:49,069 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 151 treesize of output 149 [2025-03-16 17:33:49,084 INFO L349 Elim1Store]: treesize reduction 4, result has 91.7 percent of original size [2025-03-16 17:33:49,085 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 1069 treesize of output 1027 [2025-03-16 17:33:49,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:49,095 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 637 treesize of output 580 [2025-03-16 17:33:49,279 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 [2025-03-16 17:33:49,369 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 60 treesize of output 44 [2025-03-16 17:33:49,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:49,900 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 51 treesize of output 41 [2025-03-16 17:33:49,902 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:33:49,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:49,907 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 77 treesize of output 58 [2025-03-16 17:33:49,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:49,916 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 31 treesize of output 27 [2025-03-16 17:33:49,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:49,932 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 [2025-03-16 17:33:49,934 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:33:49,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:49,939 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 61 treesize of output 54 [2025-03-16 17:33:49,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:49,945 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 40 treesize of output 32 [2025-03-16 17:33:49,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:49,960 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 [2025-03-16 17:33:49,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:49,969 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 135 [2025-03-16 17:33:49,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:49,975 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 [2025-03-16 17:33:49,978 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:33:49,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:49,986 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 36 treesize of output 35 [2025-03-16 17:33:49,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:49,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 29 treesize of output 25 [2025-03-16 17:33:50,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,004 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 20 treesize of output 20 [2025-03-16 17:33:50,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,033 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 51 treesize of output 41 [2025-03-16 17:33:50,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,044 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 321 treesize of output 254 [2025-03-16 17:33:50,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,056 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 59 treesize of output 55 [2025-03-16 17:33:50,061 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 57 treesize of output 41 [2025-03-16 17:33:50,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,166 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 30 treesize of output 31 [2025-03-16 17:33:50,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,179 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 310 treesize of output 243 [2025-03-16 17:33:50,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,186 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 [2025-03-16 17:33:50,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,195 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 75 treesize of output 75 [2025-03-16 17:33:50,201 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 62 treesize of output 54 [2025-03-16 17:33:50,206 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:33:50,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,212 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 [2025-03-16 17:33:50,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,221 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 106 treesize of output 86 [2025-03-16 17:33:50,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,340 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 [2025-03-16 17:33:50,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,347 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 165 treesize of output 128 [2025-03-16 17:33:50,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,356 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 [2025-03-16 17:33:50,360 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:33:50,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,369 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 [2025-03-16 17:33:50,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,378 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 91 treesize of output 75 [2025-03-16 17:33:50,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,387 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 37 treesize of output 37 [2025-03-16 17:33:50,392 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 42 [2025-03-16 17:33:50,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,434 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 [2025-03-16 17:33:50,436 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:33:50,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,442 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 [2025-03-16 17:33:50,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,448 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 33 treesize of output 29 [2025-03-16 17:33:50,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,466 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 [2025-03-16 17:33:50,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,472 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 35 treesize of output 36 [2025-03-16 17:33:50,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,481 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 168 treesize of output 125 [2025-03-16 17:33:50,485 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:33:50,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,493 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 36 treesize of output 35 [2025-03-16 17:33:50,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,507 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 29 treesize of output 25 [2025-03-16 17:33:50,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,515 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 20 treesize of output 20 [2025-03-16 17:33:50,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,545 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 30 treesize of output 31 [2025-03-16 17:33:50,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,554 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 194 treesize of output 145 [2025-03-16 17:33:50,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,561 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 [2025-03-16 17:33:50,563 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:33:50,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,571 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 47 treesize of output 46 [2025-03-16 17:33:50,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,579 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 31 treesize of output 31 [2025-03-16 17:33:50,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,588 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 48 treesize of output 36 [2025-03-16 17:33:50,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,652 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 [2025-03-16 17:33:50,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,660 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 35 treesize of output 36 [2025-03-16 17:33:50,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,670 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 179 treesize of output 118 [2025-03-16 17:33:50,675 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:33:50,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,685 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 [2025-03-16 17:33:50,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,696 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 45 treesize of output 45 [2025-03-16 17:33:50,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,705 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 87 treesize of output 71 [2025-03-16 17:33:50,710 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 42 [2025-03-16 17:33:50,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,746 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 30 treesize of output 31 [2025-03-16 17:33:50,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,759 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 275 treesize of output 214 [2025-03-16 17:33:50,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,775 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 [2025-03-16 17:33:50,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,785 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 75 treesize of output 75 [2025-03-16 17:33:50,792 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 62 treesize of output 54 [2025-03-16 17:33:50,796 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:33:50,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,804 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 [2025-03-16 17:33:50,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:50,814 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 95 treesize of output 79 [2025-03-16 17:33:52,454 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:33:52,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535523619] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:33:52,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:33:52,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 33 [2025-03-16 17:33:52,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983552082] [2025-03-16 17:33:52,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:33:52,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-16 17:33:52,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:33:52,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-16 17:33:52,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=937, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 17:33:52,457 INFO L87 Difference]: Start difference. First operand 90 states and 119 transitions. Second operand has 33 states, 33 states have (on average 2.3636363636363638) internal successors, (78), 33 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:57,159 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] [2025-03-16 17:33:58,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:33:58,110 INFO L93 Difference]: Finished difference Result 115 states and 148 transitions. [2025-03-16 17:33:58,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-16 17:33:58,110 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.3636363636363638) internal successors, (78), 33 states have internal predecessors, (78), 0 states have call successors, (0), 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 35 [2025-03-16 17:33:58,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:33:58,111 INFO L225 Difference]: With dead ends: 115 [2025-03-16 17:33:58,111 INFO L226 Difference]: Without dead ends: 109 [2025-03-16 17:33:58,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=285, Invalid=1971, Unknown=0, NotChecked=0, Total=2256 [2025-03-16 17:33:58,112 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 114 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 55 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:33:58,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 819 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 639 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2025-03-16 17:33:58,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-16 17:33:58,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2025-03-16 17:33:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.3265306122448979) internal successors, (130), 98 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:58,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2025-03-16 17:33:58,116 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 130 transitions. Word has length 35 [2025-03-16 17:33:58,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:33:58,116 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 130 transitions. [2025-03-16 17:33:58,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.3636363636363638) internal successors, (78), 33 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:33:58,116 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 130 transitions. [2025-03-16 17:33:58,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 17:33:58,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:33:58,117 INFO L218 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] [2025-03-16 17:33:58,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-16 17:33:58,317 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,SelfDestructingSolverStorable12 [2025-03-16 17:33:58,318 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:33:58,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:33:58,318 INFO L85 PathProgramCache]: Analyzing trace with hash -499609704, now seen corresponding path program 4 times [2025-03-16 17:33:58,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:33:58,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18377448] [2025-03-16 17:33:58,318 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 17:33:58,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:33:58,326 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-16 17:33:58,331 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 31 of 37 statements. [2025-03-16 17:33:58,331 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-16 17:33:58,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:58,783 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:33:58,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:33:58,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18377448] [2025-03-16 17:33:58,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18377448] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:33:58,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145005716] [2025-03-16 17:33:58,784 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 17:33:58,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:33:58,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:33:58,786 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) [2025-03-16 17:33:58,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 17:33:58,864 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-16 17:33:58,880 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 31 of 37 statements. [2025-03-16 17:33:58,881 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-16 17:33:58,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:33:58,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-16 17:33:58,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:33:58,891 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 [2025-03-16 17:33:58,936 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:33:58,936 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 [2025-03-16 17:33:58,971 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 [2025-03-16 17:33:58,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 15 treesize of output 1 [2025-03-16 17:33:59,027 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-16 17:33:59,028 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 [2025-03-16 17:33:59,031 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 [2025-03-16 17:33:59,042 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-16 17:33:59,042 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 [2025-03-16 17:33:59,053 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-16 17:33:59,054 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 [2025-03-16 17:33:59,104 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2025-03-16 17:33:59,105 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 [2025-03-16 17:33:59,107 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 [2025-03-16 17:33:59,175 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2025-03-16 17:33:59,175 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 [2025-03-16 17:33:59,189 INFO L349 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2025-03-16 17:33:59,189 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 [2025-03-16 17:33:59,194 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 [2025-03-16 17:33:59,367 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-03-16 17:33:59,367 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 [2025-03-16 17:33:59,370 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 [2025-03-16 17:33:59,411 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:33:59,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:33:59,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:59,502 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 [2025-03-16 17:33:59,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:59,632 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 [2025-03-16 17:33:59,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:59,641 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 [2025-03-16 17:33:59,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:59,867 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 81 treesize of output 82 [2025-03-16 17:33:59,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:59,871 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 71 treesize of output 62 [2025-03-16 17:33:59,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:59,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 4784 treesize of output 3351 [2025-03-16 17:33:59,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:33:59,963 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 5244 treesize of output 4889 [2025-03-16 17:34:00,008 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 661 treesize of output 565 [2025-03-16 17:34:00,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:34:00,081 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 512 treesize of output 572 [2025-03-16 17:34:00,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:34:00,165 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 518 treesize of output 506 [2025-03-16 17:34:00,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:34:00,210 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 658 treesize of output 526 [2025-03-16 17:34:42,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:34:42,985 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 81 treesize of output 82 [2025-03-16 17:34:42,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:34:42,992 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 71 treesize of output 62 [2025-03-16 17:34:43,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:34:43,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 1201 treesize of output 938 [2025-03-16 17:34:43,076 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:34:43,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:34:43,094 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 704 treesize of output 601 [2025-03-16 17:34:43,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:34:43,130 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 391 treesize of output 311 [2025-03-16 17:34:43,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:34:43,181 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 220 treesize of output 244 [2025-03-16 17:34:43,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:34:43,248 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 190 treesize of output 190 [2025-03-16 17:34:47,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:34:47,973 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 [2025-03-16 17:34:47,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:34:47,978 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 [2025-03-16 17:34:47,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:34:47,988 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 652 treesize of output 459 [2025-03-16 17:34:47,993 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:34:48,237 INFO L349 Elim1Store]: treesize reduction 122, result has 72.1 percent of original size [2025-03-16 17:34:48,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 2560 treesize of output 2313 [2025-03-16 17:34:48,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:34:48,322 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 344 treesize of output 304 [2025-03-16 17:34:48,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:34:48,393 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 566 treesize of output 446 [2025-03-16 17:34:48,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:34:48,425 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 246 treesize of output 230 [2025-03-16 17:34:48,444 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 125 [2025-03-16 17:34:55,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:34:55,246 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 [2025-03-16 17:34:55,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:34:55,251 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 [2025-03-16 17:34:55,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:34:55,261 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 665 treesize of output 466 [2025-03-16 17:34:55,264 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 17:34:55,402 INFO L349 Elim1Store]: treesize reduction 38, result has 82.6 percent of original size [2025-03-16 17:34:55,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 598 treesize of output 651 [2025-03-16 17:34:55,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:34:55,436 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 227 treesize of output 195 [2025-03-16 17:34:55,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:34:55,456 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 206 treesize of output 198 [2025-03-16 17:34:55,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:34:55,498 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 291 treesize of output 211 [2025-03-16 17:34:59,298 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:34:59,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145005716] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:34:59,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:34:59,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2025-03-16 17:34:59,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688376149] [2025-03-16 17:34:59,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:34:59,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-16 17:34:59,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:34:59,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-16 17:34:59,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=773, Unknown=2, NotChecked=0, Total=870 [2025-03-16 17:34:59,299 INFO L87 Difference]: Start difference. First operand 99 states and 130 transitions. Second operand has 30 states, 30 states have (on average 2.6) internal successors, (78), 30 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:35:00,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:35:00,410 INFO L93 Difference]: Finished difference Result 130 states and 166 transitions. [2025-03-16 17:35:00,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-16 17:35:00,410 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.6) internal successors, (78), 30 states have internal predecessors, (78), 0 states have call successors, (0), 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 37 [2025-03-16 17:35:00,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:35:00,411 INFO L225 Difference]: With dead ends: 130 [2025-03-16 17:35:00,411 INFO L226 Difference]: Without dead ends: 125 [2025-03-16 17:35:00,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=209, Invalid=1595, Unknown=2, NotChecked=0, Total=1806 [2025-03-16 17:35:00,412 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 79 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 17:35:00,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1094 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 17:35:00,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-16 17:35:00,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 111. [2025-03-16 17:35:00,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.3181818181818181) internal successors, (145), 110 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:35:00,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 145 transitions. [2025-03-16 17:35:00,417 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 145 transitions. Word has length 37 [2025-03-16 17:35:00,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:35:00,417 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 145 transitions. [2025-03-16 17:35:00,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.6) internal successors, (78), 30 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:35:00,417 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 145 transitions. [2025-03-16 17:35:00,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-16 17:35:00,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:35:00,418 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 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] [2025-03-16 17:35:00,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-16 17:35:00,618 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,SelfDestructingSolverStorable13 [2025-03-16 17:35:00,618 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:35:00,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:35:00,619 INFO L85 PathProgramCache]: Analyzing trace with hash 944810425, now seen corresponding path program 5 times [2025-03-16 17:35:00,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:35:00,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897795441] [2025-03-16 17:35:00,619 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 17:35:00,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:35:00,627 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-03-16 17:35:00,636 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 17:35:00,637 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-16 17:35:00,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:01,204 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:35:01,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:35:01,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897795441] [2025-03-16 17:35:01,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897795441] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:35:01,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631948458] [2025-03-16 17:35:01,205 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 17:35:01,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:35:01,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:35:01,206 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) [2025-03-16 17:35:01,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-16 17:35:01,290 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-03-16 17:35:01,318 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 17:35:01,318 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-16 17:35:01,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:35:01,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-16 17:35:01,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:35:01,327 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 [2025-03-16 17:35:01,366 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-16 17:35:01,366 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 [2025-03-16 17:35:01,402 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 [2025-03-16 17:35:01,409 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 [2025-03-16 17:35:01,451 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-16 17:35:01,452 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 [2025-03-16 17:35:01,455 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 [2025-03-16 17:35:01,464 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-16 17:35:01,464 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 [2025-03-16 17:35:01,477 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-16 17:35:01,477 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 [2025-03-16 17:35:01,521 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2025-03-16 17:35:01,521 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 161 treesize of output 119 [2025-03-16 17:35:01,524 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 114 treesize of output 92 [2025-03-16 17:35:01,586 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2025-03-16 17:35:01,586 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 174 treesize of output 137 [2025-03-16 17:35:01,600 INFO L349 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2025-03-16 17:35:01,600 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 130 treesize of output 126 [2025-03-16 17:35:01,605 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 53 treesize of output 35 [2025-03-16 17:35:01,707 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-03-16 17:35:01,707 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 118 treesize of output 49 [2025-03-16 17:35:01,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2025-03-16 17:35:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:35:01,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:35:01,783 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 124 treesize of output 66 [2025-03-16 17:35:01,789 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1038 (Array Int Int))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1038))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1038 (Array Int Int))) (= (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1039))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1038) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))) |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2025-03-16 17:35:01,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:35:01,924 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 [2025-03-16 17:35:01,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:35:01,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 137 [2025-03-16 17:35:01,946 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 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-16 17:35:02,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:35:02,029 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 [2025-03-16 17:35:02,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:35:02,034 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 75 treesize of output 66 [2025-03-16 17:35:02,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:35:02,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 5410 treesize of output 3599 [2025-03-16 17:35:02,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:35:02,125 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 5308 treesize of output 4953 [2025-03-16 17:35:02,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:35:02,204 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 632 treesize of output 630 [2025-03-16 17:35:02,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:35:02,285 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 608 treesize of output 600 [2025-03-16 17:35:02,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:35:02,326 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 758 treesize of output 626 [2025-03-16 17:35:02,348 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 513 treesize of output 417