./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/rev-3-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/array-multidimensional/rev-3-u.c -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 fe3cf414f0e241a9a4e73e59647cf6619ea50b905df4a1c2a404b3413992b780 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:36:35,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:36:35,383 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:36:35,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:36:35,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:36:35,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:36:35,409 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:36:35,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:36:35,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:36:35,410 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:36:35,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:36:35,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:36:35,410 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:36:35,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:36:35,410 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:36:35,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:36:35,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:36:35,410 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:36:35,410 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:36:35,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:36:35,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:36:35,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:36:35,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:36:35,411 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:36:35,411 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:36:35,411 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:36:35,411 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:36:35,411 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:36:35,411 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:36:35,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:36:35,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:36:35,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:36:35,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:36:35,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:36:35,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:36:35,412 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:36:35,412 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:36:35,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:36:35,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:36:35,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:36:35,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:36:35,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:36:35,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:36:35,413 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 -> fe3cf414f0e241a9a4e73e59647cf6619ea50b905df4a1c2a404b3413992b780 [2025-03-08 00:36:35,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:36:35,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:36:35,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:36:35,629 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:36:35,629 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:36:35,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/rev-3-u.c [2025-03-08 00:36:36,731 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4a5a2686/c0663e150dec4eddb1db70fc7eb748a9/FLAGf707a2008 [2025-03-08 00:36:36,946 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:36:36,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-3-u.c [2025-03-08 00:36:36,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4a5a2686/c0663e150dec4eddb1db70fc7eb748a9/FLAGf707a2008 [2025-03-08 00:36:37,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4a5a2686/c0663e150dec4eddb1db70fc7eb748a9 [2025-03-08 00:36:37,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:36:37,304 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:36:37,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:36:37,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:36:37,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:36:37,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:36:37" (1/1) ... [2025-03-08 00:36:37,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404a5b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:37, skipping insertion in model container [2025-03-08 00:36:37,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:36:37" (1/1) ... [2025-03-08 00:36:37,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:36:37,415 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/array-multidimensional/rev-3-u.c[319,332] [2025-03-08 00:36:37,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:36:37,446 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:36:37,453 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/array-multidimensional/rev-3-u.c[319,332] [2025-03-08 00:36:37,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:36:37,473 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:36:37,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:37 WrapperNode [2025-03-08 00:36:37,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:36:37,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:36:37,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:36:37,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:36:37,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:37" (1/1) ... [2025-03-08 00:36:37,483 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:37" (1/1) ... [2025-03-08 00:36:37,496 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2025-03-08 00:36:37,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:36:37,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:36:37,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:36:37,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:36:37,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:37" (1/1) ... [2025-03-08 00:36:37,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:37" (1/1) ... [2025-03-08 00:36:37,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:37" (1/1) ... [2025-03-08 00:36:37,518 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-03-08 00:36:37,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:37" (1/1) ... [2025-03-08 00:36:37,519 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:37" (1/1) ... [2025-03-08 00:36:37,521 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:37" (1/1) ... [2025-03-08 00:36:37,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:37" (1/1) ... [2025-03-08 00:36:37,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:37" (1/1) ... [2025-03-08 00:36:37,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:37" (1/1) ... [2025-03-08 00:36:37,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:36:37,524 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:36:37,524 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:36:37,524 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:36:37,525 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:37" (1/1) ... [2025-03-08 00:36:37,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:36:37,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:36:37,554 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-08 00:36:37,561 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-08 00:36:37,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:36:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:36:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:36:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:36:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:36:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:36:37,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:36:37,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:36:37,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:36:37,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:36:37,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:36:37,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:36:37,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:36:37,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:36:37,647 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:36:37,648 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:36:37,774 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18: call ULTIMATE.dealloc(main_~#A~0#1.base, main_~#A~0#1.offset);havoc main_~#A~0#1.base, main_~#A~0#1.offset;call ULTIMATE.dealloc(main_~#B~0#1.base, main_~#B~0#1.offset);havoc main_~#B~0#1.base, main_~#B~0#1.offset; [2025-03-08 00:36:37,782 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-08 00:36:37,782 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:36:37,787 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:36:37,787 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:36:37,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:36:37 BoogieIcfgContainer [2025-03-08 00:36:37,789 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:36:37,791 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:36:37,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:36:37,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:36:37,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:36:37" (1/3) ... [2025-03-08 00:36:37,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557eb9af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:36:37, skipping insertion in model container [2025-03-08 00:36:37,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:36:37" (2/3) ... [2025-03-08 00:36:37,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557eb9af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:36:37, skipping insertion in model container [2025-03-08 00:36:37,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:36:37" (3/3) ... [2025-03-08 00:36:37,799 INFO L128 eAbstractionObserver]: Analyzing ICFG rev-3-u.c [2025-03-08 00:36:37,811 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:36:37,813 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rev-3-u.c that has 1 procedures, 18 locations, 1 initial locations, 9 loop locations, and 1 error locations. [2025-03-08 00:36:37,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:36:37,862 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;@15132cce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:36:37,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:36:37,865 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 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-08 00:36:37,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 00:36:37,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:36:37,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:36:37,870 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:36:37,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:36:37,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1848885614, now seen corresponding path program 1 times [2025-03-08 00:36:37,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:36:37,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963537956] [2025-03-08 00:36:37,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:36:37,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:36:37,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 00:36:37,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 00:36:37,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:36:37,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:38,056 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-08 00:36:38,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:36:38,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963537956] [2025-03-08 00:36:38,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963537956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:36:38,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:36:38,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:36:38,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176925085] [2025-03-08 00:36:38,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:36:38,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:36:38,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:36:38,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:36:38,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:36:38,082 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 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) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:36:38,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:36:38,126 INFO L93 Difference]: Finished difference Result 34 states and 52 transitions. [2025-03-08 00:36:38,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:36:38,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 00:36:38,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:36:38,131 INFO L225 Difference]: With dead ends: 34 [2025-03-08 00:36:38,131 INFO L226 Difference]: Without dead ends: 18 [2025-03-08 00:36:38,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:36:38,137 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:36:38,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 27 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:36:38,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-08 00:36:38,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2025-03-08 00:36:38,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 0 states have call successors, (0), 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-08 00:36:38,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2025-03-08 00:36:38,155 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 24 transitions. Word has length 9 [2025-03-08 00:36:38,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:36:38,155 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 24 transitions. [2025-03-08 00:36:38,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:36:38,155 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 24 transitions. [2025-03-08 00:36:38,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 00:36:38,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:36:38,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:36:38,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:36:38,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:36:38,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:36:38,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2113392682, now seen corresponding path program 1 times [2025-03-08 00:36:38,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:36:38,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458446345] [2025-03-08 00:36:38,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:36:38,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:36:38,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 00:36:38,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 00:36:38,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:36:38,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:38,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:36:38,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:36:38,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458446345] [2025-03-08 00:36:38,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458446345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:36:38,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:36:38,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:36:38,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389907984] [2025-03-08 00:36:38,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:36:38,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:36:38,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:36:38,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:36:38,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:36:38,253 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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-08 00:36:38,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:36:38,320 INFO L93 Difference]: Finished difference Result 39 states and 61 transitions. [2025-03-08 00:36:38,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:36:38,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2025-03-08 00:36:38,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:36:38,321 INFO L225 Difference]: With dead ends: 39 [2025-03-08 00:36:38,321 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 00:36:38,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:36:38,322 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 43 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:36:38,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 11 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:36:38,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 00:36:38,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2025-03-08 00:36:38,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 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-08 00:36:38,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2025-03-08 00:36:38,325 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 27 transitions. Word has length 11 [2025-03-08 00:36:38,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:36:38,326 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 27 transitions. [2025-03-08 00:36:38,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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-08 00:36:38,326 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2025-03-08 00:36:38,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 00:36:38,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:36:38,326 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:36:38,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:36:38,326 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:36:38,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:36:38,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1931208308, now seen corresponding path program 1 times [2025-03-08 00:36:38,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:36:38,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997041807] [2025-03-08 00:36:38,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:36:38,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:36:38,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 00:36:38,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:36:38,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:36:38,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:38,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:36:38,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:36:38,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997041807] [2025-03-08 00:36:38,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997041807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:36:38,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:36:38,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:36:38,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496059867] [2025-03-08 00:36:38,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:36:38,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:36:38,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:36:38,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:36:38,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:36:38,414 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-08 00:36:38,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:36:38,450 INFO L93 Difference]: Finished difference Result 42 states and 61 transitions. [2025-03-08 00:36:38,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:36:38,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-03-08 00:36:38,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:36:38,451 INFO L225 Difference]: With dead ends: 42 [2025-03-08 00:36:38,451 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 00:36:38,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:36:38,452 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 30 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:36:38,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 9 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:36:38,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 00:36:38,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2025-03-08 00:36:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 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-08 00:36:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2025-03-08 00:36:38,456 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 13 [2025-03-08 00:36:38,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:36:38,456 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2025-03-08 00:36:38,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-08 00:36:38,457 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2025-03-08 00:36:38,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 00:36:38,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:36:38,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:36:38,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:36:38,457 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:36:38,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:36:38,458 INFO L85 PathProgramCache]: Analyzing trace with hash 536396986, now seen corresponding path program 1 times [2025-03-08 00:36:38,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:36:38,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87074706] [2025-03-08 00:36:38,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:36:38,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:36:38,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 00:36:38,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 00:36:38,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:36:38,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:38,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:36:38,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:36:38,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87074706] [2025-03-08 00:36:38,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87074706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:36:38,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:36:38,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:36:38,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156358942] [2025-03-08 00:36:38,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:36:38,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:36:38,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:36:38,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:36:38,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:36:38,516 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-08 00:36:38,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:36:38,558 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2025-03-08 00:36:38,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:36:38,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-08 00:36:38,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:36:38,559 INFO L225 Difference]: With dead ends: 49 [2025-03-08 00:36:38,559 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 00:36:38,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:36:38,560 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 32 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:36:38,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 12 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:36:38,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 00:36:38,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 23. [2025-03-08 00:36:38,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:36:38,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2025-03-08 00:36:38,564 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2025-03-08 00:36:38,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:36:38,564 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-03-08 00:36:38,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-08 00:36:38,565 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2025-03-08 00:36:38,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 00:36:38,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:36:38,565 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-08 00:36:38,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 00:36:38,565 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:36:38,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:36:38,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1319651918, now seen corresponding path program 1 times [2025-03-08 00:36:38,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:36:38,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100974836] [2025-03-08 00:36:38,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:36:38,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:36:38,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 00:36:38,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 00:36:38,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:36:38,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:38,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:36:38,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:36:38,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100974836] [2025-03-08 00:36:38,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100974836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:36:38,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480068948] [2025-03-08 00:36:38,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:36:38,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:36:38,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:36:38,639 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-08 00:36:38,641 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-08 00:36:38,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 00:36:38,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 00:36:38,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:36:38,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:38,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:36:38,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:36:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:36:38,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:36:38,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:36:38,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480068948] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:36:38,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:36:38,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 00:36:38,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634742881] [2025-03-08 00:36:38,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:36:38,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:36:38,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:36:38,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:36:38,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:36:38,765 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 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-08 00:36:38,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:36:38,860 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2025-03-08 00:36:38,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:36:38,861 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 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 19 [2025-03-08 00:36:38,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:36:38,861 INFO L225 Difference]: With dead ends: 64 [2025-03-08 00:36:38,862 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 00:36:38,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:36:38,863 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 94 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:36:38,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 18 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:36:38,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 00:36:38,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2025-03-08 00:36:38,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 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-08 00:36:38,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2025-03-08 00:36:38,873 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 19 [2025-03-08 00:36:38,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:36:38,873 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2025-03-08 00:36:38,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 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-08 00:36:38,873 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2025-03-08 00:36:38,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:36:38,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:36:38,876 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:36:38,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 00:36:39,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:36:39,077 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:36:39,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:36:39,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1750155182, now seen corresponding path program 2 times [2025-03-08 00:36:39,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:36:39,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582703946] [2025-03-08 00:36:39,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:36:39,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:36:39,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-08 00:36:39,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:36:39,107 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:36:39,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:39,178 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 00:36:39,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:36:39,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582703946] [2025-03-08 00:36:39,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582703946] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:36:39,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258058880] [2025-03-08 00:36:39,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:36:39,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:36:39,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:36:39,182 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-08 00:36:39,182 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-08 00:36:39,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-08 00:36:39,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:36:39,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:36:39,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:39,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:36:39,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:36:39,317 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:36:39,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:36:39,375 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:36:39,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258058880] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:36:39,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:36:39,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 16 [2025-03-08 00:36:39,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551181854] [2025-03-08 00:36:39,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:36:39,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 00:36:39,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:36:39,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 00:36:39,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:36:39,376 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:36:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:36:39,943 INFO L93 Difference]: Finished difference Result 283 states and 370 transitions. [2025-03-08 00:36:39,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-08 00:36:39,944 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-08 00:36:39,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:36:39,947 INFO L225 Difference]: With dead ends: 283 [2025-03-08 00:36:39,947 INFO L226 Difference]: Without dead ends: 248 [2025-03-08 00:36:39,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=629, Invalid=1093, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 00:36:39,948 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 700 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:36:39,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 42 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:36:39,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-08 00:36:39,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 96. [2025-03-08 00:36:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.231578947368421) internal successors, (117), 95 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:36:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2025-03-08 00:36:39,967 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 25 [2025-03-08 00:36:39,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:36:39,968 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2025-03-08 00:36:39,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:36:39,968 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2025-03-08 00:36:39,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 00:36:39,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:36:39,969 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:36:39,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 00:36:40,169 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,SelfDestructingSolverStorable5 [2025-03-08 00:36:40,170 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:36:40,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:36:40,170 INFO L85 PathProgramCache]: Analyzing trace with hash -677073902, now seen corresponding path program 3 times [2025-03-08 00:36:40,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:36:40,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354244986] [2025-03-08 00:36:40,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:36:40,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:36:40,207 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 15 equivalence classes. [2025-03-08 00:36:40,316 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 61 of 65 statements. [2025-03-08 00:36:40,316 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-03-08 00:36:40,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 126 proven. 55 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2025-03-08 00:36:40,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:36:40,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354244986] [2025-03-08 00:36:40,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354244986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:36:40,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878578016] [2025-03-08 00:36:40,690 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:36:40,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:36:40,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:36:40,693 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-08 00:36:40,695 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-08 00:36:40,753 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 15 equivalence classes. [2025-03-08 00:36:47,387 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 57 of 65 statements. [2025-03-08 00:36:47,387 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-03-08 00:36:47,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:47,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 132 conjuncts are in the unsatisfiable core [2025-03-08 00:36:47,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:36:47,654 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 33 treesize of output 1 [2025-03-08 00:36:47,760 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 11 [2025-03-08 00:36:47,808 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 26 [2025-03-08 00:36:47,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:36:47,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2025-03-08 00:36:47,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:36:47,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 54 [2025-03-08 00:36:47,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:36:47,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 68 [2025-03-08 00:36:48,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:36:48,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 82 [2025-03-08 00:36:48,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:36:48,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 82 treesize of output 96 [2025-03-08 00:36:48,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:36:48,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 93 treesize of output 110 [2025-03-08 00:36:48,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:36:48,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 104 treesize of output 124 [2025-03-08 00:36:48,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:48,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:48,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:48,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:48,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:48,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:48,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:48,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:48,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:48,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:36:48,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 121 treesize of output 144 [2025-03-08 00:36:48,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:48,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:48,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:48,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:48,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:48,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:48,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:48,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:48,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:48,876 INFO L349 Elim1Store]: treesize reduction 442, result has 14.2 percent of original size [2025-03-08 00:36:48,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 55 case distinctions, treesize of input 151 treesize of output 177 [2025-03-08 00:36:49,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,185 INFO L349 Elim1Store]: treesize reduction 639, result has 12.2 percent of original size [2025-03-08 00:36:49,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 66 case distinctions, treesize of input 182 treesize of output 211 [2025-03-08 00:36:49,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,514 INFO L349 Elim1Store]: treesize reduction 801, result has 10.0 percent of original size [2025-03-08 00:36:49,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 45 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 77 case distinctions, treesize of input 213 treesize of output 245 [2025-03-08 00:36:49,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:49,881 INFO L349 Elim1Store]: treesize reduction 963, result has 8.5 percent of original size [2025-03-08 00:36:49,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 45 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 89 case distinctions, treesize of input 244 treesize of output 279 [2025-03-08 00:36:50,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,275 INFO L349 Elim1Store]: treesize reduction 1125, result has 7.3 percent of original size [2025-03-08 00:36:50,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 45 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 102 case distinctions, treesize of input 275 treesize of output 313 [2025-03-08 00:36:50,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,745 INFO L349 Elim1Store]: treesize reduction 1287, result has 6.5 percent of original size [2025-03-08 00:36:50,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 45 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 116 case distinctions, treesize of input 306 treesize of output 347 [2025-03-08 00:36:50,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:50,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:51,235 INFO L349 Elim1Store]: treesize reduction 1449, result has 5.8 percent of original size [2025-03-08 00:36:51,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 45 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 131 case distinctions, treesize of input 337 treesize of output 381 [2025-03-08 00:36:51,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:51,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:51,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:51,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:51,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:51,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:51,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:51,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:51,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:51,803 INFO L349 Elim1Store]: treesize reduction 1611, result has 5.2 percent of original size [2025-03-08 00:36:51,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 17 select indices, 17 select index equivalence classes, 45 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 147 case distinctions, treesize of input 368 treesize of output 415 [2025-03-08 00:36:52,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:52,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:52,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:52,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:52,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:52,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:52,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:52,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:52,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:52,482 INFO L349 Elim1Store]: treesize reduction 1773, result has 4.8 percent of original size [2025-03-08 00:36:52,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 45 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 164 case distinctions, treesize of input 399 treesize of output 449 [2025-03-08 00:36:52,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:52,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:52,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:52,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:52,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:52,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:52,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:52,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:52,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:36:53,271 INFO L349 Elim1Store]: treesize reduction 1927, result has 4.4 percent of original size [2025-03-08 00:36:53,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 19 select indices, 19 select index equivalence classes, 45 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 182 case distinctions, treesize of input 429 treesize of output 482 [2025-03-08 00:38:04,902 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 60 proven. 318 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-08 00:38:04,903 INFO L312 TraceCheckSpWp]: Computing backward predicates...