./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/copy-3-n-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/copy-3-n-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 caaec4b6d97bde36a1fbc7dfb6c9c9f88e0ac7fb0d2e87f4054fca32d8e102e9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:34:28,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:34:28,574 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:34:28,580 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:34:28,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:34:28,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:34:28,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:34:28,606 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:34:28,606 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:34:28,606 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:34:28,607 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:34:28,607 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:34:28,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:34:28,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:34:28,607 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:34:28,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:34:28,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:34:28,607 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:34:28,608 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:34:28,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:34:28,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:34:28,608 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:34:28,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:34:28,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:34:28,608 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:34:28,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:34:28,608 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:34:28,608 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:34:28,608 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:34:28,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:34:28,608 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:34:28,608 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:34:28,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:34:28,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:34:28,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:34:28,609 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:34:28,609 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:34:28,609 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:34:28,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:34:28,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:34:28,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:34:28,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:34:28,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:34:28,609 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 -> caaec4b6d97bde36a1fbc7dfb6c9c9f88e0ac7fb0d2e87f4054fca32d8e102e9 [2025-03-08 00:34:28,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:34:28,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:34:28,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:34:28,829 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:34:28,829 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:34:28,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/copy-3-n-u.c [2025-03-08 00:34:29,933 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1a206e54/d2f9f6742c524b3880d1537fbe7efa74/FLAG370e4c34a [2025-03-08 00:34:30,133 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:34:30,134 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-3-n-u.c [2025-03-08 00:34:30,142 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1a206e54/d2f9f6742c524b3880d1537fbe7efa74/FLAG370e4c34a [2025-03-08 00:34:30,492 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1a206e54/d2f9f6742c524b3880d1537fbe7efa74 [2025-03-08 00:34:30,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:34:30,495 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:34:30,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:34:30,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:34:30,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:34:30,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:34:30" (1/1) ... [2025-03-08 00:34:30,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dfa1513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:30, skipping insertion in model container [2025-03-08 00:34:30,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:34:30" (1/1) ... [2025-03-08 00:34:30,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:34:30,600 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/copy-3-n-u.c[322,335] [2025-03-08 00:34:30,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:34:30,627 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:34:30,634 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/copy-3-n-u.c[322,335] [2025-03-08 00:34:30,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:34:30,652 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:34:30,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:30 WrapperNode [2025-03-08 00:34:30,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:34:30,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:34:30,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:34:30,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:34:30,657 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:34:30" (1/1) ... [2025-03-08 00:34:30,661 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:34:30" (1/1) ... [2025-03-08 00:34:30,671 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2025-03-08 00:34:30,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:34:30,671 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:34:30,671 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:34:30,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:34:30,676 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:30" (1/1) ... [2025-03-08 00:34:30,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:30" (1/1) ... [2025-03-08 00:34:30,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:30" (1/1) ... [2025-03-08 00:34:30,685 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 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:34:30,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:30" (1/1) ... [2025-03-08 00:34:30,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:30" (1/1) ... [2025-03-08 00:34:30,688 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:30" (1/1) ... [2025-03-08 00:34:30,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:30" (1/1) ... [2025-03-08 00:34:30,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:30" (1/1) ... [2025-03-08 00:34:30,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:30" (1/1) ... [2025-03-08 00:34:30,691 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:34:30,691 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:34:30,691 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:34:30,692 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:34:30,692 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:30" (1/1) ... [2025-03-08 00:34:30,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:34:30,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:34:30,713 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:34:30,715 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:34:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:34:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:34:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:34:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:34:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:34:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:34:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:34:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:34:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:34:30,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:34:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:34:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:34:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:34:30,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:34:30,773 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:34:30,774 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:34:30,918 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:34:30,933 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-08 00:34:30,934 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:34:30,943 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:34:30,943 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:34:30,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:34:30 BoogieIcfgContainer [2025-03-08 00:34:30,943 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:34:30,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:34:30,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:34:30,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:34:30,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:34:30" (1/3) ... [2025-03-08 00:34:30,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77da171a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:34:30, skipping insertion in model container [2025-03-08 00:34:30,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:30" (2/3) ... [2025-03-08 00:34:30,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77da171a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:34:30, skipping insertion in model container [2025-03-08 00:34:30,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:34:30" (3/3) ... [2025-03-08 00:34:30,951 INFO L128 eAbstractionObserver]: Analyzing ICFG copy-3-n-u.c [2025-03-08 00:34:30,962 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:34:30,963 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG copy-3-n-u.c that has 1 procedures, 18 locations, 1 initial locations, 9 loop locations, and 1 error locations. [2025-03-08 00:34:31,001 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:34:31,009 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;@516b5ed2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:34:31,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:34:31,012 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:34:31,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 00:34:31,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:34:31,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:34:31,016 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:34:31,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:34:31,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1848885614, now seen corresponding path program 1 times [2025-03-08 00:34:31,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:34:31,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949336037] [2025-03-08 00:34:31,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:34:31,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:34:31,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 00:34:31,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 00:34:31,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:34:31,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:31,186 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:34:31,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:34:31,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949336037] [2025-03-08 00:34:31,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949336037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:34:31,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:34:31,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:34:31,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740209321] [2025-03-08 00:34:31,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:34:31,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:34:31,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:34:31,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:34:31,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:34:31,209 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:34:31,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:34:31,245 INFO L93 Difference]: Finished difference Result 34 states and 52 transitions. [2025-03-08 00:34:31,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:34:31,247 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:34:31,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:34:31,251 INFO L225 Difference]: With dead ends: 34 [2025-03-08 00:34:31,251 INFO L226 Difference]: Without dead ends: 18 [2025-03-08 00:34:31,255 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:34:31,257 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:34:31,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 35 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:34:31,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-08 00:34:31,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2025-03-08 00:34:31,277 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:34:31,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2025-03-08 00:34:31,282 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 24 transitions. Word has length 9 [2025-03-08 00:34:31,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:34:31,282 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 24 transitions. [2025-03-08 00:34:31,282 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:34:31,283 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 24 transitions. [2025-03-08 00:34:31,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 00:34:31,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:34:31,284 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:34:31,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:34:31,285 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:34:31,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:34:31,285 INFO L85 PathProgramCache]: Analyzing trace with hash -2113392682, now seen corresponding path program 1 times [2025-03-08 00:34:31,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:34:31,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39345310] [2025-03-08 00:34:31,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:34:31,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:34:31,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 00:34:31,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 00:34:31,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:34:31,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:31,381 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:34:31,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:34:31,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39345310] [2025-03-08 00:34:31,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39345310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:34:31,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:34:31,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:34:31,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290838080] [2025-03-08 00:34:31,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:34:31,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:34:31,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:34:31,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:34:31,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:34:31,383 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:34:31,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:34:31,436 INFO L93 Difference]: Finished difference Result 39 states and 61 transitions. [2025-03-08 00:34:31,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:34:31,437 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:34:31,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:34:31,438 INFO L225 Difference]: With dead ends: 39 [2025-03-08 00:34:31,438 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 00:34:31,438 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:34:31,439 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 43 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:34:31,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 18 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:34:31,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 00:34:31,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2025-03-08 00:34:31,444 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:34:31,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2025-03-08 00:34:31,445 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 27 transitions. Word has length 11 [2025-03-08 00:34:31,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:34:31,445 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 27 transitions. [2025-03-08 00:34:31,445 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:34:31,445 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2025-03-08 00:34:31,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 00:34:31,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:34:31,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:34:31,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:34:31,449 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:34:31,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:34:31,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1931208308, now seen corresponding path program 1 times [2025-03-08 00:34:31,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:34:31,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7196966] [2025-03-08 00:34:31,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:34:31,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:34:31,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 00:34:31,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:34:31,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:34:31,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:31,525 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:34:31,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:34:31,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7196966] [2025-03-08 00:34:31,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7196966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:34:31,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:34:31,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:34:31,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138338540] [2025-03-08 00:34:31,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:34:31,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:34:31,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:34:31,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:34:31,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:34:31,528 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:34:31,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:34:31,554 INFO L93 Difference]: Finished difference Result 42 states and 61 transitions. [2025-03-08 00:34:31,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:34:31,554 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:34:31,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:34:31,555 INFO L225 Difference]: With dead ends: 42 [2025-03-08 00:34:31,555 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 00:34:31,555 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:34:31,555 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:34:31,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 28 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:34:31,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 00:34:31,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2025-03-08 00:34:31,574 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:34:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2025-03-08 00:34:31,574 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 13 [2025-03-08 00:34:31,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:34:31,574 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2025-03-08 00:34:31,574 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:34:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2025-03-08 00:34:31,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 00:34:31,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:34:31,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:34:31,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:34:31,575 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:34:31,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:34:31,575 INFO L85 PathProgramCache]: Analyzing trace with hash 536396986, now seen corresponding path program 1 times [2025-03-08 00:34:31,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:34:31,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539131286] [2025-03-08 00:34:31,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:34:31,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:34:31,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 00:34:31,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 00:34:31,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:34:31,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:31,643 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:34:31,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:34:31,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539131286] [2025-03-08 00:34:31,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539131286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:34:31,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:34:31,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:34:31,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091494607] [2025-03-08 00:34:31,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:34:31,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:34:31,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:34:31,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:34:31,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:34:31,644 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:34:31,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:34:31,680 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2025-03-08 00:34:31,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:34:31,681 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:34:31,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:34:31,682 INFO L225 Difference]: With dead ends: 49 [2025-03-08 00:34:31,682 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 00:34:31,683 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:34:31,683 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:34:31,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 24 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:34:31,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 00:34:31,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 23. [2025-03-08 00:34:31,693 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:34:31,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2025-03-08 00:34:31,695 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2025-03-08 00:34:31,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:34:31,695 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-03-08 00:34:31,695 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:34:31,696 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2025-03-08 00:34:31,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 00:34:31,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:34:31,696 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:34:31,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 00:34:31,696 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:34:31,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:34:31,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1319651918, now seen corresponding path program 1 times [2025-03-08 00:34:31,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:34:31,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503735786] [2025-03-08 00:34:31,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:34:31,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:34:31,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 00:34:31,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 00:34:31,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:34:31,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:31,786 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:34:31,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:34:31,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503735786] [2025-03-08 00:34:31,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503735786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:34:31,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197694930] [2025-03-08 00:34:31,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:34:31,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:34:31,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:34:31,790 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:34:31,791 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:34:31,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 00:34:31,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 00:34:31,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:34:31,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:31,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:34:31,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:34:31,899 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:34:31,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:34:31,932 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:34:31,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197694930] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:34:31,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:34:31,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 00:34:31,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962075730] [2025-03-08 00:34:31,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:34:31,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:34:31,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:34:31,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:34:31,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:34:31,935 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:34:32,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:34:32,029 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2025-03-08 00:34:32,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:34:32,029 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:34:32,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:34:32,030 INFO L225 Difference]: With dead ends: 64 [2025-03-08 00:34:32,031 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 00:34:32,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:34:32,032 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 94 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:34:32,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 53 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:34:32,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 00:34:32,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2025-03-08 00:34:32,041 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:34:32,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2025-03-08 00:34:32,042 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 19 [2025-03-08 00:34:32,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:34:32,042 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2025-03-08 00:34:32,042 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:34:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2025-03-08 00:34:32,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:34:32,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:34:32,042 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:34:32,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 00:34:32,243 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:34:32,243 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:34:32,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:34:32,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1750155182, now seen corresponding path program 2 times [2025-03-08 00:34:32,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:34:32,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291222779] [2025-03-08 00:34:32,243 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:34:32,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:34:32,258 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-08 00:34:32,274 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:34:32,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:34:32,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:32,349 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:34:32,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:34:32,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291222779] [2025-03-08 00:34:32,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291222779] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:34:32,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943973806] [2025-03-08 00:34:32,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:34:32,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:34:32,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:34:32,353 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:34:32,354 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:34:32,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-08 00:34:32,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:34:32,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:34:32,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:32,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:34:32,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:34:32,516 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:34:32,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:34:32,593 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:34:32,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943973806] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:34:32,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:34:32,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 16 [2025-03-08 00:34:32,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932127964] [2025-03-08 00:34:32,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:34:32,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 00:34:32,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:34:32,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 00:34:32,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:34:32,596 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:34:33,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:34:33,073 INFO L93 Difference]: Finished difference Result 148 states and 202 transitions. [2025-03-08 00:34:33,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-08 00:34:33,074 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:34:33,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:34:33,074 INFO L225 Difference]: With dead ends: 148 [2025-03-08 00:34:33,075 INFO L226 Difference]: Without dead ends: 113 [2025-03-08 00:34:33,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=643, Invalid=1163, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 00:34:33,076 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 268 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:34:33,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 63 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:34:33,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-08 00:34:33,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 82. [2025-03-08 00:34:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 81 states have internal predecessors, (101), 0 states have call successors, (0), 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:34:33,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2025-03-08 00:34:33,106 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 25 [2025-03-08 00:34:33,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:34:33,106 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2025-03-08 00:34:33,106 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:34:33,106 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2025-03-08 00:34:33,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 00:34:33,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:34:33,107 INFO L218 NwaCegarLoop]: trace histogram [20, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:34:33,113 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:34:33,307 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:34:33,308 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:34:33,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:34:33,308 INFO L85 PathProgramCache]: Analyzing trace with hash -154825356, now seen corresponding path program 3 times [2025-03-08 00:34:33,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:34:33,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856408026] [2025-03-08 00:34:33,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:34:33,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:34:33,328 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 15 equivalence classes. [2025-03-08 00:34:33,333 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 51 statements. [2025-03-08 00:34:33,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:34:33,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-03-08 00:34:33,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:34:33,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856408026] [2025-03-08 00:34:33,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856408026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:34:33,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853373490] [2025-03-08 00:34:33,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:34:33,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:34:33,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:34:33,365 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:34:33,366 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:34:33,420 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 15 equivalence classes. [2025-03-08 00:34:33,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 51 statements. [2025-03-08 00:34:33,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:34:33,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:33,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:34:33,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:34:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-03-08 00:34:33,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:34:33,580 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-03-08 00:34:33,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853373490] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:34:33,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:34:33,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 00:34:33,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27722666] [2025-03-08 00:34:33,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:34:33,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:34:33,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:34:33,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:34:33,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:34:33,582 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:33,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:34:33,680 INFO L93 Difference]: Finished difference Result 312 states and 393 transitions. [2025-03-08 00:34:33,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:34:33,680 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-08 00:34:33,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:34:33,683 INFO L225 Difference]: With dead ends: 312 [2025-03-08 00:34:33,685 INFO L226 Difference]: Without dead ends: 261 [2025-03-08 00:34:33,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 97 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:34:33,685 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 207 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:34:33,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 44 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:34:33,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-08 00:34:33,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 152. [2025-03-08 00:34:33,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.1986754966887416) internal successors, (181), 151 states have internal predecessors, (181), 0 states have call successors, (0), 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:34:33,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 181 transitions. [2025-03-08 00:34:33,721 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 181 transitions. Word has length 51 [2025-03-08 00:34:33,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:34:33,721 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 181 transitions. [2025-03-08 00:34:33,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:33,721 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 181 transitions. [2025-03-08 00:34:33,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 00:34:33,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:34:33,724 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:34:33,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 00:34:33,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:34:33,925 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:34:33,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:34:33,926 INFO L85 PathProgramCache]: Analyzing trace with hash 797818258, now seen corresponding path program 4 times [2025-03-08 00:34:33,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:34:33,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418801901] [2025-03-08 00:34:33,926 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:34:33,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:34:33,965 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 121 statements into 2 equivalence classes. [2025-03-08 00:34:34,054 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 00:34:34,054 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:34:34,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:34,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1968 backedges. 379 proven. 1 refuted. 0 times theorem prover too weak. 1588 trivial. 0 not checked. [2025-03-08 00:34:34,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:34:34,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418801901] [2025-03-08 00:34:34,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418801901] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:34:34,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955169688] [2025-03-08 00:34:34,248 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:34:34,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:34:34,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:34:34,250 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:34:34,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 00:34:34,353 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 121 statements into 2 equivalence classes. [2025-03-08 00:34:35,104 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 79 of 121 statements. [2025-03-08 00:34:35,104 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:34:35,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:35,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 160 conjuncts are in the unsatisfiable core [2025-03-08 00:34:35,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:34:35,261 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:34:35,333 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-08 00:34:35,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2025-03-08 00:34:35,389 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-08 00:34:35,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2025-03-08 00:34:35,433 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-08 00:34:35,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2025-03-08 00:34:35,479 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-08 00:34:35,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2025-03-08 00:34:35,523 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-08 00:34:35,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2025-03-08 00:34:35,569 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-08 00:34:35,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2025-03-08 00:34:35,618 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-08 00:34:35,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2025-03-08 00:34:35,666 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-08 00:34:35,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2025-03-08 00:34:35,710 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-08 00:34:35,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2025-03-08 00:34:35,832 INFO L349 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2025-03-08 00:34:35,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 15 [2025-03-08 00:34:35,879 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2025-03-08 00:34:35,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 15 [2025-03-08 00:34:35,928 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2025-03-08 00:34:35,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 15 [2025-03-08 00:34:35,989 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2025-03-08 00:34:35,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 15 [2025-03-08 00:34:36,037 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2025-03-08 00:34:36,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 15 [2025-03-08 00:34:36,099 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2025-03-08 00:34:36,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 15 [2025-03-08 00:34:36,154 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2025-03-08 00:34:36,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 15 [2025-03-08 00:34:36,220 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2025-03-08 00:34:36,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 15 [2025-03-08 00:34:36,275 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2025-03-08 00:34:36,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 15 [2025-03-08 00:34:36,338 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2025-03-08 00:34:36,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 15 [2025-03-08 00:34:36,482 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2025-03-08 00:34:36,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 15 [2025-03-08 00:34:36,530 INFO L349 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2025-03-08 00:34:36,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 15 [2025-03-08 00:34:36,586 INFO L349 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2025-03-08 00:34:36,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 15 [2025-03-08 00:34:36,642 INFO L349 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2025-03-08 00:34:36,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 15 [2025-03-08 00:34:36,697 INFO L349 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2025-03-08 00:34:36,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 15 [2025-03-08 00:34:36,764 INFO L349 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2025-03-08 00:34:36,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 15 [2025-03-08 00:34:36,825 INFO L349 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2025-03-08 00:34:36,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 15 [2025-03-08 00:34:36,883 INFO L349 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2025-03-08 00:34:36,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 15 [2025-03-08 00:34:36,946 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2025-03-08 00:34:36,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 15 [2025-03-08 00:34:37,007 INFO L349 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2025-03-08 00:34:37,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 15 [2025-03-08 00:34:37,152 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2025-03-08 00:34:37,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 15 [2025-03-08 00:34:37,206 INFO L349 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2025-03-08 00:34:37,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 15 [2025-03-08 00:34:37,266 INFO L349 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2025-03-08 00:34:37,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 15 [2025-03-08 00:34:37,328 INFO L349 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2025-03-08 00:34:37,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 15 [2025-03-08 00:34:37,388 INFO L349 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2025-03-08 00:34:37,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 15 [2025-03-08 00:34:37,456 INFO L349 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2025-03-08 00:34:37,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 15 [2025-03-08 00:34:37,523 INFO L349 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2025-03-08 00:34:37,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 15 [2025-03-08 00:34:37,585 INFO L349 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2025-03-08 00:34:37,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 15 [2025-03-08 00:34:37,647 INFO L349 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2025-03-08 00:34:37,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 15 [2025-03-08 00:34:37,707 INFO L349 Elim1Store]: treesize reduction 44, result has 13.7 percent of original size [2025-03-08 00:34:37,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 15 [2025-03-08 00:34:37,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1968 backedges. 148 proven. 847 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2025-03-08 00:34:37,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:34:39,252 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_609 Int) (v_ArrVal_608 Int) (|v_ULTIMATE.start_main_~k~0#1_208| Int)) (or (< |v_ULTIMATE.start_main_~k~0#1_208| (+ |c_ULTIMATE.start_main_~k~0#1| 1)) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#B~0#1.base|) |c_ULTIMATE.start_main_~#B~0#1.offset|) (select (let ((.cse2 (* |c_ULTIMATE.start_main_~p~0#1| 4))) (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| .cse2)) (.cse1 (* (* |c_ULTIMATE.start_main_~n~0#1| .cse2) |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1 (* 4 |c_ULTIMATE.start_main_~k~0#1|)) v_ArrVal_608) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1 (* 4 |v_ULTIMATE.start_main_~k~0#1_208|)) v_ArrVal_609))) |c_ULTIMATE.start_main_~#A~0#1.offset|)))) is different from false [2025-03-08 00:35:20,874 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~k~0#1_209| Int) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (|v_ULTIMATE.start_main_~k~0#1_208| Int) (v_ArrVal_606 Int) (v_ArrVal_604 Int) (|v_ULTIMATE.start_main_~k~0#1_210| Int)) (or (< |v_ULTIMATE.start_main_~k~0#1_209| (+ |v_ULTIMATE.start_main_~k~0#1_210| 1)) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#B~0#1.base|) |c_ULTIMATE.start_main_~#B~0#1.offset|) (select (let ((.cse2 (* |c_ULTIMATE.start_main_~p~0#1| 4))) (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| .cse2)) (.cse1 (* (* |c_ULTIMATE.start_main_~n~0#1| .cse2) |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1 (* 4 |c_ULTIMATE.start_main_~k~0#1|)) v_ArrVal_604) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 (* 4 |v_ULTIMATE.start_main_~k~0#1_210|) .cse1) v_ArrVal_606) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1 (* 4 |v_ULTIMATE.start_main_~k~0#1_209|)) v_ArrVal_608) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1 (* 4 |v_ULTIMATE.start_main_~k~0#1_208|)) v_ArrVal_609))) |c_ULTIMATE.start_main_~#A~0#1.offset|)) (< |v_ULTIMATE.start_main_~k~0#1_208| (+ |v_ULTIMATE.start_main_~k~0#1_209| 1)) (< |v_ULTIMATE.start_main_~k~0#1_210| (+ |c_ULTIMATE.start_main_~k~0#1| 1)))) is different from false [2025-03-08 00:36:02,054 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_599 Int) (|v_ULTIMATE.start_main_~k~0#1_209| Int) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (|v_ULTIMATE.start_main_~k~0#1_208| Int) (v_ArrVal_606 Int) (v_ArrVal_604 Int) (|v_ULTIMATE.start_main_~k~0#1_212| Int) (v_ArrVal_601 Int) (|v_ULTIMATE.start_main_~k~0#1_210| Int) (|v_ULTIMATE.start_main_~k~0#1_211| Int)) (or (= (select (let ((.cse2 (* |c_ULTIMATE.start_main_~p~0#1| 4))) (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| .cse2)) (.cse1 (* (* |c_ULTIMATE.start_main_~n~0#1| .cse2) |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (store (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1 (* 4 |c_ULTIMATE.start_main_~k~0#1|)) v_ArrVal_599) (+ (* 4 |v_ULTIMATE.start_main_~k~0#1_212|) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1) v_ArrVal_601) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 (* 4 |v_ULTIMATE.start_main_~k~0#1_211|) .cse1) v_ArrVal_604) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 (* 4 |v_ULTIMATE.start_main_~k~0#1_210|) .cse1) v_ArrVal_606) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1 (* 4 |v_ULTIMATE.start_main_~k~0#1_209|)) v_ArrVal_608) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1 (* 4 |v_ULTIMATE.start_main_~k~0#1_208|)) v_ArrVal_609))) |c_ULTIMATE.start_main_~#A~0#1.offset|) (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#B~0#1.base|) |c_ULTIMATE.start_main_~#B~0#1.offset|)) (< |v_ULTIMATE.start_main_~k~0#1_209| (+ |v_ULTIMATE.start_main_~k~0#1_210| 1)) (< |v_ULTIMATE.start_main_~k~0#1_212| (+ |c_ULTIMATE.start_main_~k~0#1| 1)) (< |v_ULTIMATE.start_main_~k~0#1_210| (+ |v_ULTIMATE.start_main_~k~0#1_211| 1)) (< |v_ULTIMATE.start_main_~k~0#1_208| (+ |v_ULTIMATE.start_main_~k~0#1_209| 1)) (< |v_ULTIMATE.start_main_~k~0#1_211| (+ |v_ULTIMATE.start_main_~k~0#1_212| 1)))) is different from false [2025-03-08 00:36:06,104 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~k~0#1_209| Int) (v_ArrVal_609 Int) (v_ArrVal_608 Int) (|v_ULTIMATE.start_main_~k~0#1_208| Int) (v_ArrVal_606 Int) (v_ArrVal_604 Int) (|v_ULTIMATE.start_main_~k~0#1_212| Int) (|v_ULTIMATE.start_main_~k~0#1_213| Int) (v_ArrVal_601 Int) (|v_ULTIMATE.start_main_~k~0#1_210| Int) (|v_ULTIMATE.start_main_~k~0#1_211| Int) (v_ArrVal_599 Int) (v_ArrVal_598 Int)) (or (< |v_ULTIMATE.start_main_~k~0#1_209| (+ |v_ULTIMATE.start_main_~k~0#1_210| 1)) (< |v_ULTIMATE.start_main_~k~0#1_213| (+ |c_ULTIMATE.start_main_~k~0#1| 1)) (= (select (let ((.cse2 (* |c_ULTIMATE.start_main_~p~0#1| 4))) (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| .cse2)) (.cse1 (* (* |c_ULTIMATE.start_main_~n~0#1| .cse2) |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (store (store (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1 (* 4 |c_ULTIMATE.start_main_~k~0#1|)) v_ArrVal_598) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| (* 4 |v_ULTIMATE.start_main_~k~0#1_213|) .cse0 .cse1) v_ArrVal_599) (+ (* 4 |v_ULTIMATE.start_main_~k~0#1_212|) |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1) v_ArrVal_601) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 (* 4 |v_ULTIMATE.start_main_~k~0#1_211|) .cse1) v_ArrVal_604) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 (* 4 |v_ULTIMATE.start_main_~k~0#1_210|) .cse1) v_ArrVal_606) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1 (* 4 |v_ULTIMATE.start_main_~k~0#1_209|)) v_ArrVal_608) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1 (* 4 |v_ULTIMATE.start_main_~k~0#1_208|)) v_ArrVal_609))) |c_ULTIMATE.start_main_~#A~0#1.offset|) (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#B~0#1.base|) |c_ULTIMATE.start_main_~#B~0#1.offset|)) (< |v_ULTIMATE.start_main_~k~0#1_210| (+ |v_ULTIMATE.start_main_~k~0#1_211| 1)) (< |v_ULTIMATE.start_main_~k~0#1_212| (+ |v_ULTIMATE.start_main_~k~0#1_213| 1)) (< |v_ULTIMATE.start_main_~k~0#1_208| (+ |v_ULTIMATE.start_main_~k~0#1_209| 1)) (< |v_ULTIMATE.start_main_~k~0#1_211| (+ |v_ULTIMATE.start_main_~k~0#1_212| 1)))) is different from false