./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-8fc3dc6-m [2025-03-16 19:02:43,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:02:43,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:02:43,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:02:43,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:02:43,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:02:43,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:02:43,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:02:43,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:02:43,243 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:02:43,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:02:43,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:02:43,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:02:43,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:02:43,244 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:02:43,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:02:43,245 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:02:43,245 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:02:43,245 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:02:43,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:02:43,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:02:43,245 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:02:43,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:02:43,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:02:43,246 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:02:43,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:02:43,246 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:02:43,246 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:02:43,246 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:02:43,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:02:43,246 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:02:43,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:02:43,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:02:43,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:02:43,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:02:43,247 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:02:43,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:02:43,247 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:02:43,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:02:43,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:02:43,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:02:43,247 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:02:43,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:02:43,247 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-16 19:02:43,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:02:43,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:02:43,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:02:43,462 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:02:43,462 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:02:43,465 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-16 19:02:44,661 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2006d2fa3/98fe09939cd644f185aa2ae8383f4674/FLAGc8f83cd3d [2025-03-16 19:02:44,932 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:02:44,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-2.c [2025-03-16 19:02:44,941 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2006d2fa3/98fe09939cd644f185aa2ae8383f4674/FLAGc8f83cd3d [2025-03-16 19:02:45,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2006d2fa3/98fe09939cd644f185aa2ae8383f4674 [2025-03-16 19:02:45,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:02:45,248 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:02:45,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:02:45,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:02:45,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:02:45,254 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:02:45" (1/1) ... [2025-03-16 19:02:45,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@133c9408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:02:45, skipping insertion in model container [2025-03-16 19:02:45,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:02:45" (1/1) ... [2025-03-16 19:02:45,287 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:02:45,393 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-16 19:02:45,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:02:45,465 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:02:45,472 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-16 19:02:45,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:02:45,510 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:02:45,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:02:45 WrapperNode [2025-03-16 19:02:45,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:02:45,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:02:45,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:02:45,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:02:45,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:02:45" (1/1) ... [2025-03-16 19:02:45,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:02:45" (1/1) ... [2025-03-16 19:02:45,544 INFO L138 Inliner]: procedures = 40, calls = 49, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 492 [2025-03-16 19:02:45,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:02:45,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:02:45,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:02:45,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:02:45,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:02:45" (1/1) ... [2025-03-16 19:02:45,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:02:45" (1/1) ... [2025-03-16 19:02:45,558 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:02:45" (1/1) ... [2025-03-16 19:02:45,570 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-16 19:02:45,570 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:02:45" (1/1) ... [2025-03-16 19:02:45,571 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:02:45" (1/1) ... [2025-03-16 19:02:45,576 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:02:45" (1/1) ... [2025-03-16 19:02:45,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:02:45" (1/1) ... [2025-03-16 19:02:45,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:02:45" (1/1) ... [2025-03-16 19:02:45,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:02:45" (1/1) ... [2025-03-16 19:02:45,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:02:45,581 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:02:45,581 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:02:45,581 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:02:45,581 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:02:45" (1/1) ... [2025-03-16 19:02:45,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:02:45,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:02:45,612 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:02:45,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:02:45,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:02:45,634 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 19:02:45,634 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 19:02:45,634 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 19:02:45,634 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 19:02:45,634 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 19:02:45,634 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 19:02:45,634 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 19:02:45,635 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 19:02:45,635 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 19:02:45,635 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 19:02:45,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:02:45,635 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 19:02:45,635 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 19:02:45,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:02:45,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:02:45,705 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:02:45,708 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:02:46,196 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-03-16 19:02:46,201 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:02:46,215 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:02:46,216 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:02:46,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:02:46 BoogieIcfgContainer [2025-03-16 19:02:46,216 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:02:46,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:02:46,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:02:46,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:02:46,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:02:45" (1/3) ... [2025-03-16 19:02:46,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42277d55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:02:46, skipping insertion in model container [2025-03-16 19:02:46,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:02:45" (2/3) ... [2025-03-16 19:02:46,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42277d55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:02:46, skipping insertion in model container [2025-03-16 19:02:46,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:02:46" (3/3) ... [2025-03-16 19:02:46,225 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.06.cil-2.c [2025-03-16 19:02:46,237 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:02:46,239 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.06.cil-2.c that has 7 procedures, 217 locations, 1 initial locations, 9 loop locations, and 1 error locations. [2025-03-16 19:02:46,282 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:02:46,291 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;@2b46bf12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:02:46,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:02:46,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 217 states, 190 states have (on average 1.6263157894736842) internal successors, (309), 191 states have internal predecessors, (309), 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-16 19:02:46,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:02:46,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:02:46,303 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] [2025-03-16 19:02:46,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:02:46,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:02:46,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1744595790, now seen corresponding path program 1 times [2025-03-16 19:02:46,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:02:46,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431028365] [2025-03-16 19:02:46,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:02:46,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:02:46,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:02:46,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:02:46,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:02:46,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:02:46,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:02:46,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:02:46,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431028365] [2025-03-16 19:02:46,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431028365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:02:46,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:02:46,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:02:46,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361050672] [2025-03-16 19:02:46,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:02:46,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:02:46,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:02:46,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:02:46,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:02:46,734 INFO L87 Difference]: Start difference. First operand has 217 states, 190 states have (on average 1.6263157894736842) internal successors, (309), 191 states have internal predecessors, (309), 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 18.0) internal successors, (90), 4 states have internal predecessors, (90), 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-16 19:02:47,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:02:47,173 INFO L93 Difference]: Finished difference Result 652 states and 1056 transitions. [2025-03-16 19:02:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:02:47,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 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 100 [2025-03-16 19:02:47,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:02:47,188 INFO L225 Difference]: With dead ends: 652 [2025-03-16 19:02:47,189 INFO L226 Difference]: Without dead ends: 441 [2025-03-16 19:02:47,192 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-16 19:02:47,193 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 621 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:02:47,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 942 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:02:47,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-16 19:02:47,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 424. [2025-03-16 19:02:47,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 375 states have (on average 1.5893333333333333) internal successors, (596), 377 states have internal predecessors, (596), 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-16 19:02:47,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 667 transitions. [2025-03-16 19:02:47,275 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 667 transitions. Word has length 100 [2025-03-16 19:02:47,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:02:47,276 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 667 transitions. [2025-03-16 19:02:47,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 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-16 19:02:47,277 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 667 transitions. [2025-03-16 19:02:47,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:02:47,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:02:47,281 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] [2025-03-16 19:02:47,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:02:47,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:02:47,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:02:47,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1031375314, now seen corresponding path program 1 times [2025-03-16 19:02:47,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:02:47,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370379424] [2025-03-16 19:02:47,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:02:47,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:02:47,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:02:47,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:02:47,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:02:47,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:02:47,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:02:47,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:02:47,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370379424] [2025-03-16 19:02:47,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370379424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:02:47,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:02:47,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:02:47,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427560173] [2025-03-16 19:02:47,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:02:47,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:02:47,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:02:47,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:02:47,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:02:47,523 INFO L87 Difference]: Start difference. First operand 424 states and 667 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:02:48,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:02:48,017 INFO L93 Difference]: Finished difference Result 1104 states and 1752 transitions. [2025-03-16 19:02:48,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:02:48,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2025-03-16 19:02:48,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:02:48,021 INFO L225 Difference]: With dead ends: 1104 [2025-03-16 19:02:48,022 INFO L226 Difference]: Without dead ends: 692 [2025-03-16 19:02:48,023 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-16 19:02:48,024 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 616 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:02:48,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 1758 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:02:48,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2025-03-16 19:02:48,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 619. [2025-03-16 19:02:48,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 548 states have (on average 1.5802919708029197) internal successors, (866), 551 states have internal predecessors, (866), 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-16 19:02:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 970 transitions. [2025-03-16 19:02:48,054 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 970 transitions. Word has length 100 [2025-03-16 19:02:48,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:02:48,055 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 970 transitions. [2025-03-16 19:02:48,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:02:48,055 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 970 transitions. [2025-03-16 19:02:48,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:02:48,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:02:48,056 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] [2025-03-16 19:02:48,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:02:48,057 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:02:48,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:02:48,057 INFO L85 PathProgramCache]: Analyzing trace with hash 2054349743, now seen corresponding path program 1 times [2025-03-16 19:02:48,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:02:48,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633776646] [2025-03-16 19:02:48,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:02:48,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:02:48,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:02:48,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:02:48,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:02:48,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:02:48,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:02:48,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:02:48,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633776646] [2025-03-16 19:02:48,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633776646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:02:48,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:02:48,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:02:48,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962646879] [2025-03-16 19:02:48,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:02:48,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:02:48,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:02:48,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:02:48,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:02:48,187 INFO L87 Difference]: Start difference. First operand 619 states and 970 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:02:48,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:02:48,704 INFO L93 Difference]: Finished difference Result 1723 states and 2728 transitions. [2025-03-16 19:02:48,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:02:48,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2025-03-16 19:02:48,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:02:48,712 INFO L225 Difference]: With dead ends: 1723 [2025-03-16 19:02:48,713 INFO L226 Difference]: Without dead ends: 1116 [2025-03-16 19:02:48,714 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-16 19:02:48,716 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 611 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:02:48,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 1742 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:02:48,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2025-03-16 19:02:48,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1034. [2025-03-16 19:02:48,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 917 states have (on average 1.5801526717557253) internal successors, (1449), 924 states have internal predecessors, (1449), 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-16 19:02:48,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1625 transitions. [2025-03-16 19:02:48,777 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1625 transitions. Word has length 100 [2025-03-16 19:02:48,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:02:48,777 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1625 transitions. [2025-03-16 19:02:48,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:02:48,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1625 transitions. [2025-03-16 19:02:48,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:02:48,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:02:48,799 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] [2025-03-16 19:02:48,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:02:48,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:02:48,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:02:48,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1032699378, now seen corresponding path program 1 times [2025-03-16 19:02:48,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:02:48,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830229441] [2025-03-16 19:02:48,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:02:48,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:02:48,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:02:48,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:02:48,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:02:48,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:02:48,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:02:48,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:02:48,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830229441] [2025-03-16 19:02:48,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830229441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:02:48,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:02:48,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:02:48,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243046847] [2025-03-16 19:02:48,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:02:48,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:02:48,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:02:48,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:02:48,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:02:48,950 INFO L87 Difference]: Start difference. First operand 1034 states and 1625 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:02:49,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:02:49,453 INFO L93 Difference]: Finished difference Result 3056 states and 4873 transitions. [2025-03-16 19:02:49,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:02:49,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2025-03-16 19:02:49,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:02:49,468 INFO L225 Difference]: With dead ends: 3056 [2025-03-16 19:02:49,468 INFO L226 Difference]: Without dead ends: 2034 [2025-03-16 19:02:49,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-16 19:02:49,477 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 606 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:02:49,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 1730 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:02:49,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2025-03-16 19:02:49,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 1933. [2025-03-16 19:02:49,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1933 states, 1718 states have (on average 1.590803259604191) internal successors, (2733), 1739 states have internal predecessors, (2733), 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-16 19:02:49,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 3077 transitions. [2025-03-16 19:02:49,601 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 3077 transitions. Word has length 100 [2025-03-16 19:02:49,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:02:49,601 INFO L471 AbstractCegarLoop]: Abstraction has 1933 states and 3077 transitions. [2025-03-16 19:02:49,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:02:49,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 3077 transitions. [2025-03-16 19:02:49,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:02:49,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:02:49,603 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] [2025-03-16 19:02:49,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:02:49,604 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:02:49,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:02:49,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1777212367, now seen corresponding path program 1 times [2025-03-16 19:02:49,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:02:49,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671774245] [2025-03-16 19:02:49,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:02:49,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:02:49,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:02:49,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:02:49,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:02:49,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:02:49,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:02:49,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:02:49,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671774245] [2025-03-16 19:02:49,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671774245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:02:49,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:02:49,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:02:49,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645675842] [2025-03-16 19:02:49,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:02:49,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:02:49,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:02:49,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:02:49,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:02:49,739 INFO L87 Difference]: Start difference. First operand 1933 states and 3077 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:02:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:02:50,233 INFO L93 Difference]: Finished difference Result 5979 states and 9719 transitions. [2025-03-16 19:02:50,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:02:50,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2025-03-16 19:02:50,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:02:50,252 INFO L225 Difference]: With dead ends: 5979 [2025-03-16 19:02:50,253 INFO L226 Difference]: Without dead ends: 4058 [2025-03-16 19:02:50,259 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-16 19:02:50,261 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 601 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1718 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:02:50,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1718 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:02:50,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4058 states. [2025-03-16 19:02:50,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4058 to 3920. [2025-03-16 19:02:50,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3920 states, 3491 states have (on average 1.6101403609281009) internal successors, (5621), 3558 states have internal predecessors, (5621), 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-16 19:02:50,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 6397 transitions. [2025-03-16 19:02:50,505 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 6397 transitions. Word has length 100 [2025-03-16 19:02:50,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:02:50,505 INFO L471 AbstractCegarLoop]: Abstraction has 3920 states and 6397 transitions. [2025-03-16 19:02:50,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:02:50,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 6397 transitions. [2025-03-16 19:02:50,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:02:50,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:02:50,509 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] [2025-03-16 19:02:50,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:02:50,509 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:02:50,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:02:50,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1734375954, now seen corresponding path program 1 times [2025-03-16 19:02:50,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:02:50,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881508224] [2025-03-16 19:02:50,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:02:50,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:02:50,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:02:50,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:02:50,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:02:50,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:02:50,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:02:50,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:02:50,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881508224] [2025-03-16 19:02:50,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881508224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:02:50,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:02:50,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:02:50,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49098495] [2025-03-16 19:02:50,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:02:50,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:02:50,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:02:50,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:02:50,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:02:50,612 INFO L87 Difference]: Start difference. First operand 3920 states and 6397 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:02:51,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:02:51,209 INFO L93 Difference]: Finished difference Result 12522 states and 21057 transitions. [2025-03-16 19:02:51,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:02:51,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2025-03-16 19:02:51,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:02:51,252 INFO L225 Difference]: With dead ends: 12522 [2025-03-16 19:02:51,253 INFO L226 Difference]: Without dead ends: 8614 [2025-03-16 19:02:51,266 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-16 19:02:51,268 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 596 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:02:51,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1706 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:02:51,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8614 states. [2025-03-16 19:02:51,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8614 to 8407. [2025-03-16 19:02:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8407 states, 7496 states have (on average 1.6346051227321239) internal successors, (12253), 7709 states have internal predecessors, (12253), 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-16 19:02:51,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8407 states to 8407 states and 14277 transitions. [2025-03-16 19:02:51,655 INFO L78 Accepts]: Start accepts. Automaton has 8407 states and 14277 transitions. Word has length 100 [2025-03-16 19:02:51,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:02:51,656 INFO L471 AbstractCegarLoop]: Abstraction has 8407 states and 14277 transitions. [2025-03-16 19:02:51,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:02:51,656 INFO L276 IsEmpty]: Start isEmpty. Operand 8407 states and 14277 transitions. [2025-03-16 19:02:51,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:02:51,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:02:51,662 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] [2025-03-16 19:02:51,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:02:51,662 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:02:51,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:02:51,663 INFO L85 PathProgramCache]: Analyzing trace with hash 2031672303, now seen corresponding path program 1 times [2025-03-16 19:02:51,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:02:51,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258929133] [2025-03-16 19:02:51,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:02:51,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:02:51,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:02:51,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:02:51,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:02:51,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:02:51,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:02:51,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:02:51,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258929133] [2025-03-16 19:02:51,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258929133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:02:51,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:02:51,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:02:51,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289133970] [2025-03-16 19:02:51,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:02:51,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:02:51,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:02:51,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:02:51,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:02:51,746 INFO L87 Difference]: Start difference. First operand 8407 states and 14277 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:02:52,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:02:52,530 INFO L93 Difference]: Finished difference Result 27485 states and 48735 transitions. [2025-03-16 19:02:52,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:02:52,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2025-03-16 19:02:52,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:02:52,636 INFO L225 Difference]: With dead ends: 27485 [2025-03-16 19:02:52,636 INFO L226 Difference]: Without dead ends: 19090 [2025-03-16 19:02:52,667 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-16 19:02:52,668 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 619 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:02:52,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 1195 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:02:52,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19090 states. [2025-03-16 19:02:53,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19090 to 18758. [2025-03-16 19:02:53,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18758 states, 16721 states have (on average 1.6607260331319897) internal successors, (27769), 17388 states have internal predecessors, (27769), 980 states have call successors, (980), 390 states have call predecessors, (980), 1056 states have return successors, (5076), 1043 states have call predecessors, (5076), 980 states have call successors, (5076) [2025-03-16 19:02:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18758 states to 18758 states and 33825 transitions. [2025-03-16 19:02:53,596 INFO L78 Accepts]: Start accepts. Automaton has 18758 states and 33825 transitions. Word has length 100 [2025-03-16 19:02:53,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:02:53,596 INFO L471 AbstractCegarLoop]: Abstraction has 18758 states and 33825 transitions. [2025-03-16 19:02:53,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:02:53,597 INFO L276 IsEmpty]: Start isEmpty. Operand 18758 states and 33825 transitions. [2025-03-16 19:02:53,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:02:53,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:02:53,607 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] [2025-03-16 19:02:53,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:02:53,608 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:02:53,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:02:53,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1460421070, now seen corresponding path program 1 times [2025-03-16 19:02:53,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:02:53,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903355449] [2025-03-16 19:02:53,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:02:53,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:02:53,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:02:53,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:02:53,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:02:53,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:02:53,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-16 19:02:53,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:02:53,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903355449] [2025-03-16 19:02:53,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903355449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:02:53,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:02:53,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:02:53,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197643334] [2025-03-16 19:02:53,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:02:53,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:02:53,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:02:53,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:02:53,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:02:53,689 INFO L87 Difference]: Start difference. First operand 18758 states and 33825 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:02:54,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:02:54,570 INFO L93 Difference]: Finished difference Result 42621 states and 79898 transitions. [2025-03-16 19:02:54,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:02:54,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2025-03-16 19:02:54,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:02:54,695 INFO L225 Difference]: With dead ends: 42621 [2025-03-16 19:02:54,695 INFO L226 Difference]: Without dead ends: 23875 [2025-03-16 19:02:54,750 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-16 19:02:54,752 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 433 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:02:54,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 620 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:02:54,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23875 states. [2025-03-16 19:02:55,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23875 to 18758. [2025-03-16 19:02:55,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18758 states, 16721 states have (on average 1.65683870581903) internal successors, (27704), 17388 states have internal predecessors, (27704), 980 states have call successors, (980), 390 states have call predecessors, (980), 1056 states have return successors, (5076), 1043 states have call predecessors, (5076), 980 states have call successors, (5076) [2025-03-16 19:02:55,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18758 states to 18758 states and 33760 transitions. [2025-03-16 19:02:55,904 INFO L78 Accepts]: Start accepts. Automaton has 18758 states and 33760 transitions. Word has length 100 [2025-03-16 19:02:55,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:02:55,905 INFO L471 AbstractCegarLoop]: Abstraction has 18758 states and 33760 transitions. [2025-03-16 19:02:55,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:02:55,906 INFO L276 IsEmpty]: Start isEmpty. Operand 18758 states and 33760 transitions. [2025-03-16 19:02:55,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:02:55,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:02:55,918 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] [2025-03-16 19:02:55,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:02:55,918 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:02:55,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:02:55,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1879937901, now seen corresponding path program 1 times [2025-03-16 19:02:55,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:02:55,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761631956] [2025-03-16 19:02:55,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:02:55,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:02:55,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:02:55,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:02:55,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:02:55,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:02:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:02:56,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:02:56,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761631956] [2025-03-16 19:02:56,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761631956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:02:56,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:02:56,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:02:56,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348611119] [2025-03-16 19:02:56,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:02:56,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:02:56,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:02:56,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:02:56,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:02:56,029 INFO L87 Difference]: Start difference. First operand 18758 states and 33760 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:02:57,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:02:57,719 INFO L93 Difference]: Finished difference Result 62604 states and 119331 transitions. [2025-03-16 19:02:57,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:02:57,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2025-03-16 19:02:57,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:02:57,915 INFO L225 Difference]: With dead ends: 62604 [2025-03-16 19:02:57,915 INFO L226 Difference]: Without dead ends: 43858 [2025-03-16 19:02:57,980 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-16 19:02:57,982 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 613 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:02:57,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 1636 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:02:58,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43858 states. [2025-03-16 19:02:59,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43858 to 41455. [2025-03-16 19:02:59,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41455 states, 36744 states have (on average 1.6717831482691052) internal successors, (61428), 38805 states have internal predecessors, (61428), 1876 states have call successors, (1876), 774 states have call predecessors, (1876), 2834 states have return successors, (18260), 2003 states have call predecessors, (18260), 1876 states have call successors, (18260) [2025-03-16 19:02:59,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41455 states to 41455 states and 81564 transitions. [2025-03-16 19:02:59,926 INFO L78 Accepts]: Start accepts. Automaton has 41455 states and 81564 transitions. Word has length 100 [2025-03-16 19:02:59,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:02:59,927 INFO L471 AbstractCegarLoop]: Abstraction has 41455 states and 81564 transitions. [2025-03-16 19:02:59,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:02:59,927 INFO L276 IsEmpty]: Start isEmpty. Operand 41455 states and 81564 transitions. [2025-03-16 19:02:59,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:02:59,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:02:59,948 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] [2025-03-16 19:02:59,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:02:59,948 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:02:59,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:02:59,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1893470702, now seen corresponding path program 1 times [2025-03-16 19:02:59,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:02:59,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556176268] [2025-03-16 19:02:59,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:02:59,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:02:59,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:02:59,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:02:59,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:02:59,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:00,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:00,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:00,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556176268] [2025-03-16 19:03:00,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556176268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:00,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:00,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:03:00,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45421780] [2025-03-16 19:03:00,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:00,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:03:00,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:00,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:03:00,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:03:00,033 INFO L87 Difference]: Start difference. First operand 41455 states and 81564 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:03:02,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:02,589 INFO L93 Difference]: Finished difference Result 93843 states and 195074 transitions. [2025-03-16 19:03:02,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:03:02,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2025-03-16 19:03:02,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:02,865 INFO L225 Difference]: With dead ends: 93843 [2025-03-16 19:03:02,865 INFO L226 Difference]: Without dead ends: 52400 [2025-03-16 19:03:02,980 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-16 19:03:02,981 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 429 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:02,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 606 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:03:03,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52400 states. [2025-03-16 19:03:05,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52400 to 41455. [2025-03-16 19:03:05,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41455 states, 36744 states have (on average 1.6682723709993468) internal successors, (61299), 38805 states have internal predecessors, (61299), 1876 states have call successors, (1876), 774 states have call predecessors, (1876), 2834 states have return successors, (18260), 2003 states have call predecessors, (18260), 1876 states have call successors, (18260) [2025-03-16 19:03:06,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41455 states to 41455 states and 81435 transitions. [2025-03-16 19:03:06,195 INFO L78 Accepts]: Start accepts. Automaton has 41455 states and 81435 transitions. Word has length 100 [2025-03-16 19:03:06,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:06,196 INFO L471 AbstractCegarLoop]: Abstraction has 41455 states and 81435 transitions. [2025-03-16 19:03:06,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:03:06,196 INFO L276 IsEmpty]: Start isEmpty. Operand 41455 states and 81435 transitions. [2025-03-16 19:03:06,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:03:06,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:06,214 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] [2025-03-16 19:03:06,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:03:06,215 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:06,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:06,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1292681395, now seen corresponding path program 1 times [2025-03-16 19:03:06,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:06,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032942010] [2025-03-16 19:03:06,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:06,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:06,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:03:06,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:03:06,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:06,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:06,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:06,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032942010] [2025-03-16 19:03:06,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032942010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:06,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:06,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:03:06,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166273247] [2025-03-16 19:03:06,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:06,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:03:06,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:06,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:03:06,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:03:06,551 INFO L87 Difference]: Start difference. First operand 41455 states and 81435 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:03:10,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:03:10,806 INFO L93 Difference]: Finished difference Result 135447 states and 292062 transitions. [2025-03-16 19:03:10,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:03:10,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2025-03-16 19:03:10,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:03:11,465 INFO L225 Difference]: With dead ends: 135447 [2025-03-16 19:03:11,465 INFO L226 Difference]: Without dead ends: 94004 [2025-03-16 19:03:11,617 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-16 19:03:11,618 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 627 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:03:11,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 1605 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:03:11,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94004 states. [2025-03-16 19:03:18,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94004 to 91031. [2025-03-16 19:03:18,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91031 states, 79578 states have (on average 1.6688155017718465) internal successors, (132801), 85885 states have internal predecessors, (132801), 3604 states have call successors, (3604), 1542 states have call predecessors, (3604), 7848 states have return successors, (69140), 3859 states have call predecessors, (69140), 3604 states have call successors, (69140) [2025-03-16 19:03:18,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91031 states to 91031 states and 205545 transitions. [2025-03-16 19:03:18,718 INFO L78 Accepts]: Start accepts. Automaton has 91031 states and 205545 transitions. Word has length 100 [2025-03-16 19:03:18,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:03:18,719 INFO L471 AbstractCegarLoop]: Abstraction has 91031 states and 205545 transitions. [2025-03-16 19:03:18,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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-16 19:03:18,719 INFO L276 IsEmpty]: Start isEmpty. Operand 91031 states and 205545 transitions. [2025-03-16 19:03:18,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:03:18,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:03:18,748 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] [2025-03-16 19:03:18,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:03:18,748 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:03:18,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:03:18,748 INFO L85 PathProgramCache]: Analyzing trace with hash -425629170, now seen corresponding path program 1 times [2025-03-16 19:03:18,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:03:18,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453989648] [2025-03-16 19:03:18,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:03:18,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:03:18,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:03:18,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:03:18,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:03:18,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:03:18,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:03:18,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:03:18,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453989648] [2025-03-16 19:03:18,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453989648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:03:18,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:03:18,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:03:18,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75210373] [2025-03-16 19:03:18,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:03:18,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:03:18,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:03:18,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:03:18,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:03:18,833 INFO L87 Difference]: Start difference. First operand 91031 states and 205545 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 5 states have internal predecessors, (90), 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)