./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-cav19/array_init_var_plus_ind2.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-cav19/array_init_var_plus_ind2.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 61ee7f467544bc9f9ea1f0d9fd399b9972cb81a4a1640bca414247c42e8cc99d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:41:33,270 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:41:33,322 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:41:33,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:41:33,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:41:33,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:41:33,355 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:41:33,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:41:33,355 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:41:33,356 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:41:33,356 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:41:33,357 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:41:33,357 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:41:33,357 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:41:33,357 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:41:33,357 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:41:33,357 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:41:33,358 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:41:33,358 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:41:33,358 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:41:33,358 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:41:33,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:41:33,358 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:41:33,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:41:33,358 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:41:33,358 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:41:33,358 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:41:33,358 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:41:33,359 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:41:33,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:41:33,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:41:33,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:41:33,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:41:33,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:41:33,359 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:41:33,359 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:41:33,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:41:33,360 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:41:33,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:41:33,360 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:41:33,360 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:41:33,360 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:41:33,360 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:41:33,360 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 -> 61ee7f467544bc9f9ea1f0d9fd399b9972cb81a4a1640bca414247c42e8cc99d [2025-03-08 00:41:33,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:41:33,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:41:33,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:41:33,590 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:41:33,590 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:41:33,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-cav19/array_init_var_plus_ind2.c [2025-03-08 00:41:34,762 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a14d731b/c8de8b2c30dd47e0b5052733c1c42ffe/FLAG0257e3509 [2025-03-08 00:41:34,985 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:41:34,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_init_var_plus_ind2.c [2025-03-08 00:41:34,994 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a14d731b/c8de8b2c30dd47e0b5052733c1c42ffe/FLAG0257e3509 [2025-03-08 00:41:35,008 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a14d731b/c8de8b2c30dd47e0b5052733c1c42ffe [2025-03-08 00:41:35,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:41:35,011 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:41:35,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:41:35,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:41:35,017 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:41:35,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:41:35" (1/1) ... [2025-03-08 00:41:35,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a962d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:35, skipping insertion in model container [2025-03-08 00:41:35,019 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:41:35" (1/1) ... [2025-03-08 00:41:35,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:41:35,135 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-cav19/array_init_var_plus_ind2.c[415,428] [2025-03-08 00:41:35,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:41:35,157 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:41:35,164 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-cav19/array_init_var_plus_ind2.c[415,428] [2025-03-08 00:41:35,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:41:35,180 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:41:35,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:35 WrapperNode [2025-03-08 00:41:35,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:41:35,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:41:35,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:41:35,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:41:35,187 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:41:35" (1/1) ... [2025-03-08 00:41:35,193 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:41:35" (1/1) ... [2025-03-08 00:41:35,203 INFO L138 Inliner]: procedures = 15, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2025-03-08 00:41:35,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:41:35,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:41:35,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:41:35,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:41:35,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:35" (1/1) ... [2025-03-08 00:41:35,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:35" (1/1) ... [2025-03-08 00:41:35,211 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:35" (1/1) ... [2025-03-08 00:41:35,222 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-08 00:41:35,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:35" (1/1) ... [2025-03-08 00:41:35,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:35" (1/1) ... [2025-03-08 00:41:35,229 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:35" (1/1) ... [2025-03-08 00:41:35,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:35" (1/1) ... [2025-03-08 00:41:35,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:35" (1/1) ... [2025-03-08 00:41:35,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:35" (1/1) ... [2025-03-08 00:41:35,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:41:35,236 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:41:35,236 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:41:35,236 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:41:35,236 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:35" (1/1) ... [2025-03-08 00:41:35,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:41:35,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:35,263 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:41:35,265 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:41:35,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:41:35,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:41:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:41:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:41:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:41:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:41:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:41:35,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:41:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:41:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:41:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:41:35,330 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:41:35,331 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:41:35,433 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2025-03-08 00:41:35,440 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 00:41:35,440 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:41:35,447 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:41:35,447 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:41:35,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:41:35 BoogieIcfgContainer [2025-03-08 00:41:35,448 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:41:35,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:41:35,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:41:35,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:41:35,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:41:35" (1/3) ... [2025-03-08 00:41:35,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617e0de8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:41:35, skipping insertion in model container [2025-03-08 00:41:35,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:41:35" (2/3) ... [2025-03-08 00:41:35,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617e0de8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:41:35, skipping insertion in model container [2025-03-08 00:41:35,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:41:35" (3/3) ... [2025-03-08 00:41:35,456 INFO L128 eAbstractionObserver]: Analyzing ICFG array_init_var_plus_ind2.c [2025-03-08 00:41:35,466 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:41:35,469 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array_init_var_plus_ind2.c that has 1 procedures, 13 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 00:41:35,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:41:35,519 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;@35f15d12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:41:35,520 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:41:35,522 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:35,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 00:41:35,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:35,526 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:35,527 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:35,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:35,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1039786094, now seen corresponding path program 1 times [2025-03-08 00:41:35,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:35,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88575633] [2025-03-08 00:41:35,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:41:35,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:35,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 00:41:35,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 00:41:35,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:41:35,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:35,718 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:41:35,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:35,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88575633] [2025-03-08 00:41:35,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88575633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:41:35,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:41:35,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:41:35,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823951615] [2025-03-08 00:41:35,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:41:35,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:41:35,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:35,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:41:35,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:41:35,738 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:41:35,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:35,767 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2025-03-08 00:41:35,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:41:35,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2025-03-08 00:41:35,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:35,773 INFO L225 Difference]: With dead ends: 30 [2025-03-08 00:41:35,773 INFO L226 Difference]: Without dead ends: 18 [2025-03-08 00:41:35,778 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:41:35,780 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 31 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:35,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 16 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:41:35,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-08 00:41:35,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 11. [2025-03-08 00:41:35,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 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:41:35,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2025-03-08 00:41:35,805 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 7 [2025-03-08 00:41:35,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:35,806 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-03-08 00:41:35,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:41:35,806 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2025-03-08 00:41:35,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 00:41:35,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:35,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:35,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:41:35,807 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:35,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:35,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2141847483, now seen corresponding path program 1 times [2025-03-08 00:41:35,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:35,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474831305] [2025-03-08 00:41:35,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:41:35,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:35,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 00:41:35,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 00:41:35,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:41:35,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:35,887 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:41:35,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:35,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474831305] [2025-03-08 00:41:35,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474831305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:41:35,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:41:35,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:41:35,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649287350] [2025-03-08 00:41:35,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:41:35,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:41:35,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:35,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:41:35,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:41:35,891 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:41:35,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:35,913 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2025-03-08 00:41:35,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:41:35,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2025-03-08 00:41:35,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:35,914 INFO L225 Difference]: With dead ends: 19 [2025-03-08 00:41:35,914 INFO L226 Difference]: Without dead ends: 12 [2025-03-08 00:41:35,914 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:41:35,915 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:35,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:41:35,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-08 00:41:35,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-08 00:41:35,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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:41:35,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2025-03-08 00:41:35,918 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 8 [2025-03-08 00:41:35,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:35,918 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-03-08 00:41:35,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:41:35,918 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2025-03-08 00:41:35,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 00:41:35,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:35,918 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:35,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:41:35,919 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:35,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:35,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2035593711, now seen corresponding path program 1 times [2025-03-08 00:41:35,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:35,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192607363] [2025-03-08 00:41:35,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:41:35,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:35,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 00:41:35,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 00:41:35,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:41:35,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:36,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:36,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:36,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192607363] [2025-03-08 00:41:36,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192607363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:41:36,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21776310] [2025-03-08 00:41:36,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:41:36,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:36,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:36,017 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:41:36,018 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:41:36,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 00:41:36,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 00:41:36,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:41:36,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:36,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:41:36,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:41:36,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:36,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:41:36,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:36,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21776310] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:41:36,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:41:36,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2025-03-08 00:41:36,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438159464] [2025-03-08 00:41:36,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:41:36,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:41:36,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:36,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:41:36,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:41:36,181 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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:41:36,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:36,252 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2025-03-08 00:41:36,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:41:36,253 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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:41:36,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:36,253 INFO L225 Difference]: With dead ends: 37 [2025-03-08 00:41:36,253 INFO L226 Difference]: Without dead ends: 29 [2025-03-08 00:41:36,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:41:36,254 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 89 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:36,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 41 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:41:36,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-08 00:41:36,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 17. [2025-03-08 00:41:36,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:36,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2025-03-08 00:41:36,259 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 9 [2025-03-08 00:41:36,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:36,259 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2025-03-08 00:41:36,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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:41:36,260 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2025-03-08 00:41:36,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 00:41:36,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:36,260 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:36,266 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:41:36,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:36,461 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:36,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:36,461 INFO L85 PathProgramCache]: Analyzing trace with hash -582250183, now seen corresponding path program 1 times [2025-03-08 00:41:36,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:36,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101941053] [2025-03-08 00:41:36,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:41:36,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:36,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 00:41:36,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 00:41:36,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:41:36,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:36,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:36,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101941053] [2025-03-08 00:41:36,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101941053] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:41:36,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217067605] [2025-03-08 00:41:36,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:41:36,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:36,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:36,725 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:41:36,727 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:41:36,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 00:41:36,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 00:41:36,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:41:36,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:36,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 00:41:36,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:41:36,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:41:36,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 00:41:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:36,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:41:37,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-08 00:41:37,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-03-08 00:41:37,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:37,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217067605] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:41:37,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:41:37,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-03-08 00:41:37,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683441455] [2025-03-08 00:41:37,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:41:37,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 00:41:37,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:37,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 00:41:37,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:41:37,110 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 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:41:37,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:37,192 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2025-03-08 00:41:37,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:41:37,192 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 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) Word has length 12 [2025-03-08 00:41:37,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:37,193 INFO L225 Difference]: With dead ends: 28 [2025-03-08 00:41:37,193 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 00:41:37,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-03-08 00:41:37,193 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:37,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 79 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:41:37,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 00:41:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2025-03-08 00:41:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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:41:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-03-08 00:41:37,199 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2025-03-08 00:41:37,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:37,200 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-08 00:41:37,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 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:41:37,200 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-03-08 00:41:37,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 00:41:37,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:37,201 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:37,206 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:41:37,403 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,SelfDestructingSolverStorable3 [2025-03-08 00:41:37,403 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:37,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:37,404 INFO L85 PathProgramCache]: Analyzing trace with hash 724338776, now seen corresponding path program 2 times [2025-03-08 00:41:37,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:37,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459679130] [2025-03-08 00:41:37,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:41:37,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:37,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-08 00:41:37,427 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 00:41:37,427 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:41:37,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:37,663 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:37,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:37,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459679130] [2025-03-08 00:41:37,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459679130] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:41:37,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428853708] [2025-03-08 00:41:37,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:41:37,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:37,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:37,667 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:41:37,670 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:41:37,699 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-08 00:41:37,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 00:41:37,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:41:37,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:37,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 00:41:37,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:41:37,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:41:37,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:37,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 00:41:37,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 00:41:37,919 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:37,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:41:42,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2025-03-08 00:41:42,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 126 [2025-03-08 00:41:42,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:42,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428853708] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:41:42,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:41:42,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-08 00:41:42,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500585893] [2025-03-08 00:41:42,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:41:42,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 00:41:42,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:42,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 00:41:42,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:41:42,154 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 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:41:42,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:42,337 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2025-03-08 00:41:42,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:41:42,338 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 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 14 [2025-03-08 00:41:42,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:42,338 INFO L225 Difference]: With dead ends: 31 [2025-03-08 00:41:42,338 INFO L226 Difference]: Without dead ends: 29 [2025-03-08 00:41:42,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:41:42,339 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 35 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:42,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 71 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:41:42,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-08 00:41:42,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2025-03-08 00:41:42,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:42,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2025-03-08 00:41:42,344 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 14 [2025-03-08 00:41:42,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:42,344 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-03-08 00:41:42,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 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:41:42,344 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2025-03-08 00:41:42,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 00:41:42,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:42,344 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:42,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 00:41:42,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:42,545 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:42,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:42,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1558579602, now seen corresponding path program 1 times [2025-03-08 00:41:42,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:42,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872899041] [2025-03-08 00:41:42,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:41:42,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:42,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 00:41:42,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 00:41:42,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:41:42,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:42,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:42,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872899041] [2025-03-08 00:41:42,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872899041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:41:42,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826173918] [2025-03-08 00:41:42,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:41:42,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:42,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:42,640 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:41:42,642 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:41:42,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 00:41:42,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 00:41:42,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:41:42,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:42,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:41:42,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:41:42,727 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:42,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:41:42,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:42,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826173918] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:41:42,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:41:42,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 00:41:42,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867696936] [2025-03-08 00:41:42,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:41:42,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:41:42,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:42,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:41:42,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:41:42,764 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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:41:42,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:42,799 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2025-03-08 00:41:42,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:41:42,799 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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 15 [2025-03-08 00:41:42,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:42,800 INFO L225 Difference]: With dead ends: 29 [2025-03-08 00:41:42,800 INFO L226 Difference]: Without dead ends: 19 [2025-03-08 00:41:42,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:41:42,800 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:42,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:41:42,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-08 00:41:42,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-08 00:41:42,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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:41:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2025-03-08 00:41:42,807 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2025-03-08 00:41:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:42,807 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2025-03-08 00:41:42,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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:41:42,807 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2025-03-08 00:41:42,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 00:41:42,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:42,807 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:42,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 00:41:43,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:43,012 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:43,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:43,012 INFO L85 PathProgramCache]: Analyzing trace with hash 861653523, now seen corresponding path program 2 times [2025-03-08 00:41:43,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:43,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610823259] [2025-03-08 00:41:43,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:41:43,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:43,026 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-08 00:41:43,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:41:43,040 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:41:43,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:43,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:43,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610823259] [2025-03-08 00:41:43,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610823259] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:41:43,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12244217] [2025-03-08 00:41:43,286 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:41:43,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:43,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:43,288 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:41:43,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 00:41:43,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-08 00:41:43,331 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:41:43,331 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:41:43,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:43,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 00:41:43,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:41:43,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 00:41:43,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-08 00:41:43,533 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:43,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:41:43,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-03-08 00:41:43,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2025-03-08 00:41:43,814 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:43,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12244217] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:41:43,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:41:43,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-08 00:41:43,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019537905] [2025-03-08 00:41:43,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:41:43,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 00:41:43,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:43,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 00:41:43,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-03-08 00:41:43,815 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:43,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:43,934 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2025-03-08 00:41:43,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:41:43,935 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-08 00:41:43,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:43,935 INFO L225 Difference]: With dead ends: 29 [2025-03-08 00:41:43,935 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 00:41:43,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:41:43,936 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:43,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 52 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:41:43,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 00:41:43,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-08 00:41:43,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:43,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-03-08 00:41:43,941 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2025-03-08 00:41:43,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:43,941 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-03-08 00:41:43,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:41:43,941 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-03-08 00:41:43,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 00:41:43,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:43,943 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:43,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 00:41:44,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:44,147 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:44,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:44,147 INFO L85 PathProgramCache]: Analyzing trace with hash 113153849, now seen corresponding path program 1 times [2025-03-08 00:41:44,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:44,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564600351] [2025-03-08 00:41:44,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:41:44,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:44,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 00:41:44,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 00:41:44,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:41:44,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:44,210 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:41:44,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:44,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564600351] [2025-03-08 00:41:44,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564600351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:41:44,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337977233] [2025-03-08 00:41:44,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:41:44,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:44,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:44,213 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:41:44,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 00:41:44,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 00:41:44,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 00:41:44,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:41:44,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:44,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:41:44,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:41:44,329 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:41:44,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:41:44,395 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:41:44,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337977233] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:41:44,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:41:44,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-03-08 00:41:44,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734879536] [2025-03-08 00:41:44,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:41:44,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 00:41:44,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:44,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 00:41:44,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:41:44,397 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 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:41:44,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:44,504 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2025-03-08 00:41:44,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:41:44,505 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 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 18 [2025-03-08 00:41:44,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:44,506 INFO L225 Difference]: With dead ends: 87 [2025-03-08 00:41:44,507 INFO L226 Difference]: Without dead ends: 79 [2025-03-08 00:41:44,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:41:44,508 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 135 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:44,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 54 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:41:44,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-08 00:41:44,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 31. [2025-03-08 00:41:44,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 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:41:44,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2025-03-08 00:41:44,514 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 18 [2025-03-08 00:41:44,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:44,514 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2025-03-08 00:41:44,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 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:41:44,514 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2025-03-08 00:41:44,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 00:41:44,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:44,515 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:44,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 00:41:44,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:44,715 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:44,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:44,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1130589780, now seen corresponding path program 3 times [2025-03-08 00:41:44,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:44,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696233567] [2025-03-08 00:41:44,716 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:41:44,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:44,723 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 5 equivalence classes. [2025-03-08 00:41:44,738 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 00:41:44,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 00:41:44,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:44,944 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:44,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:44,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696233567] [2025-03-08 00:41:44,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696233567] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:41:44,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366104750] [2025-03-08 00:41:44,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:41:44,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:44,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:44,948 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:41:44,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 00:41:44,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 5 equivalence classes. [2025-03-08 00:41:44,994 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 00:41:44,994 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 00:41:44,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:44,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 00:41:44,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:41:45,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:41:45,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:45,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 00:41:45,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 00:41:45,259 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:45,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:01,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2025-03-08 00:42:01,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 126 [2025-03-08 00:42:01,670 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:01,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366104750] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:01,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:01,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 27 [2025-03-08 00:42:01,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711485097] [2025-03-08 00:42:01,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:01,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 00:42:01,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:01,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 00:42:01,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=608, Unknown=4, NotChecked=0, Total=702 [2025-03-08 00:42:01,672 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:01,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:01,897 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2025-03-08 00:42:01,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:42:01,898 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-08 00:42:01,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:01,899 INFO L225 Difference]: With dead ends: 37 [2025-03-08 00:42:01,899 INFO L226 Difference]: Without dead ends: 35 [2025-03-08 00:42:01,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=158, Invalid=894, Unknown=4, NotChecked=0, Total=1056 [2025-03-08 00:42:01,900 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 34 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:01,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 66 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:42:01,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-08 00:42:01,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2025-03-08 00:42:01,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 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:42:01,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2025-03-08 00:42:01,904 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 19 [2025-03-08 00:42:01,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:01,905 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2025-03-08 00:42:01,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:01,905 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2025-03-08 00:42:01,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 00:42:01,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:01,905 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:01,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 00:42:02,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:02,107 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:02,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:02,107 INFO L85 PathProgramCache]: Analyzing trace with hash 267473559, now seen corresponding path program 4 times [2025-03-08 00:42:02,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:02,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281112470] [2025-03-08 00:42:02,108 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:42:02,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:02,113 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-08 00:42:02,127 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 00:42:02,127 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:42:02,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:02,367 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:02,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:02,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281112470] [2025-03-08 00:42:02,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281112470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:02,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959365051] [2025-03-08 00:42:02,368 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:42:02,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:02,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:02,369 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:02,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 00:42:02,402 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-08 00:42:02,417 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 00:42:02,417 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:42:02,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:02,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 00:42:02,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:02,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 00:42:02,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-08 00:42:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:02,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:02,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-03-08 00:42:02,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2025-03-08 00:42:02,989 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:02,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959365051] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:02,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:02,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2025-03-08 00:42:02,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772950438] [2025-03-08 00:42:02,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:02,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 00:42:02,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:02,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 00:42:02,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2025-03-08 00:42:02,991 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:03,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:03,195 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2025-03-08 00:42:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:42:03,196 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-08 00:42:03,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:03,196 INFO L225 Difference]: With dead ends: 46 [2025-03-08 00:42:03,196 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 00:42:03,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=870, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 00:42:03,197 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:03,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 77 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:42:03,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 00:42:03,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-08 00:42:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 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:42:03,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2025-03-08 00:42:03,203 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 22 [2025-03-08 00:42:03,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:03,204 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2025-03-08 00:42:03,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:03,204 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2025-03-08 00:42:03,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:42:03,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:03,205 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:03,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 00:42:03,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 00:42:03,409 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:03,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:03,409 INFO L85 PathProgramCache]: Analyzing trace with hash 905654006, now seen corresponding path program 5 times [2025-03-08 00:42:03,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:03,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43928985] [2025-03-08 00:42:03,410 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:42:03,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:03,415 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 6 equivalence classes. [2025-03-08 00:42:03,425 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:42:03,429 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 00:42:03,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:03,697 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:03,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:03,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43928985] [2025-03-08 00:42:03,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43928985] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:03,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809121430] [2025-03-08 00:42:03,698 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:42:03,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:03,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:03,700 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:03,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 00:42:03,733 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 6 equivalence classes. [2025-03-08 00:42:03,751 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:42:03,751 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 00:42:03,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:03,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 00:42:03,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:03,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:42:03,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:42:03,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 00:42:04,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 00:42:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:04,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:08,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2025-03-08 00:42:08,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 126 [2025-03-08 00:42:08,353 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:08,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809121430] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:08,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:08,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2025-03-08 00:42:08,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561666492] [2025-03-08 00:42:08,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:08,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 00:42:08,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:08,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 00:42:08,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=834, Unknown=0, NotChecked=0, Total=930 [2025-03-08 00:42:08,354 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:08,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:08,599 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2025-03-08 00:42:08,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:42:08,599 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-08 00:42:08,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:08,599 INFO L225 Difference]: With dead ends: 40 [2025-03-08 00:42:08,599 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 00:42:08,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 00:42:08,600 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 59 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:08,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 122 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:42:08,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 00:42:08,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2025-03-08 00:42:08,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-03-08 00:42:08,604 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 24 [2025-03-08 00:42:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:08,604 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-03-08 00:42:08,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-03-08 00:42:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 00:42:08,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:08,605 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:08,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 00:42:08,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:08,808 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:08,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:08,808 INFO L85 PathProgramCache]: Analyzing trace with hash -645187915, now seen corresponding path program 6 times [2025-03-08 00:42:08,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:08,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086154831] [2025-03-08 00:42:08,809 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:42:08,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:08,814 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 6 equivalence classes. [2025-03-08 00:42:08,831 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 00:42:08,831 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-08 00:42:08,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:09,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:09,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086154831] [2025-03-08 00:42:09,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086154831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:09,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091050767] [2025-03-08 00:42:09,128 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:42:09,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:09,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:09,130 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:09,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 00:42:09,169 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 6 equivalence classes. [2025-03-08 00:42:09,190 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 00:42:09,190 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-08 00:42:09,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:09,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 00:42:09,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:09,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:42:09,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 00:42:09,511 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:09,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:09,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-08 00:42:09,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-03-08 00:42:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:09,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091050767] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:09,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:09,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2025-03-08 00:42:09,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54666450] [2025-03-08 00:42:09,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:09,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 00:42:09,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:09,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 00:42:09,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1016, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 00:42:09,780 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:10,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:10,248 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2025-03-08 00:42:10,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:42:10,248 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-08 00:42:10,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:10,248 INFO L225 Difference]: With dead ends: 55 [2025-03-08 00:42:10,248 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 00:42:10,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=209, Invalid=1683, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 00:42:10,249 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 26 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:10,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 172 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:42:10,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 00:42:10,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-08 00:42:10,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:10,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-03-08 00:42:10,253 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 27 [2025-03-08 00:42:10,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:10,253 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-03-08 00:42:10,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:10,253 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-03-08 00:42:10,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 00:42:10,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:10,254 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:10,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 00:42:10,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 00:42:10,454 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:10,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:10,454 INFO L85 PathProgramCache]: Analyzing trace with hash 493305270, now seen corresponding path program 7 times [2025-03-08 00:42:10,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:10,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244190971] [2025-03-08 00:42:10,454 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:42:10,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:10,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 00:42:10,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:42:10,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:10,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:10,770 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:10,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:10,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244190971] [2025-03-08 00:42:10,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244190971] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:10,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600548649] [2025-03-08 00:42:10,770 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:42:10,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:10,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:10,772 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:10,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 00:42:10,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 00:42:10,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:42:10,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:10,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:10,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-08 00:42:10,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:10,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:42:10,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2025-03-08 00:42:11,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:42:11,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:42:11,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:42:11,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 23 [2025-03-08 00:42:11,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:42:11,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2025-03-08 00:42:11,314 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:11,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:12,868 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~j~0#1_74| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_88| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |c_ULTIMATE.start_main_~k~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_88| |c_ULTIMATE.start_main_~i~0#1| 1 (select (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#a~0#1.offset|) |c_ULTIMATE.start_main_~j~0#1|) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 4) |c_ULTIMATE.start_main_~#a~0#1.offset|) |v_ULTIMATE.start_main_~j~0#1_74|) (+ |c_ULTIMATE.start_main_~#a~0#1.offset| 16)))))) is different from false [2025-03-08 00:42:12,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2025-03-08 00:42:12,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1238 treesize of output 1206 [2025-03-08 00:42:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2025-03-08 00:42:13,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600548649] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:13,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:13,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 39 [2025-03-08 00:42:13,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737792196] [2025-03-08 00:42:13,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:13,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-08 00:42:13,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:13,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-08 00:42:13,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1264, Unknown=1, NotChecked=72, Total=1482 [2025-03-08 00:42:13,123 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 39 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:13,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:13,530 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2025-03-08 00:42:13,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 00:42:13,531 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 39 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-08 00:42:13,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:13,531 INFO L225 Difference]: With dead ends: 43 [2025-03-08 00:42:13,531 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 00:42:13,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=244, Invalid=1829, Unknown=1, NotChecked=88, Total=2162 [2025-03-08 00:42:13,532 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 36 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:13,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 129 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 537 Invalid, 0 Unknown, 31 Unchecked, 0.2s Time] [2025-03-08 00:42:13,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 00:42:13,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2025-03-08 00:42:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:13,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2025-03-08 00:42:13,539 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 29 [2025-03-08 00:42:13,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:13,540 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2025-03-08 00:42:13,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 39 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:13,540 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2025-03-08 00:42:13,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 00:42:13,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:13,541 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:13,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 00:42:13,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 00:42:13,745 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:13,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:13,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1319915531, now seen corresponding path program 8 times [2025-03-08 00:42:13,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:13,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528519296] [2025-03-08 00:42:13,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:42:13,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:13,751 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-08 00:42:13,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 00:42:13,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:42:13,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:14,089 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 9 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:14,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:14,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528519296] [2025-03-08 00:42:14,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528519296] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:14,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137317442] [2025-03-08 00:42:14,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:42:14,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:14,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:14,092 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:14,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 00:42:14,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-08 00:42:14,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 00:42:14,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:42:14,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:14,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 00:42:14,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:14,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 00:42:14,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-08 00:42:14,575 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:14,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:14,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-03-08 00:42:14,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2025-03-08 00:42:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 18 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:15,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137317442] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:15,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:15,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 40 [2025-03-08 00:42:15,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482814365] [2025-03-08 00:42:15,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:15,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-08 00:42:15,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:15,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-08 00:42:15,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1308, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 00:42:15,051 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 40 states, 40 states have (on average 2.275) internal successors, (91), 40 states have internal predecessors, (91), 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:42:15,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:15,288 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2025-03-08 00:42:15,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 00:42:15,289 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.275) internal successors, (91), 40 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-08 00:42:15,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:15,290 INFO L225 Difference]: With dead ends: 58 [2025-03-08 00:42:15,290 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 00:42:15,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=281, Invalid=1441, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 00:42:15,290 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:15,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 129 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:42:15,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 00:42:15,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 00:42:15,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 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:42:15,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2025-03-08 00:42:15,296 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 32 [2025-03-08 00:42:15,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:15,296 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2025-03-08 00:42:15,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.275) internal successors, (91), 40 states have internal predecessors, (91), 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:42:15,296 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2025-03-08 00:42:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 00:42:15,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:15,297 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:15,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-08 00:42:15,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 00:42:15,502 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:15,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:15,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1788404116, now seen corresponding path program 9 times [2025-03-08 00:42:15,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:15,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531626664] [2025-03-08 00:42:15,502 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:42:15,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:15,509 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 8 equivalence classes. [2025-03-08 00:42:15,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:42:15,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-08 00:42:15,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:15,863 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:15,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:15,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531626664] [2025-03-08 00:42:15,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531626664] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:15,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536013765] [2025-03-08 00:42:15,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:42:15,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:15,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:15,865 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:15,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 00:42:15,909 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 8 equivalence classes. [2025-03-08 00:42:15,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:42:15,958 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-08 00:42:15,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:15,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-08 00:42:15,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:16,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:42:16,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:42:16,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 00:42:16,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 00:42:16,501 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:16,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:24,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2025-03-08 00:42:24,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 126 [2025-03-08 00:42:24,980 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:24,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536013765] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:24,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:24,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 45 [2025-03-08 00:42:24,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131206643] [2025-03-08 00:42:24,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:24,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-08 00:42:24,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:24,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-08 00:42:24,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1825, Unknown=2, NotChecked=0, Total=1980 [2025-03-08 00:42:24,982 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 45 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 45 states have internal predecessors, (97), 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:42:25,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:25,511 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2025-03-08 00:42:25,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 00:42:25,512 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 45 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-08 00:42:25,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:25,512 INFO L225 Difference]: With dead ends: 46 [2025-03-08 00:42:25,512 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 00:42:25,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=257, Invalid=2603, Unknown=2, NotChecked=0, Total=2862 [2025-03-08 00:42:25,513 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:25,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 204 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:42:25,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 00:42:25,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2025-03-08 00:42:25,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:25,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2025-03-08 00:42:25,518 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 34 [2025-03-08 00:42:25,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:25,519 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2025-03-08 00:42:25,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 45 states have internal predecessors, (97), 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:42:25,519 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2025-03-08 00:42:25,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 00:42:25,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:25,519 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:25,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 00:42:25,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 00:42:25,720 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:25,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:25,721 INFO L85 PathProgramCache]: Analyzing trace with hash -721414313, now seen corresponding path program 10 times [2025-03-08 00:42:25,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:25,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048271106] [2025-03-08 00:42:25,721 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:42:25,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:25,727 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-08 00:42:25,742 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 00:42:25,742 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:42:25,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:26,111 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 30 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:26,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:26,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048271106] [2025-03-08 00:42:26,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048271106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:26,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434701612] [2025-03-08 00:42:26,112 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:42:26,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:26,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:26,114 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:26,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 00:42:26,159 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-08 00:42:26,207 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 00:42:26,208 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:42:26,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:26,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 00:42:26,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:26,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 00:42:26,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-08 00:42:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 35 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:26,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:26,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-03-08 00:42:26,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2025-03-08 00:42:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 30 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:27,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434701612] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:27,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:27,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 46 [2025-03-08 00:42:27,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61746453] [2025-03-08 00:42:27,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:27,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-08 00:42:27,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:27,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-08 00:42:27,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=1698, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 00:42:27,243 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 46 states, 46 states have (on average 2.3043478260869565) internal successors, (106), 46 states have internal predecessors, (106), 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:42:27,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:27,405 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2025-03-08 00:42:27,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 00:42:27,405 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.3043478260869565) internal successors, (106), 46 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-08 00:42:27,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:27,405 INFO L225 Difference]: With dead ends: 64 [2025-03-08 00:42:27,405 INFO L226 Difference]: Without dead ends: 43 [2025-03-08 00:42:27,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=397, Invalid=1765, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 00:42:27,406 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:27,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 91 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:42:27,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-08 00:42:27,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-08 00:42:27,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:27,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2025-03-08 00:42:27,412 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 37 [2025-03-08 00:42:27,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:27,412 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2025-03-08 00:42:27,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.3043478260869565) internal successors, (106), 46 states have internal predecessors, (106), 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:42:27,412 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2025-03-08 00:42:27,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 00:42:27,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:27,412 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:27,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 00:42:27,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:27,617 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:27,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:27,617 INFO L85 PathProgramCache]: Analyzing trace with hash -878440168, now seen corresponding path program 11 times [2025-03-08 00:42:27,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:27,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006851549] [2025-03-08 00:42:27,617 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:42:27,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:27,623 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 9 equivalence classes. [2025-03-08 00:42:27,643 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:42:27,644 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-08 00:42:27,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:28,042 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:28,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:28,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006851549] [2025-03-08 00:42:28,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006851549] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:28,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973445320] [2025-03-08 00:42:28,043 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:42:28,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:28,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:28,045 INFO L229 MonitoredProcess]: Starting monitored process 16 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:42:28,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 00:42:28,090 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 9 equivalence classes. [2025-03-08 00:42:28,148 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:42:28,149 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-08 00:42:28,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:28,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-08 00:42:28,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:28,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:42:28,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:42:28,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 00:42:28,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 00:42:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:28,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:28,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2025-03-08 00:42:28,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2025-03-08 00:42:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:29,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973445320] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:29,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:29,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 49 [2025-03-08 00:42:29,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007544644] [2025-03-08 00:42:29,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:29,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-08 00:42:29,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:29,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-08 00:42:29,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2193, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 00:42:29,182 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 49 states, 49 states have (on average 2.2857142857142856) internal successors, (112), 49 states have internal predecessors, (112), 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:42:29,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:29,731 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2025-03-08 00:42:29,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 00:42:29,731 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.2857142857142856) internal successors, (112), 49 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-08 00:42:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:29,731 INFO L225 Difference]: With dead ends: 49 [2025-03-08 00:42:29,732 INFO L226 Difference]: Without dead ends: 47 [2025-03-08 00:42:29,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=254, Invalid=2938, Unknown=0, NotChecked=0, Total=3192 [2025-03-08 00:42:29,733 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 42 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:29,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 256 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:42:29,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-08 00:42:29,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2025-03-08 00:42:29,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 45 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:42:29,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2025-03-08 00:42:29,738 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 39 [2025-03-08 00:42:29,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:29,738 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2025-03-08 00:42:29,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.2857142857142856) internal successors, (112), 49 states have internal predecessors, (112), 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:42:29,739 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2025-03-08 00:42:29,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 00:42:29,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:29,739 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:29,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-08 00:42:29,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 00:42:29,939 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:29,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:29,940 INFO L85 PathProgramCache]: Analyzing trace with hash -374437549, now seen corresponding path program 12 times [2025-03-08 00:42:29,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:29,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135933831] [2025-03-08 00:42:29,940 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:42:29,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:29,948 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 9 equivalence classes. [2025-03-08 00:42:29,966 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 00:42:29,966 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-08 00:42:29,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:30,378 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 30 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:30,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:30,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135933831] [2025-03-08 00:42:30,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135933831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:30,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324838708] [2025-03-08 00:42:30,378 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:42:30,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:30,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:30,380 INFO L229 MonitoredProcess]: Starting monitored process 17 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:42:30,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 00:42:30,425 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 9 equivalence classes. [2025-03-08 00:42:30,526 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 00:42:30,526 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-03-08 00:42:30,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:30,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-08 00:42:30,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:30,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 00:42:31,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-08 00:42:31,073 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 50 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:31,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:31,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-03-08 00:42:31,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2025-03-08 00:42:31,775 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 41 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:31,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324838708] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:31,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:31,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 54 [2025-03-08 00:42:31,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046324732] [2025-03-08 00:42:31,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:31,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-08 00:42:31,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:31,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-08 00:42:31,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=2432, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 00:42:31,777 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 54 states, 54 states have (on average 2.240740740740741) internal successors, (121), 54 states have internal predecessors, (121), 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:42:32,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:32,095 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2025-03-08 00:42:32,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 00:42:32,095 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.240740740740741) internal successors, (121), 54 states have internal predecessors, (121), 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 42 [2025-03-08 00:42:32,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:32,096 INFO L225 Difference]: With dead ends: 70 [2025-03-08 00:42:32,096 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 00:42:32,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=492, Invalid=2700, Unknown=0, NotChecked=0, Total=3192 [2025-03-08 00:42:32,097 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:32,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 120 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:42:32,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 00:42:32,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-08 00:42:32,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 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:42:32,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2025-03-08 00:42:32,102 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 42 [2025-03-08 00:42:32,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:32,102 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2025-03-08 00:42:32,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.240740740740741) internal successors, (121), 54 states have internal predecessors, (121), 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:42:32,103 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2025-03-08 00:42:32,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 00:42:32,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:32,103 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:32,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-08 00:42:32,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 00:42:32,304 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:32,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:32,304 INFO L85 PathProgramCache]: Analyzing trace with hash -789217230, now seen corresponding path program 13 times [2025-03-08 00:42:32,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:32,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177343185] [2025-03-08 00:42:32,304 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:42:32,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:32,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 00:42:32,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:42:32,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:32,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:32,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:32,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177343185] [2025-03-08 00:42:32,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177343185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:32,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537910975] [2025-03-08 00:42:32,734 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:42:32,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:32,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:32,736 INFO L229 MonitoredProcess]: Starting monitored process 18 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:42:32,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 00:42:32,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 00:42:32,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:42:32,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:32,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:32,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-08 00:42:32,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:33,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:42:33,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2025-03-08 00:42:33,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:42:33,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:42:33,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:42:33,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 23 [2025-03-08 00:42:33,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:42:33,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2025-03-08 00:42:33,521 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:33,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:46,395 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_178| Int) (|v_ULTIMATE.start_main_~j~0#1_161| Int)) (or (< |c_ULTIMATE.start_main_~k~0#1| (+ |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_178| 1 (select (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#a~0#1.offset|) |c_ULTIMATE.start_main_~j~0#1|) (+ (* |v_ULTIMATE.start_main_~i~0#1_178| 4) |c_ULTIMATE.start_main_~#a~0#1.offset|) |v_ULTIMATE.start_main_~j~0#1_161|) (+ |c_ULTIMATE.start_main_~#a~0#1.offset| 28)))) (< |v_ULTIMATE.start_main_~i~0#1_178| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2025-03-08 00:42:46,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2025-03-08 00:42:46,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 302 treesize of output 294 [2025-03-08 00:42:46,893 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2025-03-08 00:42:46,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537910975] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:46,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:46,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 21] total 57 [2025-03-08 00:42:46,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200129813] [2025-03-08 00:42:46,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:46,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-08 00:42:46,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:46,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-08 00:42:46,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2864, Unknown=3, NotChecked=108, Total=3192 [2025-03-08 00:42:46,895 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 57 states, 57 states have (on average 2.2280701754385963) internal successors, (127), 57 states have internal predecessors, (127), 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:42:47,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:47,604 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2025-03-08 00:42:47,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 00:42:47,605 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.2280701754385963) internal successors, (127), 57 states have internal predecessors, (127), 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 44 [2025-03-08 00:42:47,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:47,605 INFO L225 Difference]: With dead ends: 52 [2025-03-08 00:42:47,605 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 00:42:47,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=355, Invalid=4068, Unknown=3, NotChecked=130, Total=4556 [2025-03-08 00:42:47,606 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 96 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:47,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 237 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1078 Invalid, 0 Unknown, 46 Unchecked, 0.4s Time] [2025-03-08 00:42:47,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 00:42:47,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2025-03-08 00:42:47,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 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:42:47,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2025-03-08 00:42:47,615 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2025-03-08 00:42:47,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:47,615 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2025-03-08 00:42:47,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.2280701754385963) internal successors, (127), 57 states have internal predecessors, (127), 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:42:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2025-03-08 00:42:47,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 00:42:47,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:47,616 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:47,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 00:42:47,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:47,817 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:47,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:47,817 INFO L85 PathProgramCache]: Analyzing trace with hash -918647815, now seen corresponding path program 14 times [2025-03-08 00:42:47,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:47,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881582909] [2025-03-08 00:42:47,817 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:42:47,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:47,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-08 00:42:47,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:42:47,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:42:47,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:48,303 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 45 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:48,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:48,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881582909] [2025-03-08 00:42:48,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881582909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:48,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258853074] [2025-03-08 00:42:48,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:42:48,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:48,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:48,306 INFO L229 MonitoredProcess]: Starting monitored process 19 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:42:48,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 00:42:48,356 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-08 00:42:48,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 00:42:48,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:42:48,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:48,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-08 00:42:48,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:48,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 00:42:48,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-08 00:42:48,993 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 70 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:48,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:49,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-03-08 00:42:49,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2025-03-08 00:42:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 63 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:49,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258853074] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:49,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:49,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 58 [2025-03-08 00:42:49,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166654724] [2025-03-08 00:42:49,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:49,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-08 00:42:49,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:49,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-08 00:42:49,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=2817, Unknown=0, NotChecked=0, Total=3306 [2025-03-08 00:42:49,838 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 58 states, 58 states have (on average 2.3448275862068964) internal successors, (136), 58 states have internal predecessors, (136), 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:42:50,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:50,146 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2025-03-08 00:42:50,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 00:42:50,146 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.3448275862068964) internal successors, (136), 58 states have internal predecessors, (136), 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 47 [2025-03-08 00:42:50,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:50,147 INFO L225 Difference]: With dead ends: 77 [2025-03-08 00:42:50,147 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 00:42:50,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=527, Invalid=3013, Unknown=0, NotChecked=0, Total=3540 [2025-03-08 00:42:50,148 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:50,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 175 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:42:50,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 00:42:50,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-08 00:42:50,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:50,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2025-03-08 00:42:50,157 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 47 [2025-03-08 00:42:50,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:50,157 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2025-03-08 00:42:50,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.3448275862068964) internal successors, (136), 58 states have internal predecessors, (136), 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:42:50,157 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2025-03-08 00:42:50,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 00:42:50,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:50,157 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:50,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-08 00:42:50,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:50,358 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:50,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:50,358 INFO L85 PathProgramCache]: Analyzing trace with hash 648195027, now seen corresponding path program 2 times [2025-03-08 00:42:50,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:50,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400498331] [2025-03-08 00:42:50,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:42:50,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:50,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-08 00:42:50,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:42:50,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:42:50,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:50,487 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-08 00:42:50,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:50,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400498331] [2025-03-08 00:42:50,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400498331] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:50,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269017834] [2025-03-08 00:42:50,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:42:50,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:50,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:50,489 INFO L229 MonitoredProcess]: Starting monitored process 20 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:42:50,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 00:42:50,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-03-08 00:42:50,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:42:50,566 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:42:50,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:50,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 00:42:50,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:50,688 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-08 00:42:50,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-08 00:42:50,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269017834] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:50,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:50,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2025-03-08 00:42:50,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412873369] [2025-03-08 00:42:50,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:50,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-08 00:42:50,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:50,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-08 00:42:50,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=753, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 00:42:50,851 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:51,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:51,112 INFO L93 Difference]: Finished difference Result 411 states and 436 transitions. [2025-03-08 00:42:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 00:42:51,112 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-08 00:42:51,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:51,113 INFO L225 Difference]: With dead ends: 411 [2025-03-08 00:42:51,113 INFO L226 Difference]: Without dead ends: 385 [2025-03-08 00:42:51,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=876, Invalid=1380, Unknown=0, NotChecked=0, Total=2256 [2025-03-08 00:42:51,114 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 452 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:51,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 90 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:42:51,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-08 00:42:51,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 73. [2025-03-08 00:42:51,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 72 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2025-03-08 00:42:51,126 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 48 [2025-03-08 00:42:51,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:51,126 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2025-03-08 00:42:51,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:51,126 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2025-03-08 00:42:51,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 00:42:51,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:51,126 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:51,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-08 00:42:51,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:51,327 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:51,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:51,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1033238406, now seen corresponding path program 15 times [2025-03-08 00:42:51,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:51,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275484180] [2025-03-08 00:42:51,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:42:51,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:51,333 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 11 equivalence classes. [2025-03-08 00:42:51,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 00:42:51,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-08 00:42:51,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:51,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:51,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275484180] [2025-03-08 00:42:51,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275484180] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:51,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647347580] [2025-03-08 00:42:51,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:42:51,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:51,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:51,842 INFO L229 MonitoredProcess]: Starting monitored process 21 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:42:51,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-08 00:42:51,898 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 11 equivalence classes. [2025-03-08 00:42:51,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 00:42:51,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-08 00:42:52,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:52,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-03-08 00:42:52,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:52,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 00:42:52,275 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-08 00:42:52,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 33 treesize of output 13 [2025-03-08 00:42:52,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-08 00:42:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:52,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:53,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2025-03-08 00:42:53,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 126 [2025-03-08 00:42:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:53,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647347580] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:53,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:53,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 23] total 63 [2025-03-08 00:42:53,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311478655] [2025-03-08 00:42:53,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:53,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-08 00:42:53,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:53,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-08 00:42:53,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=3689, Unknown=0, NotChecked=0, Total=3906 [2025-03-08 00:42:53,418 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand has 63 states, 63 states have (on average 2.253968253968254) internal successors, (142), 63 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:54,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:54,212 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2025-03-08 00:42:54,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 00:42:54,213 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.253968253968254) internal successors, (142), 63 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-08 00:42:54,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:54,214 INFO L225 Difference]: With dead ends: 79 [2025-03-08 00:42:54,214 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 00:42:54,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=352, Invalid=5050, Unknown=0, NotChecked=0, Total=5402 [2025-03-08 00:42:54,216 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 55 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 1660 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:54,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 384 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1660 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:42:54,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 00:42:54,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2025-03-08 00:42:54,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 75 states have internal predecessors, (89), 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:42:54,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2025-03-08 00:42:54,227 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 49 [2025-03-08 00:42:54,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:54,227 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2025-03-08 00:42:54,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.253968253968254) internal successors, (142), 63 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:54,228 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2025-03-08 00:42:54,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 00:42:54,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:54,228 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 9, 8, 8, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:54,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-08 00:42:54,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-08 00:42:54,429 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:54,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:54,429 INFO L85 PathProgramCache]: Analyzing trace with hash 826130097, now seen corresponding path program 16 times [2025-03-08 00:42:54,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:54,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861961395] [2025-03-08 00:42:54,429 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:42:54,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:54,436 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-03-08 00:42:54,447 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 00:42:54,448 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:42:54,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:54,973 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 84 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:54,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:54,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861961395] [2025-03-08 00:42:54,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861961395] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:54,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352817811] [2025-03-08 00:42:54,974 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:42:54,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:54,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:54,976 INFO L229 MonitoredProcess]: Starting monitored process 22 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:42:54,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-08 00:42:55,047 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-03-08 00:42:55,118 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 00:42:55,118 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:42:55,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:55,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-08 00:42:55,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:55,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 00:42:55,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-08 00:42:55,717 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 92 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:55,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:56,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-03-08 00:42:56,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2025-03-08 00:42:56,625 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 84 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:56,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352817811] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:56,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:56,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 64 [2025-03-08 00:42:56,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354539879] [2025-03-08 00:42:56,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:56,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-08 00:42:56,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:56,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-08 00:42:56,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=690, Invalid=3342, Unknown=0, NotChecked=0, Total=4032 [2025-03-08 00:42:56,627 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand has 64 states, 64 states have (on average 2.359375) internal successors, (151), 64 states have internal predecessors, (151), 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:42:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:56,930 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2025-03-08 00:42:56,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 00:42:56,930 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.359375) internal successors, (151), 64 states have internal predecessors, (151), 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 52 [2025-03-08 00:42:56,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:56,931 INFO L225 Difference]: With dead ends: 106 [2025-03-08 00:42:56,931 INFO L226 Difference]: Without dead ends: 76 [2025-03-08 00:42:56,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=724, Invalid=3436, Unknown=0, NotChecked=0, Total=4160 [2025-03-08 00:42:56,932 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:56,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 176 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:42:56,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-08 00:42:56,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-08 00:42:56,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.1733333333333333) internal successors, (88), 75 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:42:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2025-03-08 00:42:56,942 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 52 [2025-03-08 00:42:56,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:56,942 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2025-03-08 00:42:56,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.359375) internal successors, (151), 64 states have internal predecessors, (151), 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:42:56,942 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2025-03-08 00:42:56,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 00:42:56,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:56,943 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 9, 8, 8, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:56,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-08 00:42:57,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-08 00:42:57,144 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:57,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:57,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1342117168, now seen corresponding path program 17 times [2025-03-08 00:42:57,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:57,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80486148] [2025-03-08 00:42:57,144 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:42:57,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:57,150 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 12 equivalence classes. [2025-03-08 00:42:57,170 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 00:42:57,170 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-08 00:42:57,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:57,693 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:57,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:57,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80486148] [2025-03-08 00:42:57,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80486148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:57,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560484452] [2025-03-08 00:42:57,694 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:42:57,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:57,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:57,696 INFO L229 MonitoredProcess]: Starting monitored process 23 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:42:57,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-08 00:42:57,753 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 12 equivalence classes. [2025-03-08 00:42:57,799 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 00:42:57,800 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-08 00:42:57,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:57,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-03-08 00:42:57,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:58,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:42:58,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:42:58,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 00:42:58,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 00:42:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:42:58,601 INFO L312 TraceCheckSpWp]: Computing backward predicates...