./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/nsqm-if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/nsqm-if.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 8d7989c0f7330a23b935c06e29a235b3d1d683ab2aa8325b4804307d493787f2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 13:57:07,941 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 13:57:08,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 13:57:08,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 13:57:08,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 13:57:08,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 13:57:08,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 13:57:08,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 13:57:08,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 13:57:08,035 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 13:57:08,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 13:57:08,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 13:57:08,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 13:57:08,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 13:57:08,037 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 13:57:08,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 13:57:08,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 13:57:08,037 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 13:57:08,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 13:57:08,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 13:57:08,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 13:57:08,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 13:57:08,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 13:57:08,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 13:57:08,038 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 13:57:08,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 13:57:08,038 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 13:57:08,038 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 13:57:08,038 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 13:57:08,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 13:57:08,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 13:57:08,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 13:57:08,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:57:08,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 13:57:08,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 13:57:08,039 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 13:57:08,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 13:57:08,039 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 13:57:08,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 13:57:08,039 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 13:57:08,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 13:57:08,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 13:57:08,040 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 13:57:08,040 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 -> 8d7989c0f7330a23b935c06e29a235b3d1d683ab2aa8325b4804307d493787f2 [2025-03-16 13:57:08,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 13:57:08,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 13:57:08,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 13:57:08,264 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 13:57:08,264 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 13:57:08,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/nsqm-if.c [2025-03-16 13:57:09,407 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fc3fa9f5/c9e81c2d1412482ba4701790be92a396/FLAGf1896fabd [2025-03-16 13:57:09,602 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 13:57:09,603 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/nsqm-if.c [2025-03-16 13:57:09,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fc3fa9f5/c9e81c2d1412482ba4701790be92a396/FLAGf1896fabd [2025-03-16 13:57:09,967 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fc3fa9f5/c9e81c2d1412482ba4701790be92a396 [2025-03-16 13:57:09,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 13:57:09,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 13:57:09,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 13:57:09,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 13:57:09,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 13:57:09,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:57:09" (1/1) ... [2025-03-16 13:57:09,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f666f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:57:09, skipping insertion in model container [2025-03-16 13:57:09,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:57:09" (1/1) ... [2025-03-16 13:57:09,982 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 13:57:10,071 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-fpi/nsqm-if.c[590,603] [2025-03-16 13:57:10,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:57:10,091 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 13:57:10,098 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-fpi/nsqm-if.c[590,603] [2025-03-16 13:57:10,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:57:10,113 INFO L204 MainTranslator]: Completed translation [2025-03-16 13:57:10,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:57:10 WrapperNode [2025-03-16 13:57:10,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 13:57:10,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 13:57:10,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 13:57:10,115 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 13:57:10,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:57:10" (1/1) ... [2025-03-16 13:57:10,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:57:10" (1/1) ... [2025-03-16 13:57:10,132 INFO L138 Inliner]: procedures = 16, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2025-03-16 13:57:10,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 13:57:10,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 13:57:10,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 13:57:10,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 13:57:10,139 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:57:10" (1/1) ... [2025-03-16 13:57:10,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:57:10" (1/1) ... [2025-03-16 13:57:10,141 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:57:10" (1/1) ... [2025-03-16 13:57:10,150 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 4, 4]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2025-03-16 13:57:10,150 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:57:10" (1/1) ... [2025-03-16 13:57:10,150 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:57:10" (1/1) ... [2025-03-16 13:57:10,153 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:57:10" (1/1) ... [2025-03-16 13:57:10,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:57:10" (1/1) ... [2025-03-16 13:57:10,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:57:10" (1/1) ... [2025-03-16 13:57:10,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:57:10" (1/1) ... [2025-03-16 13:57:10,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 13:57:10,156 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 13:57:10,156 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 13:57:10,156 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 13:57:10,156 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:57:10" (1/1) ... [2025-03-16 13:57:10,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:57:10,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:57:10,176 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 13:57:10,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 13:57:10,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 13:57:10,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 13:57:10,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 13:57:10,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 13:57:10,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 13:57:10,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 13:57:10,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 13:57:10,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 13:57:10,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 13:57:10,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 13:57:10,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 13:57:10,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 13:57:10,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 13:57:10,237 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 13:57:10,238 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 13:57:10,384 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-16 13:57:10,385 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 13:57:10,393 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 13:57:10,393 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 13:57:10,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:57:10 BoogieIcfgContainer [2025-03-16 13:57:10,393 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 13:57:10,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 13:57:10,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 13:57:10,398 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 13:57:10,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 01:57:09" (1/3) ... [2025-03-16 13:57:10,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48252245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:57:10, skipping insertion in model container [2025-03-16 13:57:10,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:57:10" (2/3) ... [2025-03-16 13:57:10,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48252245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:57:10, skipping insertion in model container [2025-03-16 13:57:10,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:57:10" (3/3) ... [2025-03-16 13:57:10,400 INFO L128 eAbstractionObserver]: Analyzing ICFG nsqm-if.c [2025-03-16 13:57:10,409 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 13:57:10,410 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nsqm-if.c that has 1 procedures, 18 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-16 13:57:10,443 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 13:57:10,451 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;@53668997, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 13:57:10,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 13:57:10,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:57:10,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-16 13:57:10,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:57:10,456 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:57:10,457 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:57:10,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:57:10,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1737615597, now seen corresponding path program 1 times [2025-03-16 13:57:10,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:57:10,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441017931] [2025-03-16 13:57:10,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:57:10,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:57:10,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-16 13:57:10,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 13:57:10,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:57:10,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:57:10,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:57:10,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:57:10,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441017931] [2025-03-16 13:57:10,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441017931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:57:10,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:57:10,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 13:57:10,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891452704] [2025-03-16 13:57:10,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:57:10,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 13:57:10,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:57:10,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 13:57:10,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 13:57:10,569 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 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) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:57:10,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:57:10,576 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2025-03-16 13:57:10,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 13:57:10,577 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-16 13:57:10,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:57:10,580 INFO L225 Difference]: With dead ends: 33 [2025-03-16 13:57:10,580 INFO L226 Difference]: Without dead ends: 15 [2025-03-16 13:57:10,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 13:57:10,583 INFO L435 NwaCegarLoop]: 23 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, 23 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:57:10,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:57:10,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-16 13:57:10,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-16 13:57:10,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:57:10,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2025-03-16 13:57:10,601 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 9 [2025-03-16 13:57:10,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:57:10,601 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-16 13:57:10,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:57:10,601 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2025-03-16 13:57:10,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-16 13:57:10,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:57:10,603 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:57:10,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 13:57:10,603 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:57:10,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:57:10,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1669848018, now seen corresponding path program 1 times [2025-03-16 13:57:10,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:57:10,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014482828] [2025-03-16 13:57:10,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:57:10,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:57:10,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-16 13:57:10,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 13:57:10,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:57:10,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:57:10,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:57:10,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:57:10,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014482828] [2025-03-16 13:57:10,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014482828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:57:10,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:57:10,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 13:57:10,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411683929] [2025-03-16 13:57:10,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:57:10,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 13:57:10,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:57:10,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 13:57:10,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 13:57:10,706 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:57:10,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:57:10,768 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2025-03-16 13:57:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 13:57:10,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-16 13:57:10,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:57:10,769 INFO L225 Difference]: With dead ends: 37 [2025-03-16 13:57:10,769 INFO L226 Difference]: Without dead ends: 26 [2025-03-16 13:57:10,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 13:57:10,770 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:57:10,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 12 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:57:10,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-16 13:57:10,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2025-03-16 13:57:10,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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-16 13:57:10,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-16 13:57:10,777 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2025-03-16 13:57:10,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:57:10,777 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-16 13:57:10,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:57:10,778 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-03-16 13:57:10,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 13:57:10,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:57:10,778 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:57:10,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 13:57:10,778 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:57:10,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:57:10,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1295083151, now seen corresponding path program 1 times [2025-03-16 13:57:10,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:57:10,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186599126] [2025-03-16 13:57:10,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:57:10,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:57:10,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 13:57:10,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 13:57:10,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:57:10,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 13:57:10,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [972145480] [2025-03-16 13:57:10,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:57:10,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:57:10,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:57:10,827 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:57:10,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 13:57:10,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 13:57:10,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 13:57:10,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:57:10,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:57:10,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 13:57:10,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:57:10,930 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 13 treesize of output 9 [2025-03-16 13:57:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 13:57:10,975 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 13:57:10,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:57:10,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186599126] [2025-03-16 13:57:10,976 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 13:57:10,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972145480] [2025-03-16 13:57:10,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972145480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:57:10,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:57:10,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 13:57:10,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377170647] [2025-03-16 13:57:10,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:57:10,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 13:57:10,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:57:10,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 13:57:10,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:57:10,977 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-16 13:57:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:57:11,043 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-03-16 13:57:11,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 13:57:11,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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) Word has length 15 [2025-03-16 13:57:11,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:57:11,043 INFO L225 Difference]: With dead ends: 32 [2025-03-16 13:57:11,043 INFO L226 Difference]: Without dead ends: 30 [2025-03-16 13:57:11,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 13:57:11,044 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 38 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.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:57:11,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 38 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:57:11,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-16 13:57:11,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2025-03-16 13:57:11,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:57:11,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2025-03-16 13:57:11,048 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 15 [2025-03-16 13:57:11,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:57:11,048 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-03-16 13:57:11,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-16 13:57:11,048 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2025-03-16 13:57:11,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 13:57:11,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:57:11,048 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:57:11,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 13:57:11,253 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-16 13:57:11,253 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:57:11,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:57:11,253 INFO L85 PathProgramCache]: Analyzing trace with hash 131803291, now seen corresponding path program 1 times [2025-03-16 13:57:11,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:57:11,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779040796] [2025-03-16 13:57:11,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:57:11,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:57:11,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 13:57:11,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 13:57:11,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:57:11,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:57:11,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 13:57:11,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:57:11,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779040796] [2025-03-16 13:57:11,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779040796] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:57:11,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083240723] [2025-03-16 13:57:11,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:57:11,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:57:11,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:57:11,398 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:57:11,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 13:57:11,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 13:57:11,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 13:57:11,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:57:11,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:57:11,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 13:57:11,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:57:11,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 13:57:11,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:57:11,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 13:57:11,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083240723] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:57:11,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:57:11,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-16 13:57:11,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225496334] [2025-03-16 13:57:11,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:57:11,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 13:57:11,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:57:11,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 13:57:11,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 13:57:11,559 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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-16 13:57:11,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:57:11,648 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2025-03-16 13:57:11,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 13:57:11,649 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-16 13:57:11,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:57:11,649 INFO L225 Difference]: With dead ends: 57 [2025-03-16 13:57:11,649 INFO L226 Difference]: Without dead ends: 37 [2025-03-16 13:57:11,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-16 13:57:11,650 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 30 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:57:11,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 34 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:57:11,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-16 13:57:11,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 23. [2025-03-16 13:57:11,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:57:11,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-03-16 13:57:11,653 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 18 [2025-03-16 13:57:11,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:57:11,653 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-16 13:57:11,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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-16 13:57:11,654 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-03-16 13:57:11,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 13:57:11,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:57:11,654 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:57:11,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 13:57:11,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-16 13:57:11,855 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:57:11,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:57:11,855 INFO L85 PathProgramCache]: Analyzing trace with hash -902199314, now seen corresponding path program 1 times [2025-03-16 13:57:11,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:57:11,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007212741] [2025-03-16 13:57:11,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:57:11,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:57:11,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 13:57:11,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 13:57:11,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:57:11,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 13:57:11,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1780172778] [2025-03-16 13:57:11,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:57:11,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:57:11,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:57:11,891 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:57:11,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 13:57:11,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 13:57:11,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 13:57:11,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:57:11,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:57:11,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 13:57:11,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:57:11,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-16 13:57:12,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-16 13:57:12,041 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:57:12,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:57:12,290 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 25 treesize of output 23 [2025-03-16 13:57:12,310 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 13:57:12,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:57:12,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007212741] [2025-03-16 13:57:12,311 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 13:57:12,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780172778] [2025-03-16 13:57:12,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780172778] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:57:12,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 13:57:12,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2025-03-16 13:57:12,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711666252] [2025-03-16 13:57:12,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 13:57:12,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 13:57:12,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:57:12,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 13:57:12,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-16 13:57:12,312 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:57:12,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:57:12,542 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2025-03-16 13:57:12,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 13:57:12,543 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 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 21 [2025-03-16 13:57:12,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:57:12,543 INFO L225 Difference]: With dead ends: 93 [2025-03-16 13:57:12,543 INFO L226 Difference]: Without dead ends: 76 [2025-03-16 13:57:12,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-16 13:57:12,544 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 70 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 13:57:12,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 58 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 13:57:12,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-16 13:57:12,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 35. [2025-03-16 13:57:12,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:57:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-03-16 13:57:12,554 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 21 [2025-03-16 13:57:12,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:57:12,555 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-03-16 13:57:12,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:57:12,555 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2025-03-16 13:57:12,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-16 13:57:12,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:57:12,556 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:57:12,562 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-16 13:57:12,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:57:12,760 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:57:12,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:57:12,760 INFO L85 PathProgramCache]: Analyzing trace with hash 486446812, now seen corresponding path program 1 times [2025-03-16 13:57:12,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:57:12,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852106793] [2025-03-16 13:57:12,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:57:12,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:57:12,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 13:57:12,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 13:57:12,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:57:12,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 13:57:12,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [959504126] [2025-03-16 13:57:12,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:57:12,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:57:12,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:57:12,788 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:57:12,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 13:57:12,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 13:57:12,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 13:57:12,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:57:12,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:57:12,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-16 13:57:12,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:57:12,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 13:57:12,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-16 13:57:12,996 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 13 treesize of output 9 [2025-03-16 13:57:13,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-03-16 13:57:13,155 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:57:13,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:57:13,443 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 55 treesize of output 51 [2025-03-16 13:57:13,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:57:13,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 77 [2025-03-16 13:57:13,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-16 13:57:13,981 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 14 treesize of output 5 [2025-03-16 13:57:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:57:14,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:57:14,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852106793] [2025-03-16 13:57:14,024 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 13:57:14,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959504126] [2025-03-16 13:57:14,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959504126] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:57:14,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 13:57:14,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2025-03-16 13:57:14,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519514887] [2025-03-16 13:57:14,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 13:57:14,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-16 13:57:14,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:57:14,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-16 13:57:14,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2025-03-16 13:57:14,026 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 24 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 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-16 13:57:18,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 13:57:22,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 13:57:26,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 13:57:30,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 13:57:34,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 13:57:43,220 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-16 13:57:47,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 13:57:51,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 13:57:56,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 13:58:00,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 13:58:04,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 13:58:08,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 13:58:12,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 13:58:16,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 13:58:20,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 13:58:25,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 13:58:26,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:58:26,908 INFO L93 Difference]: Finished difference Result 202 states and 231 transitions. [2025-03-16 13:58:26,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-16 13:58:26,909 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 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 24 [2025-03-16 13:58:26,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:58:26,910 INFO L225 Difference]: With dead ends: 202 [2025-03-16 13:58:26,910 INFO L226 Difference]: Without dead ends: 200 [2025-03-16 13:58:26,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=687, Invalid=2393, Unknown=0, NotChecked=0, Total=3080 [2025-03-16 13:58:26,912 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 482 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 112 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 61.6s IncrementalHoareTripleChecker+Time [2025-03-16 13:58:26,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 144 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 461 Invalid, 15 Unknown, 0 Unchecked, 61.6s Time] [2025-03-16 13:58:26,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-16 13:58:26,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 87. [2025-03-16 13:58:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.313953488372093) internal successors, (113), 86 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:58:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 113 transitions. [2025-03-16 13:58:26,928 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 113 transitions. Word has length 24 [2025-03-16 13:58:26,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:58:26,929 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 113 transitions. [2025-03-16 13:58:26,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 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-16 13:58:26,930 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2025-03-16 13:58:26,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 13:58:26,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:58:26,930 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:58:26,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 13:58:27,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:58:27,131 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:58:27,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:58:27,131 INFO L85 PathProgramCache]: Analyzing trace with hash 518191406, now seen corresponding path program 2 times [2025-03-16 13:58:27,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:58:27,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089961346] [2025-03-16 13:58:27,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:58:27,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:58:27,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-16 13:58:27,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 13:58:27,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:58:27,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:58:27,328 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 13:58:27,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:58:27,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089961346] [2025-03-16 13:58:27,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089961346] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:58:27,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401293428] [2025-03-16 13:58:27,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:58:27,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:58:27,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:58:27,331 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:58:27,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 13:58:27,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-16 13:58:27,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 13:58:27,378 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:58:27,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:58:27,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 13:58:27,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:58:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 13:58:27,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:58:27,529 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 13:58:27,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401293428] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:58:27,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:58:27,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-16 13:58:27,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817587496] [2025-03-16 13:58:27,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:58:27,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 13:58:27,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:58:27,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 13:58:27,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-16 13:58:27,530 INFO L87 Difference]: Start difference. First operand 87 states and 113 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:58:27,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:58:27,702 INFO L93 Difference]: Finished difference Result 170 states and 208 transitions. [2025-03-16 13:58:27,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 13:58:27,702 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-16 13:58:27,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:58:27,704 INFO L225 Difference]: With dead ends: 170 [2025-03-16 13:58:27,704 INFO L226 Difference]: Without dead ends: 111 [2025-03-16 13:58:27,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-16 13:58:27,704 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 59 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:58:27,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 55 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:58:27,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-16 13:58:27,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 92. [2025-03-16 13:58:27,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 91 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:58:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 114 transitions. [2025-03-16 13:58:27,723 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 114 transitions. Word has length 27 [2025-03-16 13:58:27,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:58:27,723 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 114 transitions. [2025-03-16 13:58:27,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:58:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 114 transitions. [2025-03-16 13:58:27,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 13:58:27,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:58:27,724 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:58:27,731 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-16 13:58:27,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:58:27,925 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:58:27,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:58:27,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1291461938, now seen corresponding path program 3 times [2025-03-16 13:58:27,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:58:27,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784151273] [2025-03-16 13:58:27,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:58:27,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:58:27,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 6 equivalence classes. [2025-03-16 13:58:27,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 27 of 33 statements. [2025-03-16 13:58:27,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-16 13:58:27,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:58:28,180 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 13:58:28,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:58:28,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784151273] [2025-03-16 13:58:28,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784151273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:58:28,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856371207] [2025-03-16 13:58:28,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:58:28,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:58:28,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:58:28,182 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:58:28,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 13:58:28,215 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 6 equivalence classes. [2025-03-16 13:58:28,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 27 of 33 statements. [2025-03-16 13:58:28,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-16 13:58:28,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:58:28,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 13:58:28,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:58:28,434 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 13:58:28,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:58:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 13:58:28,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856371207] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:58:28,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:58:28,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-03-16 13:58:28,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364988917] [2025-03-16 13:58:28,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:58:28,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-16 13:58:28,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:58:28,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-16 13:58:28,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2025-03-16 13:58:28,545 INFO L87 Difference]: Start difference. First operand 92 states and 114 transitions. Second operand has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:58:29,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:58:29,085 INFO L93 Difference]: Finished difference Result 143 states and 165 transitions. [2025-03-16 13:58:29,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 13:58:29,085 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-16 13:58:29,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:58:29,086 INFO L225 Difference]: With dead ends: 143 [2025-03-16 13:58:29,086 INFO L226 Difference]: Without dead ends: 136 [2025-03-16 13:58:29,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=407, Invalid=1233, Unknown=0, NotChecked=0, Total=1640 [2025-03-16 13:58:29,087 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 77 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 13:58:29,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 81 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 13:58:29,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-16 13:58:29,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 97. [2025-03-16 13:58:29,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 96 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:58:29,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2025-03-16 13:58:29,100 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 33 [2025-03-16 13:58:29,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:58:29,100 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2025-03-16 13:58:29,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 13:58:29,100 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2025-03-16 13:58:29,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 13:58:29,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:58:29,101 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:58:29,107 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-16 13:58:29,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:58:29,301 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:58:29,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:58:29,302 INFO L85 PathProgramCache]: Analyzing trace with hash 894642735, now seen corresponding path program 4 times [2025-03-16 13:58:29,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:58:29,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934072096] [2025-03-16 13:58:29,302 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:58:29,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:58:29,318 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-16 13:58:29,349 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 13:58:29,350 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 13:58:29,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 13:58:29,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [789557847] [2025-03-16 13:58:29,351 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:58:29,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:58:29,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:58:29,354 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 13:58:29,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 13:58:29,389 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-16 13:58:29,492 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 13:58:29,492 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 13:58:29,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:58:29,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-16 13:58:29,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:58:29,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 13:58:29,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-16 13:58:29,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:58:29,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-16 13:58:29,682 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 13 treesize of output 9 [2025-03-16 13:58:29,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-03-16 13:58:29,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:58:29,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2025-03-16 13:58:30,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:58:30,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 31 [2025-03-16 13:58:30,103 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:58:30,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:58:30,797 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 101 [2025-03-16 13:58:30,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:58:30,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 564 treesize of output 518 [2025-03-16 13:58:32,356 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:58:32,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:58:32,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934072096] [2025-03-16 13:58:32,357 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 13:58:32,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789557847] [2025-03-16 13:58:32,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789557847] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:58:32,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 13:58:32,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2025-03-16 13:58:32,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136314094] [2025-03-16 13:58:32,357 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 13:58:32,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-16 13:58:32,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:58:32,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-16 13:58:32,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 13:58:32,358 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand has 33 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 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-16 13:58:45,069 WARN L286 SmtUtils]: Spent 12.20s on a formula simplification. DAG size of input: 133 DAG size of output: 58 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)