./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/tcpy.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-tiling/tcpy.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 a747677fdea16741fbb3fca3d9510254677728ef5906b9bf8e219064accd3a39 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:26:55,443 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:26:55,502 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:26:55,505 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:26:55,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:26:55,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:26:55,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:26:55,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:26:55,531 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:26:55,531 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:26:55,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:26:55,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:26:55,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:26:55,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:26:55,532 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:26:55,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:26:55,533 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:26:55,533 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:26:55,533 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:26:55,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:26:55,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:26:55,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:26:55,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:26:55,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:26:55,533 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:26:55,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:26:55,533 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:26:55,534 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:26:55,534 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:26:55,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:26:55,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:26:55,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:26:55,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:26:55,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:26:55,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:26:55,535 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:26:55,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:26:55,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:26:55,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:26:55,535 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:26:55,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:26:55,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:26:55,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:26:55,535 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 -> a747677fdea16741fbb3fca3d9510254677728ef5906b9bf8e219064accd3a39 [2025-03-08 00:26:55,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:26:55,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:26:55,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:26:55,759 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:26:55,760 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:26:55,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/tcpy.c [2025-03-08 00:26:56,869 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41162d47b/a980de73668e4b18b3f6db030cdb5c26/FLAG573d90565 [2025-03-08 00:26:57,090 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:26:57,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/tcpy.c [2025-03-08 00:26:57,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41162d47b/a980de73668e4b18b3f6db030cdb5c26/FLAG573d90565 [2025-03-08 00:26:57,439 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41162d47b/a980de73668e4b18b3f6db030cdb5c26 [2025-03-08 00:26:57,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:26:57,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:26:57,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:26:57,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:26:57,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:26:57,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:26:57" (1/1) ... [2025-03-08 00:26:57,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a10d6d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:57, skipping insertion in model container [2025-03-08 00:26:57,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:26:57" (1/1) ... [2025-03-08 00:26:57,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:26:57,562 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-tiling/tcpy.c[395,408] [2025-03-08 00:26:57,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:26:57,583 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:26:57,595 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-tiling/tcpy.c[395,408] [2025-03-08 00:26:57,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:26:57,611 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:26:57,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:57 WrapperNode [2025-03-08 00:26:57,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:26:57,613 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:26:57,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:26:57,614 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:26:57,618 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:26:57" (1/1) ... [2025-03-08 00:26:57,622 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:26:57" (1/1) ... [2025-03-08 00:26:57,636 INFO L138 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 75 [2025-03-08 00:26:57,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:26:57,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:26:57,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:26:57,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:26:57,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:57" (1/1) ... [2025-03-08 00:26:57,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:57" (1/1) ... [2025-03-08 00:26:57,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:57" (1/1) ... [2025-03-08 00:26:57,657 INFO L175 MemorySlicer]: Split 16 memory accesses to 4 slices as follows [2, 7, 3, 4]. 44 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 3 writes are split as follows [0, 0, 2, 1]. [2025-03-08 00:26:57,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:57" (1/1) ... [2025-03-08 00:26:57,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:57" (1/1) ... [2025-03-08 00:26:57,665 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:57" (1/1) ... [2025-03-08 00:26:57,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:57" (1/1) ... [2025-03-08 00:26:57,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:57" (1/1) ... [2025-03-08 00:26:57,668 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:57" (1/1) ... [2025-03-08 00:26:57,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:26:57,672 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:26:57,672 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:26:57,672 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:26:57,673 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:57" (1/1) ... [2025-03-08 00:26:57,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:26:57,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:26:57,697 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:26:57,699 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:26:57,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:26:57,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:26:57,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:26:57,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:26:57,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 00:26:57,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:26:57,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:26:57,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:26:57,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 00:26:57,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 00:26:57,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:26:57,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:26:57,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:26:57,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:26:57,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:26:57,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 00:26:57,766 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:26:57,767 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:26:57,910 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 00:26:57,910 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:26:57,919 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:26:57,921 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:26:57,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:26:57 BoogieIcfgContainer [2025-03-08 00:26:57,921 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:26:57,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:26:57,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:26:57,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:26:57,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:26:57" (1/3) ... [2025-03-08 00:26:57,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc2ec04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:26:57, skipping insertion in model container [2025-03-08 00:26:57,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:26:57" (2/3) ... [2025-03-08 00:26:57,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc2ec04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:26:57, skipping insertion in model container [2025-03-08 00:26:57,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:26:57" (3/3) ... [2025-03-08 00:26:57,929 INFO L128 eAbstractionObserver]: Analyzing ICFG tcpy.c [2025-03-08 00:26:57,941 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:26:57,942 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tcpy.c that has 1 procedures, 17 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 00:26:57,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:26:57,984 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;@8d216c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:26:57,984 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:26:57,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 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:26:57,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 00:26:57,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:26:57,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:26:57,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:26:57,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:26:57,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1070130223, now seen corresponding path program 1 times [2025-03-08 00:26:57,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:26:57,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017695620] [2025-03-08 00:26:57,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:26:57,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:26:58,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 00:26:58,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 00:26:58,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:26:58,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:58,112 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:26:58,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:26:58,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017695620] [2025-03-08 00:26:58,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017695620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:26:58,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:26:58,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:26:58,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374289170] [2025-03-08 00:26:58,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:26:58,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 00:26:58,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:26:58,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 00:26:58,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:26:58,131 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 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) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:26:58,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:26:58,139 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2025-03-08 00:26:58,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 00:26:58,140 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 00:26:58,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:26:58,143 INFO L225 Difference]: With dead ends: 28 [2025-03-08 00:26:58,143 INFO L226 Difference]: Without dead ends: 13 [2025-03-08 00:26:58,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:26:58,146 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:26:58,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:26:58,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-03-08 00:26:58,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-03-08 00:26:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:26:58,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-03-08 00:26:58,164 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2025-03-08 00:26:58,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:26:58,164 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-03-08 00:26:58,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:26:58,164 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2025-03-08 00:26:58,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 00:26:58,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:26:58,164 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:26:58,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:26:58,165 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:26:58,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:26:58,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1041501072, now seen corresponding path program 1 times [2025-03-08 00:26:58,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:26:58,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554804143] [2025-03-08 00:26:58,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:26:58,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:26:58,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 00:26:58,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 00:26:58,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:26:58,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:58,281 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:26:58,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:26:58,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554804143] [2025-03-08 00:26:58,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554804143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:26:58,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:26:58,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:26:58,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904364900] [2025-03-08 00:26:58,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:26:58,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:26:58,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:26:58,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:26:58,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:26:58,285 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:26:58,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:26:58,305 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2025-03-08 00:26:58,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:26:58,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 00:26:58,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:26:58,306 INFO L225 Difference]: With dead ends: 23 [2025-03-08 00:26:58,306 INFO L226 Difference]: Without dead ends: 14 [2025-03-08 00:26:58,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:26:58,306 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:26:58,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:26:58,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-08 00:26:58,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-08 00:26:58,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 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:26:58,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2025-03-08 00:26:58,311 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2025-03-08 00:26:58,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:26:58,311 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-03-08 00:26:58,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:26:58,312 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2025-03-08 00:26:58,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 00:26:58,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:26:58,312 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:26:58,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:26:58,313 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:26:58,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:26:58,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1021966120, now seen corresponding path program 1 times [2025-03-08 00:26:58,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:26:58,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153810372] [2025-03-08 00:26:58,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:26:58,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:26:58,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 00:26:58,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 00:26:58,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:26:58,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:58,427 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:26:58,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:26:58,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153810372] [2025-03-08 00:26:58,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153810372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:26:58,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094882839] [2025-03-08 00:26:58,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:26:58,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:26:58,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:26:58,430 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:26:58,431 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:26:58,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 00:26:58,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 00:26:58,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:26:58,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:58,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:26:58,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:26:58,574 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:26:58,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:26:58,595 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:26:58,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094882839] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:26:58,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:26:58,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 00:26:58,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887615563] [2025-03-08 00:26:58,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:26:58,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:26:58,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:26:58,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:26:58,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:26:58,596 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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:26:58,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:26:58,632 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2025-03-08 00:26:58,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:26:58,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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:26:58,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:26:58,633 INFO L225 Difference]: With dead ends: 24 [2025-03-08 00:26:58,633 INFO L226 Difference]: Without dead ends: 15 [2025-03-08 00:26:58,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:26:58,634 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:26:58,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 26 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:26:58,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-08 00:26:58,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-08 00:26:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 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:26:58,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2025-03-08 00:26:58,635 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2025-03-08 00:26:58,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:26:58,636 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-03-08 00:26:58,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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:26:58,636 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2025-03-08 00:26:58,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 00:26:58,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:26:58,636 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:26:58,643 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:26:58,841 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:26:58,841 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:26:58,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:26:58,842 INFO L85 PathProgramCache]: Analyzing trace with hash -416382608, now seen corresponding path program 2 times [2025-03-08 00:26:58,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:26:58,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774898397] [2025-03-08 00:26:58,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:26:58,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:26:58,849 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-08 00:26:58,860 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 13 statements. [2025-03-08 00:26:58,860 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 00:26:58,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:58,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:26:58,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:26:58,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774898397] [2025-03-08 00:26:58,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774898397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:26:58,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:26:58,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 00:26:58,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938599260] [2025-03-08 00:26:58,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:26:58,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:26:58,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:26:58,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:26:58,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:26:58,989 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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:26:59,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:26:59,019 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2025-03-08 00:26:59,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:26:59,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 00:26:59,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:26:59,020 INFO L225 Difference]: With dead ends: 26 [2025-03-08 00:26:59,020 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 00:26:59,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:26:59,021 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:26:59,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 12 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:26:59,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 00:26:59,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2025-03-08 00:26:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 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:26:59,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2025-03-08 00:26:59,027 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2025-03-08 00:26:59,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:26:59,028 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-03-08 00:26:59,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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:26:59,028 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2025-03-08 00:26:59,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 00:26:59,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:26:59,028 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:26:59,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 00:26:59,029 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:26:59,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:26:59,029 INFO L85 PathProgramCache]: Analyzing trace with hash -22003689, now seen corresponding path program 1 times [2025-03-08 00:26:59,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:26:59,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967828781] [2025-03-08 00:26:59,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:26:59,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:26:59,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 00:26:59,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 00:26:59,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:26:59,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:26:59,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:26:59,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967828781] [2025-03-08 00:26:59,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967828781] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:26:59,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245621405] [2025-03-08 00:26:59,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:26:59,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:26:59,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:26:59,349 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:26:59,351 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:26:59,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 00:26:59,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 00:26:59,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:26:59,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:26:59,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 00:26:59,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:26:59,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2025-03-08 00:26:59,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:26:59,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:26:59,748 INFO L349 Elim1Store]: treesize reduction 10, result has 67.7 percent of original size [2025-03-08 00:26:59,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 46 [2025-03-08 00:26:59,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:26:59,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245621405] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:26:59,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:26:59,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 6] total 17 [2025-03-08 00:26:59,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342890625] [2025-03-08 00:26:59,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:26:59,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 00:26:59,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:26:59,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 00:26:59,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:26:59,772 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 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:26:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:26:59,912 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2025-03-08 00:26:59,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:26:59,912 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 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:26:59,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:26:59,912 INFO L225 Difference]: With dead ends: 21 [2025-03-08 00:26:59,913 INFO L226 Difference]: Without dead ends: 19 [2025-03-08 00:26:59,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2025-03-08 00:26:59,913 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 32 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:26:59,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 25 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:26:59,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-08 00:26:59,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2025-03-08 00:26:59,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 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:26:59,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-03-08 00:26:59,917 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2025-03-08 00:26:59,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:26:59,918 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-03-08 00:26:59,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 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:26:59,918 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-03-08 00:26:59,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 00:26:59,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:26:59,918 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:26:59,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 00:27:00,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:00,122 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:00,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:00,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1618970100, now seen corresponding path program 1 times [2025-03-08 00:27:00,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:00,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477946366] [2025-03-08 00:27:00,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:27:00,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:00,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:27:00,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:27:00,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:27:00,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:00,561 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:27:00,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:00,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477946366] [2025-03-08 00:27:00,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477946366] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:00,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529484835] [2025-03-08 00:27:00,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:27:00,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:00,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:00,577 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:27:00,579 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:27:00,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:27:00,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:27:00,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:27:00,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:00,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 00:27:00,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:27:00,696 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:27:00,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2025-03-08 00:27:00,860 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:27:00,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:27:00,931 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 45 treesize of output 43 [2025-03-08 00:27:00,935 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 86 treesize of output 82 [2025-03-08 00:27:01,139 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:27:01,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529484835] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:27:01,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:27:01,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 31 [2025-03-08 00:27:01,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855723045] [2025-03-08 00:27:01,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:27:01,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 00:27:01,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:01,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 00:27:01,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2025-03-08 00:27:01,140 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 31 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 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:27:01,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:01,493 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2025-03-08 00:27:01,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 00:27:01,494 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 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) Word has length 17 [2025-03-08 00:27:01,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:01,494 INFO L225 Difference]: With dead ends: 61 [2025-03-08 00:27:01,494 INFO L226 Difference]: Without dead ends: 53 [2025-03-08 00:27:01,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=357, Invalid=1449, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 00:27:01,495 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 139 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:01,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 109 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:27:01,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-08 00:27:01,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2025-03-08 00:27:01,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.1875) internal successors, (38), 32 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:27:01,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2025-03-08 00:27:01,502 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 17 [2025-03-08 00:27:01,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:01,502 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-03-08 00:27:01,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 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:27:01,503 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2025-03-08 00:27:01,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 00:27:01,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:01,503 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:01,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 00:27:01,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:01,707 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:01,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:01,707 INFO L85 PathProgramCache]: Analyzing trace with hash -622570764, now seen corresponding path program 2 times [2025-03-08 00:27:01,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:01,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883378769] [2025-03-08 00:27:01,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:27:01,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:01,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-08 00:27:01,737 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 00:27:01,737 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:27:01,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:01,918 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:27:01,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:01,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883378769] [2025-03-08 00:27:01,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883378769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:01,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760797497] [2025-03-08 00:27:01,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:27:01,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:01,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:01,921 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:27:01,922 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:27:01,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-08 00:27:01,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 00:27:01,973 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:27:01,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:01,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 00:27:01,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:27:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:27:02,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:27:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:27:02,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760797497] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:27:02,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:27:02,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2025-03-08 00:27:02,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523678829] [2025-03-08 00:27:02,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:27:02,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 00:27:02,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:02,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 00:27:02,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:27:02,305 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 24 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:02,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:02,548 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2025-03-08 00:27:02,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 00:27:02,549 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-08 00:27:02,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:02,549 INFO L225 Difference]: With dead ends: 72 [2025-03-08 00:27:02,550 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 00:27:02,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=626, Unknown=0, NotChecked=0, Total=870 [2025-03-08 00:27:02,551 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 64 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:02,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 131 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:27:02,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 00:27:02,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 35. [2025-03-08 00:27:02,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 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:27:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-03-08 00:27:02,557 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 19 [2025-03-08 00:27:02,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:02,558 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-03-08 00:27:02,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:02,558 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-03-08 00:27:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 00:27:02,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:02,558 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:02,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 00:27:02,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:02,759 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:02,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:02,759 INFO L85 PathProgramCache]: Analyzing trace with hash 542665755, now seen corresponding path program 3 times [2025-03-08 00:27:02,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:02,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215188587] [2025-03-08 00:27:02,760 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:27:02,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:02,766 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-03-08 00:27:02,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 20 statements. [2025-03-08 00:27:02,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:27:02,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:27:02,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:02,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215188587] [2025-03-08 00:27:02,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215188587] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:02,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361284283] [2025-03-08 00:27:02,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:27:03,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:03,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:03,001 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:27:03,004 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:27:03,042 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-03-08 00:27:03,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 20 statements. [2025-03-08 00:27:03,056 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:27:03,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:03,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 00:27:03,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:27:03,096 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-03-08 00:27:03,097 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 1 case distinctions, treesize of input 30 treesize of output 31 [2025-03-08 00:27:04,890 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:27:04,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:27:04,952 INFO L349 Elim1Store]: treesize reduction 10, result has 67.7 percent of original size [2025-03-08 00:27:04,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 48 [2025-03-08 00:27:04,980 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:27:04,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361284283] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:27:04,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:27:04,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2025-03-08 00:27:04,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044949204] [2025-03-08 00:27:04,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:27:04,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 00:27:04,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:04,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 00:27:04,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=237, Unknown=3, NotChecked=0, Total=306 [2025-03-08 00:27:04,981 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 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:27:05,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:05,100 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2025-03-08 00:27:05,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:27:05,100 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 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 20 [2025-03-08 00:27:05,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:05,100 INFO L225 Difference]: With dead ends: 54 [2025-03-08 00:27:05,100 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 00:27:05,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=79, Invalid=260, Unknown=3, NotChecked=0, Total=342 [2025-03-08 00:27:05,101 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 30 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:05,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 99 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:27:05,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 00:27:05,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 28. [2025-03-08 00:27:05,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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:27:05,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2025-03-08 00:27:05,107 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20 [2025-03-08 00:27:05,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:05,107 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2025-03-08 00:27:05,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 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:27:05,107 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2025-03-08 00:27:05,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 00:27:05,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:05,107 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:05,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 00:27:05,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:05,312 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:05,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:05,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1743612169, now seen corresponding path program 4 times [2025-03-08 00:27:05,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:05,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940951787] [2025-03-08 00:27:05,312 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:27:05,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:05,318 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-08 00:27:05,320 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 20 statements. [2025-03-08 00:27:05,320 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:27:05,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:05,402 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:27:05,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:05,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940951787] [2025-03-08 00:27:05,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940951787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:05,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042847365] [2025-03-08 00:27:05,403 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:27:05,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:05,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:05,404 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:27:05,406 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:27:05,442 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-08 00:27:05,450 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 20 statements. [2025-03-08 00:27:05,450 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:27:05,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:05,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:27:05,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:27:05,601 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:27:05,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:27:05,669 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:27:05,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042847365] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:27:05,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:27:05,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-08 00:27:05,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077059971] [2025-03-08 00:27:05,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:27:05,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 00:27:05,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:05,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 00:27:05,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:27:05,672 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 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:27:05,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:05,773 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2025-03-08 00:27:05,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:27:05,773 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 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 20 [2025-03-08 00:27:05,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:05,774 INFO L225 Difference]: With dead ends: 41 [2025-03-08 00:27:05,774 INFO L226 Difference]: Without dead ends: 24 [2025-03-08 00:27:05,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:27:05,774 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:05,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 47 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:27:05,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-08 00:27:05,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-03-08 00:27:05,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:05,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2025-03-08 00:27:05,780 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2025-03-08 00:27:05,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:05,780 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2025-03-08 00:27:05,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 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:27:05,780 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2025-03-08 00:27:05,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 00:27:05,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:05,781 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:05,788 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:27:05,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:05,982 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:05,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:05,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1876094760, now seen corresponding path program 5 times [2025-03-08 00:27:05,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:05,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69700551] [2025-03-08 00:27:05,983 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:27:05,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:05,989 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-03-08 00:27:05,996 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 00:27:05,996 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-08 00:27:05,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:06,093 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:27:06,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:06,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69700551] [2025-03-08 00:27:06,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69700551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:06,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487648412] [2025-03-08 00:27:06,093 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:27:06,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:06,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:06,095 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:27:06,097 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:27:06,136 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-03-08 00:27:06,173 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 00:27:06,173 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-08 00:27:06,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:06,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 00:27:06,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:27:06,217 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:27:06,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:27:06,334 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:27:06,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487648412] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:27:06,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:27:06,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-08 00:27:06,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994777042] [2025-03-08 00:27:06,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:27:06,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 00:27:06,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:06,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 00:27:06,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:27:06,338 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:06,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:06,416 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2025-03-08 00:27:06,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 00:27:06,416 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-08 00:27:06,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:06,417 INFO L225 Difference]: With dead ends: 47 [2025-03-08 00:27:06,417 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 00:27:06,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:27:06,418 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:06,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 42 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:27:06,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 00:27:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2025-03-08 00:27:06,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:06,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-03-08 00:27:06,424 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 22 [2025-03-08 00:27:06,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:06,424 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-03-08 00:27:06,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:06,424 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-03-08 00:27:06,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 00:27:06,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:06,425 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:06,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 00:27:06,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:06,625 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:06,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:06,626 INFO L85 PathProgramCache]: Analyzing trace with hash 299477872, now seen corresponding path program 6 times [2025-03-08 00:27:06,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:06,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993265051] [2025-03-08 00:27:06,626 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:27:06,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:06,636 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 3 equivalence classes. [2025-03-08 00:27:06,649 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 00:27:06,649 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-08 00:27:06,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:07,194 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:27:07,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:07,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993265051] [2025-03-08 00:27:07,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993265051] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:07,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127886031] [2025-03-08 00:27:07,195 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:27:07,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:07,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:07,198 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:27:07,199 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:27:07,244 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 3 equivalence classes. [2025-03-08 00:27:07,263 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 00:27:07,263 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-08 00:27:07,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:07,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-08 00:27:07,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:27:07,330 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:27:07,351 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:27:07,471 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 28 treesize of output 13 [2025-03-08 00:27:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:27:07,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:27:07,725 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 45 treesize of output 43 [2025-03-08 00:27:07,727 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 190 treesize of output 182 [2025-03-08 00:27:08,033 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:27:08,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127886031] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:27:08,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:27:08,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 44 [2025-03-08 00:27:08,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706416020] [2025-03-08 00:27:08,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:27:08,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-08 00:27:08,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:08,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-08 00:27:08,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1648, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 00:27:08,035 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 44 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 44 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:09,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:09,023 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2025-03-08 00:27:09,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-08 00:27:09,023 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 44 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-08 00:27:09,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:09,023 INFO L225 Difference]: With dead ends: 101 [2025-03-08 00:27:09,023 INFO L226 Difference]: Without dead ends: 90 [2025-03-08 00:27:09,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=967, Invalid=4583, Unknown=0, NotChecked=0, Total=5550 [2025-03-08 00:27:09,026 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 215 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:09,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 198 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:27:09,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-08 00:27:09,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 43. [2025-03-08 00:27:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 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:27:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2025-03-08 00:27:09,036 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 23 [2025-03-08 00:27:09,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:09,036 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2025-03-08 00:27:09,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 44 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:09,036 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2025-03-08 00:27:09,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:27:09,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:09,037 INFO L218 NwaCegarLoop]: trace histogram [6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:09,043 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:27:09,237 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,SelfDestructingSolverStorable10 [2025-03-08 00:27:09,237 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:09,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:09,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1901021072, now seen corresponding path program 7 times [2025-03-08 00:27:09,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:09,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970862925] [2025-03-08 00:27:09,238 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:27:09,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:09,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:27:09,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:27:09,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:27:09,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:27:09,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:09,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970862925] [2025-03-08 00:27:09,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970862925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:09,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389011639] [2025-03-08 00:27:09,450 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:27:09,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:09,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:09,452 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:27:09,453 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:27:09,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:27:09,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:27:09,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:27:09,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:09,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 00:27:09,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:27:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:27:09,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:27:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:27:09,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389011639] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:27:09,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:27:09,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2025-03-08 00:27:09,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715906296] [2025-03-08 00:27:09,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:27:09,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-08 00:27:09,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:09,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-08 00:27:09,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=785, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 00:27:09,922 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 33 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 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:27:10,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:10,183 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2025-03-08 00:27:10,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:27:10,184 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 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) Word has length 25 [2025-03-08 00:27:10,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:10,184 INFO L225 Difference]: With dead ends: 104 [2025-03-08 00:27:10,184 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 00:27:10,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=432, Invalid=1208, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 00:27:10,185 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 114 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:10,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 193 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:27:10,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 00:27:10,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 45. [2025-03-08 00:27:10,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 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:27:10,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2025-03-08 00:27:10,195 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 25 [2025-03-08 00:27:10,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:10,195 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2025-03-08 00:27:10,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 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:27:10,195 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2025-03-08 00:27:10,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 00:27:10,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:10,195 INFO L218 NwaCegarLoop]: trace histogram [6, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:10,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 00:27:10,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:10,396 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:10,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:10,396 INFO L85 PathProgramCache]: Analyzing trace with hash -37131241, now seen corresponding path program 8 times [2025-03-08 00:27:10,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:10,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377349977] [2025-03-08 00:27:10,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:27:10,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:10,407 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-08 00:27:10,419 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:27:10,419 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:27:10,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 00:27:10,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:10,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377349977] [2025-03-08 00:27:10,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377349977] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:10,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933352656] [2025-03-08 00:27:10,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:27:10,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:10,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:10,678 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:27:10,679 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:27:10,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-08 00:27:10,747 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:27:10,747 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:27:10,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:10,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 00:27:10,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:27:10,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2025-03-08 00:27:11,122 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:27:11,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:27:11,190 INFO L349 Elim1Store]: treesize reduction 10, result has 67.7 percent of original size [2025-03-08 00:27:11,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 48 [2025-03-08 00:27:11,231 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 00:27:11,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933352656] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:27:11,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:27:11,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 10] total 31 [2025-03-08 00:27:11,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529092342] [2025-03-08 00:27:11,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:27:11,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 00:27:11,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:11,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 00:27:11,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=794, Unknown=0, NotChecked=0, Total=930 [2025-03-08 00:27:11,233 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 31 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:11,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:11,505 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2025-03-08 00:27:11,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:27:11,505 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-08 00:27:11,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:11,506 INFO L225 Difference]: With dead ends: 70 [2025-03-08 00:27:11,506 INFO L226 Difference]: Without dead ends: 68 [2025-03-08 00:27:11,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=218, Invalid=1114, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 00:27:11,506 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 66 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:11,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 142 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:27:11,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-08 00:27:11,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 35. [2025-03-08 00:27:11,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 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:27:11,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2025-03-08 00:27:11,524 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 26 [2025-03-08 00:27:11,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:11,524 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2025-03-08 00:27:11,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:11,524 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2025-03-08 00:27:11,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 00:27:11,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:11,525 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:11,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 00:27:11,727 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,SelfDestructingSolverStorable12 [2025-03-08 00:27:11,728 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:11,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:11,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1099083771, now seen corresponding path program 9 times [2025-03-08 00:27:11,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:11,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840758172] [2025-03-08 00:27:11,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:27:11,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:11,734 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-03-08 00:27:11,756 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:27:11,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 00:27:11,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:12,440 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:27:12,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:12,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840758172] [2025-03-08 00:27:12,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840758172] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:12,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818139028] [2025-03-08 00:27:12,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:27:12,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:12,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:12,443 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:27:12,443 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:27:12,492 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-03-08 00:27:12,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:27:12,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 00:27:12,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:12,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 00:27:12,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:27:12,590 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:27:12,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2025-03-08 00:27:12,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2025-03-08 00:27:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:27:12,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:27:13,033 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 76 treesize of output 74 [2025-03-08 00:27:13,037 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 6086 treesize of output 6022 [2025-03-08 00:27:13,267 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:27:13,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818139028] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:27:13,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:27:13,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 42 [2025-03-08 00:27:13,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785936663] [2025-03-08 00:27:13,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:27:13,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-08 00:27:13,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:13,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-08 00:27:13,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1472, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 00:27:13,269 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 42 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 42 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:14,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:14,624 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2025-03-08 00:27:14,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-08 00:27:14,624 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 42 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-08 00:27:14,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:14,624 INFO L225 Difference]: With dead ends: 113 [2025-03-08 00:27:14,624 INFO L226 Difference]: Without dead ends: 74 [2025-03-08 00:27:14,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1779 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1111, Invalid=5861, Unknown=0, NotChecked=0, Total=6972 [2025-03-08 00:27:14,626 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 240 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:14,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 219 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:27:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-08 00:27:14,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 34. [2025-03-08 00:27:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 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:27:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2025-03-08 00:27:14,635 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 26 [2025-03-08 00:27:14,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:14,635 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2025-03-08 00:27:14,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 42 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:14,636 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2025-03-08 00:27:14,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 00:27:14,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:14,637 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:14,643 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:27:14,838 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,SelfDestructingSolverStorable13 [2025-03-08 00:27:14,838 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:14,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:14,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1925634548, now seen corresponding path program 10 times [2025-03-08 00:27:14,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:14,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032242010] [2025-03-08 00:27:14,838 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:27:14,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:14,848 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-08 00:27:14,851 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 29 statements. [2025-03-08 00:27:14,851 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:27:14,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 00:27:15,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:15,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032242010] [2025-03-08 00:27:15,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032242010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:15,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974476912] [2025-03-08 00:27:15,144 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:27:15,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:15,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:15,147 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:27:15,148 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:27:15,199 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-08 00:27:15,212 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 29 statements. [2025-03-08 00:27:15,212 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:27:15,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:15,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 00:27:15,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:27:15,293 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2025-03-08 00:27:15,293 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 1 case distinctions, treesize of input 36 treesize of output 21 [2025-03-08 00:27:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 00:27:15,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:27:15,618 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-08 00:27:15,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 33 [2025-03-08 00:27:15,740 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 00:27:15,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974476912] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:27:15,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:27:15,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 33 [2025-03-08 00:27:15,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834302232] [2025-03-08 00:27:15,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:27:15,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-08 00:27:15,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:15,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-08 00:27:15,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=885, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 00:27:15,741 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 33 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:16,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:16,377 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2025-03-08 00:27:16,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 00:27:16,378 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-08 00:27:16,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:16,378 INFO L225 Difference]: With dead ends: 76 [2025-03-08 00:27:16,378 INFO L226 Difference]: Without dead ends: 74 [2025-03-08 00:27:16,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=440, Invalid=2212, Unknown=0, NotChecked=0, Total=2652 [2025-03-08 00:27:16,379 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 194 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:16,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 141 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:27:16,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-08 00:27:16,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 51. [2025-03-08 00:27:16,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 0 states have call successors, (0), 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:27:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2025-03-08 00:27:16,395 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 29 [2025-03-08 00:27:16,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:16,395 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2025-03-08 00:27:16,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:16,395 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2025-03-08 00:27:16,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 00:27:16,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:16,398 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:16,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 00:27:16,598 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,SelfDestructingSolverStorable14 [2025-03-08 00:27:16,599 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:16,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:16,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1298480393, now seen corresponding path program 11 times [2025-03-08 00:27:16,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:16,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095739874] [2025-03-08 00:27:16,599 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:27:16,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:16,608 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 5 equivalence classes. [2025-03-08 00:27:16,624 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 00:27:16,627 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-08 00:27:16,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:27:17,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:17,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095739874] [2025-03-08 00:27:17,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095739874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:17,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58046002] [2025-03-08 00:27:17,316 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:27:17,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:17,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:17,318 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:27:17,319 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:27:17,382 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 5 equivalence classes. [2025-03-08 00:27:17,475 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 00:27:17,475 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-08 00:27:17,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:17,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-08 00:27:17,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:27:17,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:27:17,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2025-03-08 00:27:17,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:27:17,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:27:17,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2025-03-08 00:27:18,091 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:27:18,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:27:18,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:27:18,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 67 [2025-03-08 00:27:18,425 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 46 treesize of output 44 [2025-03-08 00:27:18,431 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 442 treesize of output 434 [2025-03-08 00:27:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 21 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:27:18,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58046002] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:27:18,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:27:18,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 55 [2025-03-08 00:27:18,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841226189] [2025-03-08 00:27:18,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:27:18,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-08 00:27:18,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:18,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-08 00:27:18,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=2611, Unknown=0, NotChecked=0, Total=2970 [2025-03-08 00:27:18,879 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 55 states, 55 states have (on average 1.6181818181818182) internal successors, (89), 55 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:27:19,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:19,969 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2025-03-08 00:27:19,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-08 00:27:19,970 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.6181818181818182) internal successors, (89), 55 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) Word has length 32 [2025-03-08 00:27:19,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:19,971 INFO L225 Difference]: With dead ends: 93 [2025-03-08 00:27:19,971 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 00:27:19,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=891, Invalid=5115, Unknown=0, NotChecked=0, Total=6006 [2025-03-08 00:27:19,973 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 254 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:19,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 225 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:27:19,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 00:27:19,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 57. [2025-03-08 00:27:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 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:27:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2025-03-08 00:27:19,998 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 32 [2025-03-08 00:27:19,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:19,999 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2025-03-08 00:27:19,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.6181818181818182) internal successors, (89), 55 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:27:19,999 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2025-03-08 00:27:19,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 00:27:19,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:19,999 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:20,006 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:27:20,200 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,SelfDestructingSolverStorable15 [2025-03-08 00:27:20,201 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:20,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:20,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1741920020, now seen corresponding path program 12 times [2025-03-08 00:27:20,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:20,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117110201] [2025-03-08 00:27:20,201 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:27:20,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:20,209 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 6 equivalence classes. [2025-03-08 00:27:20,232 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:27:20,232 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-08 00:27:20,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:27:21,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:21,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117110201] [2025-03-08 00:27:21,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117110201] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:21,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184226824] [2025-03-08 00:27:21,199 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:27:21,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:21,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:21,201 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:27:21,202 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:27:21,265 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 6 equivalence classes. [2025-03-08 00:27:21,367 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:27:21,367 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-08 00:27:21,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:21,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-08 00:27:21,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:27:21,464 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:27:21,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2025-03-08 00:27:21,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2025-03-08 00:27:21,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:27:21,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 40 [2025-03-08 00:27:21,986 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:27:21,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:27:22,307 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 107 treesize of output 105 [2025-03-08 00:27:22,312 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 48814 treesize of output 48686 [2025-03-08 00:27:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:27:22,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184226824] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:27:22,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:27:22,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 21] total 54 [2025-03-08 00:27:22,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068426957] [2025-03-08 00:27:22,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:27:22,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-08 00:27:22,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:22,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-08 00:27:22,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=2364, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 00:27:22,805 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 54 states, 54 states have (on average 1.7407407407407407) internal successors, (94), 54 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:26,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:26,302 INFO L93 Difference]: Finished difference Result 251 states and 274 transitions. [2025-03-08 00:27:26,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2025-03-08 00:27:26,303 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.7407407407407407) internal successors, (94), 54 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-08 00:27:26,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:26,304 INFO L225 Difference]: With dead ends: 251 [2025-03-08 00:27:26,304 INFO L226 Difference]: Without dead ends: 175 [2025-03-08 00:27:26,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6420 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3385, Invalid=16921, Unknown=0, NotChecked=0, Total=20306 [2025-03-08 00:27:26,307 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 962 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:26,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 311 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:27:26,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-08 00:27:26,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 108. [2025-03-08 00:27:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.102803738317757) internal successors, (118), 107 states have internal predecessors, (118), 0 states have call successors, (0), 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:27:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2025-03-08 00:27:26,347 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 35 [2025-03-08 00:27:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:26,347 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2025-03-08 00:27:26,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.7407407407407407) internal successors, (94), 54 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:26,347 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2025-03-08 00:27:26,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 00:27:26,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:26,347 INFO L218 NwaCegarLoop]: trace histogram [9, 6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:26,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-08 00:27:26,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:26,548 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:26,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:26,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1022600083, now seen corresponding path program 13 times [2025-03-08 00:27:26,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:26,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644224963] [2025-03-08 00:27:26,548 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:27:26,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:26,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 00:27:26,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:27:26,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:27:26,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:26,859 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 27 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 00:27:26,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:26,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644224963] [2025-03-08 00:27:26,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644224963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:26,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875812879] [2025-03-08 00:27:26,860 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:27:26,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:26,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:26,862 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:27:26,863 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:27:26,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 00:27:26,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:27:26,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:27:26,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:26,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 00:27:26,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:27:27,167 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 36 proven. 19 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 00:27:27,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:27:27,596 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 45 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 00:27:27,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875812879] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:27:27,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:27:27,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 49 [2025-03-08 00:27:27,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559991622] [2025-03-08 00:27:27,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:27:27,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-08 00:27:27,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:27,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-08 00:27:27,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=1865, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 00:27:27,597 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand has 49 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 states have internal predecessors, (63), 0 states have call successors, (0), 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:27:27,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:27,992 INFO L93 Difference]: Finished difference Result 153 states and 161 transitions. [2025-03-08 00:27:27,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 00:27:27,993 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 states have internal predecessors, (63), 0 states have call successors, (0), 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:27:27,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:27,993 INFO L225 Difference]: With dead ends: 153 [2025-03-08 00:27:27,993 INFO L226 Difference]: Without dead ends: 128 [2025-03-08 00:27:27,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=770, Invalid=2652, Unknown=0, NotChecked=0, Total=3422 [2025-03-08 00:27:27,994 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 121 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:27,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 320 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:27:27,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-08 00:27:28,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 91. [2025-03-08 00:27:28,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.1) internal successors, (99), 90 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:28,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2025-03-08 00:27:28,027 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 39 [2025-03-08 00:27:28,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:28,027 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2025-03-08 00:27:28,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 states have internal predecessors, (63), 0 states have call successors, (0), 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:27:28,027 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2025-03-08 00:27:28,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 00:27:28,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:28,028 INFO L218 NwaCegarLoop]: trace histogram [9, 7, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:28,034 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:27:28,228 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,SelfDestructingSolverStorable17 [2025-03-08 00:27:28,229 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:28,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:28,229 INFO L85 PathProgramCache]: Analyzing trace with hash -819292465, now seen corresponding path program 14 times [2025-03-08 00:27:28,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:28,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053544065] [2025-03-08 00:27:28,229 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:27:28,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:28,238 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-08 00:27:28,243 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:27:28,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:27:28,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:28,491 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 22 proven. 51 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 00:27:28,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:28,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053544065] [2025-03-08 00:27:28,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053544065] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:28,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121491096] [2025-03-08 00:27:28,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:27:28,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:28,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:28,494 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:27:28,495 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:27:28,569 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-08 00:27:28,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:27:28,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:27:28,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:28,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 00:27:28,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:27:28,722 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 28 proven. 45 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 00:27:28,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:27:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 28 proven. 45 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 00:27:29,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121491096] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:27:29,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:27:29,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 46 [2025-03-08 00:27:29,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816433129] [2025-03-08 00:27:29,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:27:29,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-08 00:27:29,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:29,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-08 00:27:29,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=569, Invalid=1501, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 00:27:29,085 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 46 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 0 states have call successors, (0), 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:27:29,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:29,460 INFO L93 Difference]: Finished difference Result 237 states and 253 transitions. [2025-03-08 00:27:29,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-08 00:27:29,461 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 0 states have call successors, (0), 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:27:29,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:29,462 INFO L225 Difference]: With dead ends: 237 [2025-03-08 00:27:29,462 INFO L226 Difference]: Without dead ends: 190 [2025-03-08 00:27:29,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1039, Invalid=2501, Unknown=0, NotChecked=0, Total=3540 [2025-03-08 00:27:29,463 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 191 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:29,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 160 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:27:29,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-08 00:27:29,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 106. [2025-03-08 00:27:29,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.1333333333333333) internal successors, (119), 105 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:29,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2025-03-08 00:27:29,504 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 39 [2025-03-08 00:27:29,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:29,504 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2025-03-08 00:27:29,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 0 states have call successors, (0), 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:27:29,505 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2025-03-08 00:27:29,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 00:27:29,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:29,505 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:29,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-08 00:27:29,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:29,706 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:29,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:29,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1341059592, now seen corresponding path program 15 times [2025-03-08 00:27:29,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:29,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597058390] [2025-03-08 00:27:29,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:27:29,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:29,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 7 equivalence classes. [2025-03-08 00:27:29,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 34 of 40 statements. [2025-03-08 00:27:29,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 00:27:29,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:29,888 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 7 proven. 31 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-08 00:27:29,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:29,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597058390] [2025-03-08 00:27:29,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597058390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:29,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201989588] [2025-03-08 00:27:29,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:27:29,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:29,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:29,891 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:27:29,894 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:27:29,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 7 equivalence classes. [2025-03-08 00:27:30,053 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 34 of 40 statements. [2025-03-08 00:27:30,053 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 00:27:30,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:30,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 00:27:30,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:27:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 10 proven. 28 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-08 00:27:30,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:27:30,322 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 10 proven. 28 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-08 00:27:30,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201989588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:27:30,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:27:30,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 33 [2025-03-08 00:27:30,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412231537] [2025-03-08 00:27:30,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:27:30,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-08 00:27:30,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:30,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-08 00:27:30,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=767, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 00:27:30,323 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 33 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 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:27:30,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:30,454 INFO L93 Difference]: Finished difference Result 167 states and 179 transitions. [2025-03-08 00:27:30,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:27:30,454 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-08 00:27:30,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:30,454 INFO L225 Difference]: With dead ends: 167 [2025-03-08 00:27:30,454 INFO L226 Difference]: Without dead ends: 134 [2025-03-08 00:27:30,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=367, Invalid=893, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 00:27:30,455 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 36 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:30,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 81 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:27:30,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-08 00:27:30,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 106. [2025-03-08 00:27:30,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.1238095238095238) internal successors, (118), 105 states have internal predecessors, (118), 0 states have call successors, (0), 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:27:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2025-03-08 00:27:30,498 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 40 [2025-03-08 00:27:30,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:30,498 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2025-03-08 00:27:30,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 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:27:30,499 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2025-03-08 00:27:30,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 00:27:30,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:30,499 INFO L218 NwaCegarLoop]: trace histogram [10, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:30,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-08 00:27:30,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:30,699 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:30,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:30,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1017040372, now seen corresponding path program 16 times [2025-03-08 00:27:30,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:30,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182824944] [2025-03-08 00:27:30,700 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:27:30,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:30,708 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-03-08 00:27:30,711 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 28 of 41 statements. [2025-03-08 00:27:30,711 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:27:30,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:31,136 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 00:27:31,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:31,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182824944] [2025-03-08 00:27:31,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182824944] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:31,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632622131] [2025-03-08 00:27:31,137 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:27:31,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:31,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:31,138 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:27:31,140 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:27:31,218 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-03-08 00:27:31,235 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 28 of 41 statements. [2025-03-08 00:27:31,235 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:27:31,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:31,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-08 00:27:31,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:27:31,429 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2025-03-08 00:27:31,430 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 1 case distinctions, treesize of input 36 treesize of output 21 [2025-03-08 00:27:31,781 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 00:27:31,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:27:31,989 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-03-08 00:27:31,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 33 [2025-03-08 00:27:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 00:27:32,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632622131] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:27:32,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:27:32,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 45 [2025-03-08 00:27:32,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761751807] [2025-03-08 00:27:32,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:27:32,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-08 00:27:32,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:32,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-08 00:27:32,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1724, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 00:27:32,179 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand has 45 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 45 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:33,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:33,347 INFO L93 Difference]: Finished difference Result 157 states and 170 transitions. [2025-03-08 00:27:33,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-08 00:27:33,347 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 45 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-08 00:27:33,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:33,348 INFO L225 Difference]: With dead ends: 157 [2025-03-08 00:27:33,348 INFO L226 Difference]: Without dead ends: 155 [2025-03-08 00:27:33,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=602, Invalid=4090, Unknown=0, NotChecked=0, Total=4692 [2025-03-08 00:27:33,349 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 205 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:33,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 529 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:27:33,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-08 00:27:33,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 135. [2025-03-08 00:27:33,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.126865671641791) internal successors, (151), 134 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:27:33,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 151 transitions. [2025-03-08 00:27:33,416 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 151 transitions. Word has length 41 [2025-03-08 00:27:33,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:33,416 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 151 transitions. [2025-03-08 00:27:33,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 45 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:33,416 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 151 transitions. [2025-03-08 00:27:33,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 00:27:33,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:33,416 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:33,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-08 00:27:33,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:33,621 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:33,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:33,621 INFO L85 PathProgramCache]: Analyzing trace with hash 984953488, now seen corresponding path program 17 times [2025-03-08 00:27:33,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:33,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526669902] [2025-03-08 00:27:33,621 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:27:33,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:33,629 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 41 statements into 7 equivalence classes. [2025-03-08 00:27:33,644 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:27:33,644 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-08 00:27:33,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:34,688 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:27:34,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:34,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526669902] [2025-03-08 00:27:34,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526669902] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:34,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775601247] [2025-03-08 00:27:34,689 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:27:34,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:34,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:34,690 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:27:34,691 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:27:34,768 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 41 statements into 7 equivalence classes. [2025-03-08 00:27:34,990 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:27:34,990 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-08 00:27:34,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:34,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-08 00:27:34,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:27:35,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:27:35,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2025-03-08 00:27:35,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:27:35,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:27:35,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2025-03-08 00:27:35,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:27:35,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:27:35,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:27:35,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:27:35,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 64 [2025-03-08 00:27:36,025 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:27:36,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:27:36,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:27:36,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 107 treesize of output 96 [2025-03-08 00:27:36,580 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 65 treesize of output 63 [2025-03-08 00:27:36,584 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 1838 treesize of output 1830 [2025-03-08 00:27:37,563 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 36 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:27:37,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775601247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:27:37,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:27:37,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 72 [2025-03-08 00:27:37,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982219821] [2025-03-08 00:27:37,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:27:37,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2025-03-08 00:27:37,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:37,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2025-03-08 00:27:37,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=4572, Unknown=0, NotChecked=0, Total=5112 [2025-03-08 00:27:37,565 INFO L87 Difference]: Start difference. First operand 135 states and 151 transitions. Second operand has 72 states, 72 states have (on average 1.6111111111111112) internal successors, (116), 72 states have internal predecessors, (116), 0 states have call successors, (0), 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:27:40,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:40,028 INFO L93 Difference]: Finished difference Result 192 states and 210 transitions. [2025-03-08 00:27:40,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-08 00:27:40,028 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.6111111111111112) internal successors, (116), 72 states have internal predecessors, (116), 0 states have call successors, (0), 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 41 [2025-03-08 00:27:40,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:40,029 INFO L225 Difference]: With dead ends: 192 [2025-03-08 00:27:40,029 INFO L226 Difference]: Without dead ends: 190 [2025-03-08 00:27:40,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2104 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1533, Invalid=10239, Unknown=0, NotChecked=0, Total=11772 [2025-03-08 00:27:40,033 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 542 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:40,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 382 Invalid, 1671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1462 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 00:27:40,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-08 00:27:40,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 152. [2025-03-08 00:27:40,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.119205298013245) internal successors, (169), 151 states have internal predecessors, (169), 0 states have call successors, (0), 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:27:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 169 transitions. [2025-03-08 00:27:40,101 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 169 transitions. Word has length 41 [2025-03-08 00:27:40,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:40,101 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 169 transitions. [2025-03-08 00:27:40,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 1.6111111111111112) internal successors, (116), 72 states have internal predecessors, (116), 0 states have call successors, (0), 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:27:40,101 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions. [2025-03-08 00:27:40,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 00:27:40,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:40,101 INFO L218 NwaCegarLoop]: trace histogram [14, 7, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:40,108 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:27:40,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:40,302 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:40,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:40,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1842603319, now seen corresponding path program 18 times [2025-03-08 00:27:40,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:40,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208698126] [2025-03-08 00:27:40,302 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:27:40,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:40,312 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 8 equivalence classes. [2025-03-08 00:27:40,348 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:27:40,348 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-08 00:27:40,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:41,025 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 00:27:41,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:41,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208698126] [2025-03-08 00:27:41,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208698126] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:41,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545637693] [2025-03-08 00:27:41,025 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:27:41,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:41,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:41,027 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:27:41,030 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:27:41,111 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 8 equivalence classes. [2025-03-08 00:27:42,725 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:27:42,725 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-08 00:27:42,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:42,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-08 00:27:42,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:27:42,984 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:27:43,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:27:43,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2025-03-08 00:27:43,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:27:43,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:27:43,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:27:43,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:27:43,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:27:43,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 56 [2025-03-08 00:27:43,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:27:43,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:27:43,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:27:43,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 78 [2025-03-08 00:27:43,793 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 91 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:27:43,794 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:27:44,029 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 115 treesize of output 113 [2025-03-08 00:27:44,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25365178 treesize of output 25299642 [2025-03-08 00:27:44,494 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 00:27:44,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545637693] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:27:44,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:27:44,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 33, 16] total 62 [2025-03-08 00:27:44,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464873477] [2025-03-08 00:27:44,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:27:44,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-03-08 00:27:44,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:44,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-03-08 00:27:44,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=3410, Unknown=0, NotChecked=0, Total=3782 [2025-03-08 00:27:44,496 INFO L87 Difference]: Start difference. First operand 152 states and 169 transitions. Second operand has 62 states, 62 states have (on average 1.596774193548387) internal successors, (99), 62 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:47,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:47,689 INFO L93 Difference]: Finished difference Result 301 states and 324 transitions. [2025-03-08 00:27:47,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-03-08 00:27:47,689 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.596774193548387) internal successors, (99), 62 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-08 00:27:47,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:47,690 INFO L225 Difference]: With dead ends: 301 [2025-03-08 00:27:47,690 INFO L226 Difference]: Without dead ends: 247 [2025-03-08 00:27:47,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3175 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1423, Invalid=10133, Unknown=0, NotChecked=0, Total=11556 [2025-03-08 00:27:47,691 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 219 mSDsluCounter, 1446 mSDsCounter, 0 mSdLazyCounter, 3397 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 3492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 3397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:47,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1515 Invalid, 3492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 3397 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 00:27:47,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-08 00:27:47,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 127. [2025-03-08 00:27:47,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.119047619047619) internal successors, (141), 126 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:47,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2025-03-08 00:27:47,753 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 44 [2025-03-08 00:27:47,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:47,753 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2025-03-08 00:27:47,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.596774193548387) internal successors, (99), 62 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:47,753 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2025-03-08 00:27:47,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 00:27:47,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:47,754 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:47,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-08 00:27:47,954 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,SelfDestructingSolverStorable22 [2025-03-08 00:27:47,954 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:47,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:47,955 INFO L85 PathProgramCache]: Analyzing trace with hash -466332453, now seen corresponding path program 19 times [2025-03-08 00:27:47,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:47,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516451748] [2025-03-08 00:27:47,955 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:27:47,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:47,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 00:27:47,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:27:47,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:27:47,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:27:49,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:49,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516451748] [2025-03-08 00:27:49,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516451748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:49,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245804935] [2025-03-08 00:27:49,199 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:27:49,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:49,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:49,201 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:27:49,201 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:27:49,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 00:27:49,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:27:49,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:27:49,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:49,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-08 00:27:49,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:27:49,506 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:27:49,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2025-03-08 00:27:49,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2025-03-08 00:27:49,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:27:49,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 40 [2025-03-08 00:27:49,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:27:49,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 54 [2025-03-08 00:27:50,226 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:27:50,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:27:50,749 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 138 treesize of output 136 [2025-03-08 00:27:50,755 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 13186310 treesize of output 13178118 [2025-03-08 00:27:51,656 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:27:51,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245804935] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:27:51,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:27:51,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 28] total 75 [2025-03-08 00:27:51,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693812326] [2025-03-08 00:27:51,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:27:51,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2025-03-08 00:27:51,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:51,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2025-03-08 00:27:51,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=4979, Unknown=0, NotChecked=0, Total=5550 [2025-03-08 00:27:51,658 INFO L87 Difference]: Start difference. First operand 127 states and 141 transitions. Second operand has 75 states, 75 states have (on average 1.6533333333333333) internal successors, (124), 75 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:54,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:54,771 INFO L93 Difference]: Finished difference Result 276 states and 300 transitions. [2025-03-08 00:27:54,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-03-08 00:27:54,771 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 1.6533333333333333) internal successors, (124), 75 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-08 00:27:54,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:54,772 INFO L225 Difference]: With dead ends: 276 [2025-03-08 00:27:54,772 INFO L226 Difference]: Without dead ends: 243 [2025-03-08 00:27:54,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3966 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2418, Invalid=13332, Unknown=0, NotChecked=0, Total=15750 [2025-03-08 00:27:54,774 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 287 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 1811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:54,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 488 Invalid, 1811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1659 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 00:27:54,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-08 00:27:54,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 168. [2025-03-08 00:27:54,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.1317365269461077) internal successors, (189), 167 states have internal predecessors, (189), 0 states have call successors, (0), 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:27:54,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 189 transitions. [2025-03-08 00:27:54,868 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 189 transitions. Word has length 44 [2025-03-08 00:27:54,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:54,868 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 189 transitions. [2025-03-08 00:27:54,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 1.6533333333333333) internal successors, (124), 75 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:54,868 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 189 transitions. [2025-03-08 00:27:54,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 00:27:54,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:54,868 INFO L218 NwaCegarLoop]: trace histogram [12, 8, 7, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:54,875 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:27:55,069 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,SelfDestructingSolverStorable23 [2025-03-08 00:27:55,069 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:55,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:55,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1084528660, now seen corresponding path program 20 times [2025-03-08 00:27:55,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:55,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374048567] [2025-03-08 00:27:55,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:27:55,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:55,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-08 00:27:55,085 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 00:27:55,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:27:55,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 55 proven. 38 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-08 00:27:55,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:55,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374048567] [2025-03-08 00:27:55,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374048567] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:55,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730253582] [2025-03-08 00:27:55,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:27:55,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:55,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:55,441 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:27:55,442 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:27:55,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-08 00:27:55,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 00:27:55,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:27:55,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:55,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 00:27:55,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:27:55,885 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 66 proven. 27 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-08 00:27:55,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:27:56,385 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 15 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-08 00:27:56,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730253582] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:27:56,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:27:56,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 60 [2025-03-08 00:27:56,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576316131] [2025-03-08 00:27:56,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:27:56,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-03-08 00:27:56,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:56,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-03-08 00:27:56,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=831, Invalid=2709, Unknown=0, NotChecked=0, Total=3540 [2025-03-08 00:27:56,386 INFO L87 Difference]: Start difference. First operand 168 states and 189 transitions. Second operand has 60 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:56,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:56,927 INFO L93 Difference]: Finished difference Result 330 states and 356 transitions. [2025-03-08 00:27:56,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-08 00:27:56,928 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-08 00:27:56,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:56,929 INFO L225 Difference]: With dead ends: 330 [2025-03-08 00:27:56,929 INFO L226 Difference]: Without dead ends: 267 [2025-03-08 00:27:56,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1934 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1314, Invalid=3942, Unknown=0, NotChecked=0, Total=5256 [2025-03-08 00:27:56,930 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 247 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:56,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 264 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:27:56,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-08 00:27:57,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 154. [2025-03-08 00:27:57,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.130718954248366) internal successors, (173), 153 states have internal predecessors, (173), 0 states have call successors, (0), 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:27:57,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 173 transitions. [2025-03-08 00:27:57,016 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 173 transitions. Word has length 49 [2025-03-08 00:27:57,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:57,016 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 173 transitions. [2025-03-08 00:27:57,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:57,017 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 173 transitions. [2025-03-08 00:27:57,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 00:27:57,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:57,017 INFO L218 NwaCegarLoop]: trace histogram [12, 8, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:57,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-08 00:27:57,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:57,217 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:57,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:57,218 INFO L85 PathProgramCache]: Analyzing trace with hash 538796539, now seen corresponding path program 21 times [2025-03-08 00:27:57,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:57,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000442903] [2025-03-08 00:27:57,218 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:27:57,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:57,228 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 8 equivalence classes. [2025-03-08 00:27:57,310 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 00:27:57,310 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-08 00:27:57,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:28:02,725 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 30 proven. 80 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-08 00:28:02,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:28:02,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000442903] [2025-03-08 00:28:02,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000442903] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:28:02,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288973451] [2025-03-08 00:28:02,731 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:28:02,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:28:02,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:28:02,737 INFO L229 MonitoredProcess]: Starting monitored process 24 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:28:02,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-08 00:28:02,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 8 equivalence classes. [2025-03-08 00:28:03,243 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 00:28:03,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-08 00:28:03,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:28:03,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-03-08 00:28:03,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:28:03,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2025-03-08 00:28:03,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2025-03-08 00:28:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:28:04,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:28:04,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:28:04,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 67 [2025-03-08 00:28:04,718 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 46 treesize of output 44 [2025-03-08 00:28:04,722 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 482 treesize of output 474 [2025-03-08 00:28:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:28:05,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288973451] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:28:05,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:28:05,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 33, 34] total 83 [2025-03-08 00:28:05,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75654053] [2025-03-08 00:28:05,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:28:05,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2025-03-08 00:28:05,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:28:05,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2025-03-08 00:28:05,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=735, Invalid=6071, Unknown=0, NotChecked=0, Total=6806 [2025-03-08 00:28:05,615 INFO L87 Difference]: Start difference. First operand 154 states and 173 transitions. Second operand has 83 states, 83 states have (on average 1.6024096385542168) internal successors, (133), 83 states have internal predecessors, (133), 0 states have call successors, (0), 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:28:23,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:28:23,022 INFO L93 Difference]: Finished difference Result 643 states and 703 transitions. [2025-03-08 00:28:23,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2025-03-08 00:28:23,024 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 1.6024096385542168) internal successors, (133), 83 states have internal predecessors, (133), 0 states have call successors, (0), 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 50 [2025-03-08 00:28:23,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:28:23,026 INFO L225 Difference]: With dead ends: 643 [2025-03-08 00:28:23,026 INFO L226 Difference]: Without dead ends: 392 [2025-03-08 00:28:23,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33970 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=14411, Invalid=77701, Unknown=0, NotChecked=0, Total=92112 [2025-03-08 00:28:23,042 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 1876 mSDsluCounter, 1648 mSDsCounter, 0 mSdLazyCounter, 5209 mSolverCounterSat, 864 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1876 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 6073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 5209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:28:23,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1876 Valid, 1694 Invalid, 6073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 5209 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 00:28:23,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-08 00:28:23,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 90. [2025-03-08 00:28:23,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.1348314606741574) internal successors, (101), 89 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:28:23,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2025-03-08 00:28:23,121 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 50 [2025-03-08 00:28:23,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:28:23,121 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2025-03-08 00:28:23,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 1.6024096385542168) internal successors, (133), 83 states have internal predecessors, (133), 0 states have call successors, (0), 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:28:23,124 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2025-03-08 00:28:23,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 00:28:23,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:28:23,125 INFO L218 NwaCegarLoop]: trace histogram [14, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:28:23,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-08 00:28:23,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:28:23,329 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:28:23,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:28:23,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1565564428, now seen corresponding path program 22 times [2025-03-08 00:28:23,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:28:23,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171663169] [2025-03-08 00:28:23,330 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:28:23,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:28:23,353 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-03-08 00:28:23,447 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 36 of 53 statements. [2025-03-08 00:28:23,447 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:28:23,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat