./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/systemc/token_ring.06.cil-2.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 4d0fbec14d1477738cb6d25ea9b61fc7005f787f2c8a0ac2c555d7e4fa1dbf47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:44:00,183 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:44:00,235 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:44:00,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:44:00,242 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:44:00,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:44:00,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:44:00,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:44:00,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:44:00,261 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:44:00,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:44:00,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:44:00,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:44:00,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:44:00,263 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:44:00,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:44:00,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:44:00,264 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:44:00,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:44:00,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:44:00,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:44:00,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:44:00,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:44:00,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:44:00,264 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:44:00,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:44:00,264 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:44:00,264 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:44:00,265 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:44:00,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:44:00,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:44:00,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:44:00,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:44:00,265 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:44:00,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:44:00,266 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:44:00,266 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:44:00,266 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:44:00,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:44:00,266 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:44:00,266 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:44:00,266 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:44:00,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:44:00,266 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 -> 4d0fbec14d1477738cb6d25ea9b61fc7005f787f2c8a0ac2c555d7e4fa1dbf47 [2025-03-03 14:44:00,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:44:00,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:44:00,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:44:00,515 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:44:00,516 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:44:00,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.06.cil-2.c [2025-03-03 14:44:01,661 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a0c392e1/5c9c9864430d41ca92cb97ed6b280ea6/FLAG67e53242a [2025-03-03 14:44:01,906 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:44:01,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-2.c [2025-03-03 14:44:01,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a0c392e1/5c9c9864430d41ca92cb97ed6b280ea6/FLAG67e53242a [2025-03-03 14:44:01,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a0c392e1/5c9c9864430d41ca92cb97ed6b280ea6 [2025-03-03 14:44:01,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:44:01,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:44:01,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:44:01,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:44:01,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:44:01,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:44:01" (1/1) ... [2025-03-03 14:44:01,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b53348a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:01, skipping insertion in model container [2025-03-03 14:44:01,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:44:01" (1/1) ... [2025-03-03 14:44:01,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:44:02,072 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/systemc/token_ring.06.cil-2.c[671,684] [2025-03-03 14:44:02,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:44:02,157 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:44:02,163 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/systemc/token_ring.06.cil-2.c[671,684] [2025-03-03 14:44:02,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:44:02,212 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:44:02,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:02 WrapperNode [2025-03-03 14:44:02,213 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:44:02,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:44:02,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:44:02,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:44:02,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:02" (1/1) ... [2025-03-03 14:44:02,226 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:02" (1/1) ... [2025-03-03 14:44:02,257 INFO L138 Inliner]: procedures = 40, calls = 49, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 492 [2025-03-03 14:44:02,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:44:02,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:44:02,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:44:02,259 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:44:02,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:02" (1/1) ... [2025-03-03 14:44:02,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:02" (1/1) ... [2025-03-03 14:44:02,272 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:02" (1/1) ... [2025-03-03 14:44:02,292 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 14:44:02,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:02" (1/1) ... [2025-03-03 14:44:02,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:02" (1/1) ... [2025-03-03 14:44:02,304 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:02" (1/1) ... [2025-03-03 14:44:02,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:02" (1/1) ... [2025-03-03 14:44:02,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:02" (1/1) ... [2025-03-03 14:44:02,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:02" (1/1) ... [2025-03-03 14:44:02,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:44:02,316 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:44:02,317 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:44:02,317 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:44:02,318 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:02" (1/1) ... [2025-03-03 14:44:02,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:44:02,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:44:02,342 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-03 14:44:02,347 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-03 14:44:02,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:44:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 14:44:02,363 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 14:44:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 14:44:02,363 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 14:44:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 14:44:02,363 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 14:44:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 14:44:02,363 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 14:44:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 14:44:02,363 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 14:44:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:44:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 14:44:02,363 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 14:44:02,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:44:02,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:44:02,442 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:44:02,444 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:44:02,949 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2025-03-03 14:44:02,949 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:44:02,964 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:44:02,964 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:44:02,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:44:02 BoogieIcfgContainer [2025-03-03 14:44:02,964 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:44:02,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:44:02,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:44:02,969 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:44:02,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:44:01" (1/3) ... [2025-03-03 14:44:02,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b41231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:44:02, skipping insertion in model container [2025-03-03 14:44:02,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:02" (2/3) ... [2025-03-03 14:44:02,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b41231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:44:02, skipping insertion in model container [2025-03-03 14:44:02,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:44:02" (3/3) ... [2025-03-03 14:44:02,972 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.06.cil-2.c [2025-03-03 14:44:02,982 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:44:02,984 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.06.cil-2.c that has 7 procedures, 246 locations, 1 initial locations, 9 loop locations, and 1 error locations. [2025-03-03 14:44:03,026 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:44:03,033 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;@1cc661ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:44:03,034 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:44:03,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 246 states, 218 states have (on average 1.5504587155963303) internal successors, (338), 220 states have internal predecessors, (338), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 14:44:03,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:44:03,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:03,049 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:03,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:03,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:03,053 INFO L85 PathProgramCache]: Analyzing trace with hash 242086566, now seen corresponding path program 1 times [2025-03-03 14:44:03,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:03,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136873959] [2025-03-03 14:44:03,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:03,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:03,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:44:03,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:44:03,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:03,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:03,497 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-03 14:44:03,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:03,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136873959] [2025-03-03 14:44:03,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136873959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:03,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:03,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:44:03,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031913992] [2025-03-03 14:44:03,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:03,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:44:03,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:03,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:44:03,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:44:03,523 INFO L87 Difference]: Start difference. First operand has 246 states, 218 states have (on average 1.5504587155963303) internal successors, (338), 220 states have internal predecessors, (338), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:04,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:04,009 INFO L93 Difference]: Finished difference Result 732 states and 1136 transitions. [2025-03-03 14:44:04,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:44:04,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-03-03 14:44:04,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:04,021 INFO L225 Difference]: With dead ends: 732 [2025-03-03 14:44:04,021 INFO L226 Difference]: Without dead ends: 492 [2025-03-03 14:44:04,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:04,028 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 660 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:04,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1030 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:44:04,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-03-03 14:44:04,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 475. [2025-03-03 14:44:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 426 states have (on average 1.5187793427230047) internal successors, (647), 428 states have internal predecessors, (647), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2025-03-03 14:44:04,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 718 transitions. [2025-03-03 14:44:04,078 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 718 transitions. Word has length 111 [2025-03-03 14:44:04,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:04,078 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 718 transitions. [2025-03-03 14:44:04,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:04,078 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 718 transitions. [2025-03-03 14:44:04,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:44:04,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:04,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:04,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:44:04,082 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:04,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:04,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1265897752, now seen corresponding path program 1 times [2025-03-03 14:44:04,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:04,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583245726] [2025-03-03 14:44:04,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:04,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:04,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:44:04,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:44:04,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:04,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:04,266 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-03 14:44:04,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:04,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583245726] [2025-03-03 14:44:04,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583245726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:04,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:04,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:04,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856948843] [2025-03-03 14:44:04,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:04,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:04,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:04,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:04,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:04,269 INFO L87 Difference]: Start difference. First operand 475 states and 718 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:04,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:04,768 INFO L93 Difference]: Finished difference Result 1228 states and 1876 transitions. [2025-03-03 14:44:04,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:44:04,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-03-03 14:44:04,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:04,775 INFO L225 Difference]: With dead ends: 1228 [2025-03-03 14:44:04,775 INFO L226 Difference]: Without dead ends: 767 [2025-03-03 14:44:04,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:44:04,778 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 654 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1924 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:04,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1924 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:44:04,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2025-03-03 14:44:04,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 694. [2025-03-03 14:44:04,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 623 states have (on average 1.5104333868378812) internal successors, (941), 626 states have internal predecessors, (941), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (54), 51 states have call predecessors, (54), 50 states have call successors, (54) [2025-03-03 14:44:04,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1045 transitions. [2025-03-03 14:44:04,821 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1045 transitions. Word has length 111 [2025-03-03 14:44:04,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:04,822 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 1045 transitions. [2025-03-03 14:44:04,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:04,823 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1045 transitions. [2025-03-03 14:44:04,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:44:04,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:04,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:04,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:44:04,828 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:04,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:04,828 INFO L85 PathProgramCache]: Analyzing trace with hash -2075385209, now seen corresponding path program 1 times [2025-03-03 14:44:04,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:04,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127219675] [2025-03-03 14:44:04,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:04,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:04,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:44:04,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:44:04,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:04,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:04,994 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-03 14:44:04,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:04,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127219675] [2025-03-03 14:44:04,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127219675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:04,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:04,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:04,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134291215] [2025-03-03 14:44:04,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:04,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:04,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:04,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:04,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:04,996 INFO L87 Difference]: Start difference. First operand 694 states and 1045 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:05,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:05,463 INFO L93 Difference]: Finished difference Result 1919 states and 2924 transitions. [2025-03-03 14:44:05,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:44:05,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-03-03 14:44:05,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:05,471 INFO L225 Difference]: With dead ends: 1919 [2025-03-03 14:44:05,471 INFO L226 Difference]: Without dead ends: 1239 [2025-03-03 14:44:05,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:44:05,474 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 649 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:05,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 1908 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:44:05,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2025-03-03 14:44:05,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1157. [2025-03-03 14:44:05,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1040 states have (on average 1.5115384615384615) internal successors, (1572), 1047 states have internal predecessors, (1572), 80 states have call successors, (80), 30 states have call predecessors, (80), 36 states have return successors, (96), 83 states have call predecessors, (96), 80 states have call successors, (96) [2025-03-03 14:44:05,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1748 transitions. [2025-03-03 14:44:05,540 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1748 transitions. Word has length 111 [2025-03-03 14:44:05,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:05,540 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1748 transitions. [2025-03-03 14:44:05,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:05,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1748 transitions. [2025-03-03 14:44:05,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:44:05,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:05,544 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:05,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:44:05,544 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:05,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:05,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1777827592, now seen corresponding path program 1 times [2025-03-03 14:44:05,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:05,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201281422] [2025-03-03 14:44:05,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:05,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:05,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:44:05,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:44:05,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:05,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:05,687 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-03 14:44:05,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:05,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201281422] [2025-03-03 14:44:05,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201281422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:05,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:05,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:05,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039528367] [2025-03-03 14:44:05,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:05,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:05,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:05,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:05,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:05,689 INFO L87 Difference]: Start difference. First operand 1157 states and 1748 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:06,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:06,219 INFO L93 Difference]: Finished difference Result 3396 states and 5213 transitions. [2025-03-03 14:44:06,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:44:06,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-03-03 14:44:06,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:06,231 INFO L225 Difference]: With dead ends: 3396 [2025-03-03 14:44:06,231 INFO L226 Difference]: Without dead ends: 2253 [2025-03-03 14:44:06,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:44:06,236 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 644 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1896 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:06,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1896 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:44:06,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2025-03-03 14:44:06,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 2152. [2025-03-03 14:44:06,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2152 states, 1937 states have (on average 1.5240061951471346) internal successors, (2952), 1958 states have internal predecessors, (2952), 140 states have call successors, (140), 54 states have call predecessors, (140), 74 states have return successors, (204), 147 states have call predecessors, (204), 140 states have call successors, (204) [2025-03-03 14:44:06,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 3296 transitions. [2025-03-03 14:44:06,361 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 3296 transitions. Word has length 111 [2025-03-03 14:44:06,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:06,362 INFO L471 AbstractCegarLoop]: Abstraction has 2152 states and 3296 transitions. [2025-03-03 14:44:06,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:06,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 3296 transitions. [2025-03-03 14:44:06,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:44:06,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:06,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:06,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:44:06,364 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:06,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:06,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1763577447, now seen corresponding path program 1 times [2025-03-03 14:44:06,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:06,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375066888] [2025-03-03 14:44:06,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:06,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:06,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:44:06,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:44:06,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:06,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:06,465 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-03 14:44:06,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:06,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375066888] [2025-03-03 14:44:06,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375066888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:06,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:06,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:06,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788956700] [2025-03-03 14:44:06,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:06,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:06,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:06,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:06,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:06,467 INFO L87 Difference]: Start difference. First operand 2152 states and 3296 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:06,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:06,996 INFO L93 Difference]: Finished difference Result 6607 states and 10347 transitions. [2025-03-03 14:44:06,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:44:06,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-03-03 14:44:06,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:07,040 INFO L225 Difference]: With dead ends: 6607 [2025-03-03 14:44:07,041 INFO L226 Difference]: Without dead ends: 4469 [2025-03-03 14:44:07,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:44:07,045 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 639 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:07,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1884 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:44:07,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4469 states. [2025-03-03 14:44:07,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4469 to 4331. [2025-03-03 14:44:07,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4331 states, 3902 states have (on average 1.5458739108149666) internal successors, (6032), 3969 states have internal predecessors, (6032), 260 states have call successors, (260), 102 states have call predecessors, (260), 168 states have return successors, (516), 275 states have call predecessors, (516), 260 states have call successors, (516) [2025-03-03 14:44:07,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4331 states to 4331 states and 6808 transitions. [2025-03-03 14:44:07,217 INFO L78 Accepts]: Start accepts. Automaton has 4331 states and 6808 transitions. Word has length 111 [2025-03-03 14:44:07,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:07,218 INFO L471 AbstractCegarLoop]: Abstraction has 4331 states and 6808 transitions. [2025-03-03 14:44:07,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:07,218 INFO L276 IsEmpty]: Start isEmpty. Operand 4331 states and 6808 transitions. [2025-03-03 14:44:07,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:44:07,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:07,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:07,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:44:07,225 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:07,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:07,227 INFO L85 PathProgramCache]: Analyzing trace with hash 793286440, now seen corresponding path program 1 times [2025-03-03 14:44:07,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:07,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342091789] [2025-03-03 14:44:07,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:07,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:07,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:44:07,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:44:07,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:07,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:07,334 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-03 14:44:07,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:07,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342091789] [2025-03-03 14:44:07,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342091789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:07,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:07,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:07,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693837010] [2025-03-03 14:44:07,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:07,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:07,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:07,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:07,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:07,336 INFO L87 Difference]: Start difference. First operand 4331 states and 6808 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:07,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:07,960 INFO L93 Difference]: Finished difference Result 13726 states and 22261 transitions. [2025-03-03 14:44:07,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:44:07,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-03-03 14:44:07,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:08,004 INFO L225 Difference]: With dead ends: 13726 [2025-03-03 14:44:08,004 INFO L226 Difference]: Without dead ends: 9409 [2025-03-03 14:44:08,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:44:08,020 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 660 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:08,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1305 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:44:08,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9409 states. [2025-03-03 14:44:08,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9409 to 9202. [2025-03-03 14:44:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9202 states, 8291 states have (on average 1.5737546737426125) internal successors, (13048), 8504 states have internal predecessors, (13048), 500 states have call successors, (500), 198 states have call predecessors, (500), 410 states have return successors, (1524), 531 states have call predecessors, (1524), 500 states have call successors, (1524) [2025-03-03 14:44:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9202 states to 9202 states and 15072 transitions. [2025-03-03 14:44:08,395 INFO L78 Accepts]: Start accepts. Automaton has 9202 states and 15072 transitions. Word has length 111 [2025-03-03 14:44:08,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:08,395 INFO L471 AbstractCegarLoop]: Abstraction has 9202 states and 15072 transitions. [2025-03-03 14:44:08,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:08,395 INFO L276 IsEmpty]: Start isEmpty. Operand 9202 states and 15072 transitions. [2025-03-03 14:44:08,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:44:08,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:08,401 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:08,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:44:08,401 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:08,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:08,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1731818055, now seen corresponding path program 1 times [2025-03-03 14:44:08,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:08,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525784441] [2025-03-03 14:44:08,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:08,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:08,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:44:08,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:44:08,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:08,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:08,492 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-03 14:44:08,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:08,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525784441] [2025-03-03 14:44:08,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525784441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:08,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:08,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:08,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511853536] [2025-03-03 14:44:08,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:08,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:08,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:08,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:08,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:08,494 INFO L87 Difference]: Start difference. First operand 9202 states and 15072 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:09,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:09,415 INFO L93 Difference]: Finished difference Result 31067 states and 52808 transitions. [2025-03-03 14:44:09,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:44:09,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-03-03 14:44:09,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:09,545 INFO L225 Difference]: With dead ends: 31067 [2025-03-03 14:44:09,545 INFO L226 Difference]: Without dead ends: 21879 [2025-03-03 14:44:09,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:44:09,583 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 820 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 1833 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:09,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 1833 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:44:09,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21879 states. [2025-03-03 14:44:10,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21879 to 19982. [2025-03-03 14:44:10,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19982 states, 17977 states have (on average 1.6010457807198086) internal successors, (28782), 18644 states have internal predecessors, (28782), 948 states have call successors, (948), 390 states have call predecessors, (948), 1056 states have return successors, (5044), 1011 states have call predecessors, (5044), 948 states have call successors, (5044) [2025-03-03 14:44:10,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19982 states to 19982 states and 34774 transitions. [2025-03-03 14:44:10,650 INFO L78 Accepts]: Start accepts. Automaton has 19982 states and 34774 transitions. Word has length 111 [2025-03-03 14:44:10,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:10,650 INFO L471 AbstractCegarLoop]: Abstraction has 19982 states and 34774 transitions. [2025-03-03 14:44:10,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:10,650 INFO L276 IsEmpty]: Start isEmpty. Operand 19982 states and 34774 transitions. [2025-03-03 14:44:10,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:44:10,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:10,661 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:10,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:44:10,661 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:10,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:10,661 INFO L85 PathProgramCache]: Analyzing trace with hash -913012442, now seen corresponding path program 1 times [2025-03-03 14:44:10,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:10,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644865783] [2025-03-03 14:44:10,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:10,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:10,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:44:10,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:44:10,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:10,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:10,759 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-03 14:44:10,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:10,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644865783] [2025-03-03 14:44:10,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644865783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:10,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:10,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:44:10,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214725142] [2025-03-03 14:44:10,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:10,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:44:10,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:10,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:44:10,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:44:10,766 INFO L87 Difference]: Start difference. First operand 19982 states and 34774 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:11,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:11,652 INFO L93 Difference]: Finished difference Result 45067 states and 81794 transitions. [2025-03-03 14:44:11,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:44:11,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-03-03 14:44:11,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:11,790 INFO L225 Difference]: With dead ends: 45067 [2025-03-03 14:44:11,790 INFO L226 Difference]: Without dead ends: 25099 [2025-03-03 14:44:11,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:11,860 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 465 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:11,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 680 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:44:11,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25099 states. [2025-03-03 14:44:13,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25099 to 19982. [2025-03-03 14:44:13,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19982 states, 17977 states have (on average 1.5974300495077043) internal successors, (28717), 18644 states have internal predecessors, (28717), 948 states have call successors, (948), 390 states have call predecessors, (948), 1056 states have return successors, (5044), 1011 states have call predecessors, (5044), 948 states have call successors, (5044) [2025-03-03 14:44:13,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19982 states to 19982 states and 34709 transitions. [2025-03-03 14:44:13,497 INFO L78 Accepts]: Start accepts. Automaton has 19982 states and 34709 transitions. Word has length 111 [2025-03-03 14:44:13,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:13,498 INFO L471 AbstractCegarLoop]: Abstraction has 19982 states and 34709 transitions. [2025-03-03 14:44:13,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:13,498 INFO L276 IsEmpty]: Start isEmpty. Operand 19982 states and 34709 transitions. [2025-03-03 14:44:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:44:13,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:13,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:13,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:44:13,511 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:13,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:13,511 INFO L85 PathProgramCache]: Analyzing trace with hash 941333095, now seen corresponding path program 1 times [2025-03-03 14:44:13,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:13,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594020974] [2025-03-03 14:44:13,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:13,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:13,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:44:13,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:44:13,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:13,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:13,616 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-03 14:44:13,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:13,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594020974] [2025-03-03 14:44:13,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594020974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:13,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:13,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:13,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456435919] [2025-03-03 14:44:13,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:13,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:13,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:13,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:13,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:13,619 INFO L87 Difference]: Start difference. First operand 19982 states and 34709 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:14,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:14,971 INFO L93 Difference]: Finished difference Result 66567 states and 122437 transitions. [2025-03-03 14:44:14,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:44:14,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-03-03 14:44:14,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:15,162 INFO L225 Difference]: With dead ends: 66567 [2025-03-03 14:44:15,162 INFO L226 Difference]: Without dead ends: 46599 [2025-03-03 14:44:15,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:44:15,218 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 747 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:15,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 1802 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:44:15,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46599 states. [2025-03-03 14:44:17,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46599 to 43876. [2025-03-03 14:44:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43876 states, 39229 states have (on average 1.6168395829615845) internal successors, (63427), 41290 states have internal predecessors, (63427), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-03-03 14:44:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43876 states to 43876 states and 83435 transitions. [2025-03-03 14:44:17,820 INFO L78 Accepts]: Start accepts. Automaton has 43876 states and 83435 transitions. Word has length 111 [2025-03-03 14:44:17,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:17,822 INFO L471 AbstractCegarLoop]: Abstraction has 43876 states and 83435 transitions. [2025-03-03 14:44:17,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:17,822 INFO L276 IsEmpty]: Start isEmpty. Operand 43876 states and 83435 transitions. [2025-03-03 14:44:17,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:44:17,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:17,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:17,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:44:17,840 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:17,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:17,841 INFO L85 PathProgramCache]: Analyzing trace with hash 2109529350, now seen corresponding path program 1 times [2025-03-03 14:44:17,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:17,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913281137] [2025-03-03 14:44:17,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:17,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:17,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:44:17,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:44:17,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:17,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:17,917 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-03 14:44:17,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:17,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913281137] [2025-03-03 14:44:17,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913281137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:17,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:17,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:44:17,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387462931] [2025-03-03 14:44:17,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:17,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:44:17,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:17,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:44:17,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:44:17,919 INFO L87 Difference]: Start difference. First operand 43876 states and 83435 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:19,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:19,681 INFO L93 Difference]: Finished difference Result 98683 states and 198814 transitions. [2025-03-03 14:44:19,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:44:19,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-03-03 14:44:19,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:19,928 INFO L225 Difference]: With dead ends: 98683 [2025-03-03 14:44:19,928 INFO L226 Difference]: Without dead ends: 54821 [2025-03-03 14:44:20,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:20,041 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 461 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:20,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 666 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:44:20,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54821 states. [2025-03-03 14:44:22,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54821 to 43876. [2025-03-03 14:44:22,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43876 states, 39229 states have (on average 1.6135511993678147) internal successors, (63298), 41290 states have internal predecessors, (63298), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-03-03 14:44:23,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43876 states to 43876 states and 83306 transitions. [2025-03-03 14:44:23,265 INFO L78 Accepts]: Start accepts. Automaton has 43876 states and 83306 transitions. Word has length 111 [2025-03-03 14:44:23,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:23,266 INFO L471 AbstractCegarLoop]: Abstraction has 43876 states and 83306 transitions. [2025-03-03 14:44:23,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:23,266 INFO L276 IsEmpty]: Start isEmpty. Operand 43876 states and 83306 transitions. [2025-03-03 14:44:23,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:44:23,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:23,285 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:23,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:44:23,286 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:23,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:23,286 INFO L85 PathProgramCache]: Analyzing trace with hash 900287111, now seen corresponding path program 1 times [2025-03-03 14:44:23,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:23,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009071002] [2025-03-03 14:44:23,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:23,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:23,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:44:23,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:44:23,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:23,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:23,391 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-03 14:44:23,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:23,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009071002] [2025-03-03 14:44:23,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009071002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:23,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:23,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:23,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858543104] [2025-03-03 14:44:23,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:23,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:23,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:23,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:23,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:23,393 INFO L87 Difference]: Start difference. First operand 43876 states and 83306 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:27,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:27,185 INFO L93 Difference]: Finished difference Result 143065 states and 297966 transitions. [2025-03-03 14:44:27,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:44:27,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2025-03-03 14:44:27,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:27,739 INFO L225 Difference]: With dead ends: 143065 [2025-03-03 14:44:27,739 INFO L226 Difference]: Without dead ends: 99203 [2025-03-03 14:44:27,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:44:27,908 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 674 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:27,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 1771 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:44:27,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99203 states.