./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.04.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.04.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 05d3b7d21cc48825b4a0189c75f03d768acc6241312029d3e223c1b9b2a509ea --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:07:29,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:07:29,794 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:07:29,804 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:07:29,804 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:07:29,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:07:29,835 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:07:29,836 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:07:29,836 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:07:29,836 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:07:29,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:07:29,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:07:29,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:07:29,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:07:29,838 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:07:29,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:07:29,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:07:29,838 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:07:29,838 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:07:29,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:07:29,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:07:29,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:07:29,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:07:29,839 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:07:29,840 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:07:29,840 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:07:29,840 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:07:29,840 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:07:29,840 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:07:29,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:07:29,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:07:29,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:07:29,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:07:29,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:07:29,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:07:29,841 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:07:29,841 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:07:29,841 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:07:29,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:07:29,842 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:07:29,842 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:07:29,842 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:07:29,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:07:29,842 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-jdk21/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 -> 05d3b7d21cc48825b4a0189c75f03d768acc6241312029d3e223c1b9b2a509ea [2025-02-05 16:07:30,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:07:30,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:07:30,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:07:30,178 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:07:30,178 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:07:30,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.04.cil-2.c [2025-02-05 16:07:31,575 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9861f8fc/2310db707ec84c629339776f0d0def01/FLAG01f297c07 [2025-02-05 16:07:31,832 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:07:31,836 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.04.cil-2.c [2025-02-05 16:07:31,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9861f8fc/2310db707ec84c629339776f0d0def01/FLAG01f297c07 [2025-02-05 16:07:32,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9861f8fc/2310db707ec84c629339776f0d0def01 [2025-02-05 16:07:32,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:07:32,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:07:32,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:07:32,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:07:32,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:07:32,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3466a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32, skipping insertion in model container [2025-02-05 16:07:32,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,181 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:07:32,321 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.04.cil-2.c[671,684] [2025-02-05 16:07:32,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:07:32,429 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:07:32,438 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.04.cil-2.c[671,684] [2025-02-05 16:07:32,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:07:32,504 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:07:32,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32 WrapperNode [2025-02-05 16:07:32,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:07:32,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:07:32,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:07:32,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:07:32,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,517 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,537 INFO L138 Inliner]: procedures = 36, calls = 44, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 384 [2025-02-05 16:07:32,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:07:32,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:07:32,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:07:32,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:07:32,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,563 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-02-05 16:07:32,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,569 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,570 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,572 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,572 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,574 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:07:32,575 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:07:32,575 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:07:32,575 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:07:32,576 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (1/1) ... [2025-02-05 16:07:32,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:07:32,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:07:32,609 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:07:32,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:07:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:07:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-05 16:07:32,631 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-05 16:07:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 16:07:32,631 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 16:07:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 16:07:32,631 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 16:07:32,631 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 16:07:32,632 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 16:07:32,632 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 16:07:32,632 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 16:07:32,632 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 16:07:32,632 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 16:07:32,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:07:32,632 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 16:07:32,632 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 16:07:32,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:07:32,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:07:32,708 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:07:32,710 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:07:33,174 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-02-05 16:07:33,174 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:07:33,191 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:07:33,193 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:07:33,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:07:33 BoogieIcfgContainer [2025-02-05 16:07:33,194 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:07:33,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:07:33,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:07:33,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:07:33,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:07:32" (1/3) ... [2025-02-05 16:07:33,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72645a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:07:33, skipping insertion in model container [2025-02-05 16:07:33,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:07:32" (2/3) ... [2025-02-05 16:07:33,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72645a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:07:33, skipping insertion in model container [2025-02-05 16:07:33,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:07:33" (3/3) ... [2025-02-05 16:07:33,205 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.04.cil-2.c [2025-02-05 16:07:33,220 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:07:33,221 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.04.cil-2.c that has 8 procedures, 200 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-02-05 16:07:33,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:07:33,286 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;@62148088, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:07:33,287 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:07:33,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 200 states, 171 states have (on average 1.543859649122807) internal successors, (264), 175 states have internal predecessors, (264), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-05 16:07:33,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:07:33,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:33,300 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] [2025-02-05 16:07:33,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:33,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:33,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1170237212, now seen corresponding path program 1 times [2025-02-05 16:07:33,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:33,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434106769] [2025-02-05 16:07:33,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:33,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:33,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:07:33,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:07:33,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:33,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:33,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:33,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434106769] [2025-02-05 16:07:33,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434106769] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:33,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:33,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:07:33,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635185333] [2025-02-05 16:07:33,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:33,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:07:33,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:33,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:07:33,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:07:33,839 INFO L87 Difference]: Start difference. First operand has 200 states, 171 states have (on average 1.543859649122807) internal successors, (264), 175 states have internal predecessors, (264), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:07:34,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:34,348 INFO L93 Difference]: Finished difference Result 588 states and 906 transitions. [2025-02-05 16:07:34,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:07:34,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 16:07:34,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:34,361 INFO L225 Difference]: With dead ends: 588 [2025-02-05 16:07:34,362 INFO L226 Difference]: Without dead ends: 392 [2025-02-05 16:07:34,366 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-02-05 16:07:34,368 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 500 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:34,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 822 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:07:34,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-05 16:07:34,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 377. [2025-02-05 16:07:34,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 330 states have (on average 1.5121212121212122) internal successors, (499), 333 states have internal predecessors, (499), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-02-05 16:07:34,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 564 transitions. [2025-02-05 16:07:34,438 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 564 transitions. Word has length 90 [2025-02-05 16:07:34,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:34,438 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 564 transitions. [2025-02-05 16:07:34,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:07:34,439 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 564 transitions. [2025-02-05 16:07:34,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:07:34,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:34,442 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] [2025-02-05 16:07:34,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:07:34,442 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:34,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:34,443 INFO L85 PathProgramCache]: Analyzing trace with hash -2004598758, now seen corresponding path program 1 times [2025-02-05 16:07:34,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:34,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487168638] [2025-02-05 16:07:34,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:34,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:34,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:07:34,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:07:34,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:34,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:34,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:34,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:34,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487168638] [2025-02-05 16:07:34,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487168638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:34,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:34,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:07:34,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032838806] [2025-02-05 16:07:34,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:34,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:07:34,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:34,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:07:34,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:34,673 INFO L87 Difference]: Start difference. First operand 377 states and 564 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:07:35,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:35,241 INFO L93 Difference]: Finished difference Result 969 states and 1462 transitions. [2025-02-05 16:07:35,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:07:35,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 16:07:35,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:35,247 INFO L225 Difference]: With dead ends: 969 [2025-02-05 16:07:35,247 INFO L226 Difference]: Without dead ends: 604 [2025-02-05 16:07:35,250 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-02-05 16:07:35,251 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 489 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:35,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 1517 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:07:35,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-02-05 16:07:35,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 549. [2025-02-05 16:07:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 482 states have (on average 1.504149377593361) internal successors, (725), 486 states have internal predecessors, (725), 46 states have call successors, (46), 19 states have call predecessors, (46), 20 states have return successors, (48), 45 states have call predecessors, (48), 44 states have call successors, (48) [2025-02-05 16:07:35,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 819 transitions. [2025-02-05 16:07:35,303 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 819 transitions. Word has length 90 [2025-02-05 16:07:35,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:35,303 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 819 transitions. [2025-02-05 16:07:35,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:07:35,304 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 819 transitions. [2025-02-05 16:07:35,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:07:35,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:35,305 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] [2025-02-05 16:07:35,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:07:35,306 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:35,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:35,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1137546533, now seen corresponding path program 1 times [2025-02-05 16:07:35,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:35,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549453840] [2025-02-05 16:07:35,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:35,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:35,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:07:35,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:07:35,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:35,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:35,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:35,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:35,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549453840] [2025-02-05 16:07:35,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549453840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:35,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:35,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:07:35,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444251736] [2025-02-05 16:07:35,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:35,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:07:35,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:35,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:07:35,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:35,507 INFO L87 Difference]: Start difference. First operand 549 states and 819 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:07:36,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:36,049 INFO L93 Difference]: Finished difference Result 1507 states and 2270 transitions. [2025-02-05 16:07:36,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:07:36,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 16:07:36,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:36,056 INFO L225 Difference]: With dead ends: 1507 [2025-02-05 16:07:36,056 INFO L226 Difference]: Without dead ends: 970 [2025-02-05 16:07:36,058 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-02-05 16:07:36,059 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 484 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:36,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 1501 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:07:36,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2025-02-05 16:07:36,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 910. [2025-02-05 16:07:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 801 states have (on average 1.5031210986267165) internal successors, (1204), 809 states have internal predecessors, (1204), 72 states have call successors, (72), 31 states have call predecessors, (72), 36 states have return successors, (86), 73 states have call predecessors, (86), 70 states have call successors, (86) [2025-02-05 16:07:36,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1362 transitions. [2025-02-05 16:07:36,132 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1362 transitions. Word has length 90 [2025-02-05 16:07:36,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:36,133 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1362 transitions. [2025-02-05 16:07:36,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:07:36,133 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1362 transitions. [2025-02-05 16:07:36,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:07:36,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:36,135 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] [2025-02-05 16:07:36,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:07:36,135 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:36,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:36,136 INFO L85 PathProgramCache]: Analyzing trace with hash -693935110, now seen corresponding path program 1 times [2025-02-05 16:07:36,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:36,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684506018] [2025-02-05 16:07:36,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:36,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:36,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:07:36,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:07:36,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:36,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:36,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:36,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:36,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684506018] [2025-02-05 16:07:36,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684506018] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:36,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:36,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:07:36,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247368077] [2025-02-05 16:07:36,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:36,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:07:36,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:36,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:07:36,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:36,283 INFO L87 Difference]: Start difference. First operand 910 states and 1362 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:07:36,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:36,847 INFO L93 Difference]: Finished difference Result 2630 states and 3983 transitions. [2025-02-05 16:07:36,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:07:36,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 16:07:36,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:36,863 INFO L225 Difference]: With dead ends: 2630 [2025-02-05 16:07:36,863 INFO L226 Difference]: Without dead ends: 1732 [2025-02-05 16:07:36,866 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-02-05 16:07:36,869 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 476 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:36,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1475 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:07:36,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2025-02-05 16:07:37,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1668. [2025-02-05 16:07:37,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1469 states have (on average 1.5071477195371001) internal successors, (2214), 1491 states have internal predecessors, (2214), 124 states have call successors, (124), 55 states have call predecessors, (124), 74 states have return successors, (186), 129 states have call predecessors, (186), 122 states have call successors, (186) [2025-02-05 16:07:37,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2524 transitions. [2025-02-05 16:07:37,019 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2524 transitions. Word has length 90 [2025-02-05 16:07:37,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:37,020 INFO L471 AbstractCegarLoop]: Abstraction has 1668 states and 2524 transitions. [2025-02-05 16:07:37,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:07:37,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2524 transitions. [2025-02-05 16:07:37,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:07:37,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:37,023 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] [2025-02-05 16:07:37,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:07:37,024 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:37,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:37,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1491998937, now seen corresponding path program 1 times [2025-02-05 16:07:37,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:37,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134081385] [2025-02-05 16:07:37,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:37,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:37,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:07:37,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:07:37,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:37,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:37,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:37,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:37,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134081385] [2025-02-05 16:07:37,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134081385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:37,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:37,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:07:37,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556626330] [2025-02-05 16:07:37,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:37,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:07:37,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:37,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:07:37,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:37,159 INFO L87 Difference]: Start difference. First operand 1668 states and 2524 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:07:37,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:37,828 INFO L93 Difference]: Finished difference Result 5284 states and 8132 transitions. [2025-02-05 16:07:37,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:07:37,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 16:07:37,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:37,850 INFO L225 Difference]: With dead ends: 5284 [2025-02-05 16:07:37,850 INFO L226 Difference]: Without dead ends: 3628 [2025-02-05 16:07:37,856 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-02-05 16:07:37,857 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 605 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:37,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1450 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:07:37,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3628 states. [2025-02-05 16:07:38,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3628 to 3259. [2025-02-05 16:07:38,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3259 states, 2870 states have (on average 1.5184668989547039) internal successors, (4358), 2938 states have internal predecessors, (4358), 220 states have call successors, (220), 103 states have call predecessors, (220), 168 states have return successors, (474), 233 states have call predecessors, (474), 218 states have call successors, (474) [2025-02-05 16:07:38,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3259 states to 3259 states and 5052 transitions. [2025-02-05 16:07:38,101 INFO L78 Accepts]: Start accepts. Automaton has 3259 states and 5052 transitions. Word has length 90 [2025-02-05 16:07:38,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:38,102 INFO L471 AbstractCegarLoop]: Abstraction has 3259 states and 5052 transitions. [2025-02-05 16:07:38,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:07:38,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3259 states and 5052 transitions. [2025-02-05 16:07:38,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:07:38,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:38,109 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] [2025-02-05 16:07:38,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:07:38,109 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:38,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:38,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1008323610, now seen corresponding path program 1 times [2025-02-05 16:07:38,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:38,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835589238] [2025-02-05 16:07:38,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:38,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:38,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:07:38,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:07:38,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:38,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:38,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:38,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:38,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835589238] [2025-02-05 16:07:38,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835589238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:38,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:38,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:07:38,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342119224] [2025-02-05 16:07:38,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:38,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:07:38,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:38,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:07:38,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:07:38,217 INFO L87 Difference]: Start difference. First operand 3259 states and 5052 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:07:38,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:38,624 INFO L93 Difference]: Finished difference Result 6921 states and 10958 transitions. [2025-02-05 16:07:38,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:07:38,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 16:07:38,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:38,652 INFO L225 Difference]: With dead ends: 6921 [2025-02-05 16:07:38,653 INFO L226 Difference]: Without dead ends: 3674 [2025-02-05 16:07:38,665 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-02-05 16:07:38,667 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 365 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:38,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 519 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:07:38,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2025-02-05 16:07:38,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3259. [2025-02-05 16:07:38,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3259 states, 2870 states have (on average 1.5125435540069687) internal successors, (4341), 2938 states have internal predecessors, (4341), 220 states have call successors, (220), 103 states have call predecessors, (220), 168 states have return successors, (474), 233 states have call predecessors, (474), 218 states have call successors, (474) [2025-02-05 16:07:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3259 states to 3259 states and 5035 transitions. [2025-02-05 16:07:38,952 INFO L78 Accepts]: Start accepts. Automaton has 3259 states and 5035 transitions. Word has length 90 [2025-02-05 16:07:38,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:38,953 INFO L471 AbstractCegarLoop]: Abstraction has 3259 states and 5035 transitions. [2025-02-05 16:07:38,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:07:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3259 states and 5035 transitions. [2025-02-05 16:07:38,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:07:38,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:38,957 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] [2025-02-05 16:07:38,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:07:38,957 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:38,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:38,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1962552505, now seen corresponding path program 1 times [2025-02-05 16:07:38,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:38,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497452099] [2025-02-05 16:07:38,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:38,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:38,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:07:38,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:07:38,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:38,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:39,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:39,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:39,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497452099] [2025-02-05 16:07:39,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497452099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:39,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:39,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:07:39,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232169171] [2025-02-05 16:07:39,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:39,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:07:39,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:39,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:07:39,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:39,078 INFO L87 Difference]: Start difference. First operand 3259 states and 5035 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:07:39,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:39,839 INFO L93 Difference]: Finished difference Result 10269 states and 16287 transitions. [2025-02-05 16:07:39,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:07:39,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 16:07:39,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:39,885 INFO L225 Difference]: With dead ends: 10269 [2025-02-05 16:07:39,886 INFO L226 Difference]: Without dead ends: 7022 [2025-02-05 16:07:39,898 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-02-05 16:07:39,899 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 532 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:39,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1419 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:07:39,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7022 states. [2025-02-05 16:07:40,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7022 to 6579. [2025-02-05 16:07:40,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6579 states, 5764 states have (on average 1.5182165163081194) internal successors, (8751), 5978 states have internal predecessors, (8751), 404 states have call successors, (404), 199 states have call predecessors, (404), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-02-05 16:07:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6579 states to 6579 states and 10581 transitions. [2025-02-05 16:07:40,410 INFO L78 Accepts]: Start accepts. Automaton has 6579 states and 10581 transitions. Word has length 90 [2025-02-05 16:07:40,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:40,411 INFO L471 AbstractCegarLoop]: Abstraction has 6579 states and 10581 transitions. [2025-02-05 16:07:40,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:07:40,412 INFO L276 IsEmpty]: Start isEmpty. Operand 6579 states and 10581 transitions. [2025-02-05 16:07:40,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:07:40,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:40,418 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] [2025-02-05 16:07:40,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:07:40,419 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:40,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:40,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1716239418, now seen corresponding path program 1 times [2025-02-05 16:07:40,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:40,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171383004] [2025-02-05 16:07:40,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:40,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:40,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:07:40,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:07:40,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:40,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:40,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:40,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:40,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171383004] [2025-02-05 16:07:40,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171383004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:40,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:40,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:07:40,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980228101] [2025-02-05 16:07:40,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:40,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:07:40,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:40,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:07:40,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:07:40,538 INFO L87 Difference]: Start difference. First operand 6579 states and 10581 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:07:41,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:41,204 INFO L93 Difference]: Finished difference Result 13881 states and 22970 transitions. [2025-02-05 16:07:41,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:07:41,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 16:07:41,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:41,273 INFO L225 Difference]: With dead ends: 13881 [2025-02-05 16:07:41,273 INFO L226 Difference]: Without dead ends: 7314 [2025-02-05 16:07:41,300 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-02-05 16:07:41,301 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 354 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:41,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 523 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:07:41,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7314 states. [2025-02-05 16:07:41,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7314 to 6579. [2025-02-05 16:07:41,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6579 states, 5764 states have (on average 1.5124913254684247) internal successors, (8718), 5978 states have internal predecessors, (8718), 404 states have call successors, (404), 199 states have call predecessors, (404), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-02-05 16:07:41,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6579 states to 6579 states and 10548 transitions. [2025-02-05 16:07:41,882 INFO L78 Accepts]: Start accepts. Automaton has 6579 states and 10548 transitions. Word has length 90 [2025-02-05 16:07:41,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:41,883 INFO L471 AbstractCegarLoop]: Abstraction has 6579 states and 10548 transitions. [2025-02-05 16:07:41,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:07:41,883 INFO L276 IsEmpty]: Start isEmpty. Operand 6579 states and 10548 transitions. [2025-02-05 16:07:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:07:41,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:41,890 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] [2025-02-05 16:07:41,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:07:41,890 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:41,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:41,891 INFO L85 PathProgramCache]: Analyzing trace with hash 45725849, now seen corresponding path program 1 times [2025-02-05 16:07:41,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:41,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560589049] [2025-02-05 16:07:41,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:41,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:41,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:07:41,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:07:41,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:41,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:42,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:42,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:42,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560589049] [2025-02-05 16:07:42,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560589049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:42,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:42,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:07:42,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436608997] [2025-02-05 16:07:42,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:42,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:07:42,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:42,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:07:42,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:42,018 INFO L87 Difference]: Start difference. First operand 6579 states and 10548 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:07:43,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:43,328 INFO L93 Difference]: Finished difference Result 20241 states and 33972 transitions. [2025-02-05 16:07:43,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:07:43,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 16:07:43,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:43,439 INFO L225 Difference]: With dead ends: 20241 [2025-02-05 16:07:43,440 INFO L226 Difference]: Without dead ends: 13674 [2025-02-05 16:07:43,471 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-02-05 16:07:43,474 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 459 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:43,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1388 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:07:43,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13674 states. [2025-02-05 16:07:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13674 to 13333. [2025-02-05 16:07:44,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13333 states, 11520 states have (on average 1.5013888888888889) internal successors, (17296), 12188 states have internal predecessors, (17296), 756 states have call successors, (756), 391 states have call predecessors, (756), 1056 states have return successors, (4850), 817 states have call predecessors, (4850), 754 states have call successors, (4850) [2025-02-05 16:07:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13333 states to 13333 states and 22902 transitions. [2025-02-05 16:07:44,534 INFO L78 Accepts]: Start accepts. Automaton has 13333 states and 22902 transitions. Word has length 90 [2025-02-05 16:07:44,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:44,535 INFO L471 AbstractCegarLoop]: Abstraction has 13333 states and 22902 transitions. [2025-02-05 16:07:44,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:07:44,536 INFO L276 IsEmpty]: Start isEmpty. Operand 13333 states and 22902 transitions. [2025-02-05 16:07:44,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:07:44,549 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:44,549 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] [2025-02-05 16:07:44,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:07:44,549 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:44,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:44,550 INFO L85 PathProgramCache]: Analyzing trace with hash -562351014, now seen corresponding path program 1 times [2025-02-05 16:07:44,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:44,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832268239] [2025-02-05 16:07:44,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:44,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:44,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:07:44,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:07:44,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:44,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:44,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:44,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832268239] [2025-02-05 16:07:44,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832268239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:44,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:44,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:07:44,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625203739] [2025-02-05 16:07:44,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:44,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:07:44,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:44,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:07:44,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:07:44,618 INFO L87 Difference]: Start difference. First operand 13333 states and 22902 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:07:46,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:46,166 INFO L93 Difference]: Finished difference Result 39318 states and 68147 transitions. [2025-02-05 16:07:46,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:07:46,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 16:07:46,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:46,331 INFO L225 Difference]: With dead ends: 39318 [2025-02-05 16:07:46,331 INFO L226 Difference]: Without dead ends: 25998 [2025-02-05 16:07:46,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:07:46,399 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 481 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:46,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 971 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:07:46,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25998 states. [2025-02-05 16:07:48,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25998 to 25933. [2025-02-05 16:07:48,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25933 states, 22314 states have (on average 1.4796092139464014) internal successors, (33016), 23713 states have internal predecessors, (33016), 1506 states have call successors, (1506), 781 states have call predecessors, (1506), 2112 states have return successors, (9633), 1502 states have call predecessors, (9633), 1504 states have call successors, (9633) [2025-02-05 16:07:48,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25933 states to 25933 states and 44155 transitions. [2025-02-05 16:07:48,378 INFO L78 Accepts]: Start accepts. Automaton has 25933 states and 44155 transitions. Word has length 90 [2025-02-05 16:07:48,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:48,378 INFO L471 AbstractCegarLoop]: Abstraction has 25933 states and 44155 transitions. [2025-02-05 16:07:48,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 16:07:48,379 INFO L276 IsEmpty]: Start isEmpty. Operand 25933 states and 44155 transitions. [2025-02-05 16:07:48,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 16:07:48,458 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:48,458 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:07:48,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:07:48,458 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:48,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:48,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1830534560, now seen corresponding path program 1 times [2025-02-05 16:07:48,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:48,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024648784] [2025-02-05 16:07:48,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:48,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:48,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 16:07:48,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 16:07:48,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:48,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:48,551 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 16:07:48,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:48,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024648784] [2025-02-05 16:07:48,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024648784] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:07:48,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639705681] [2025-02-05 16:07:48,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:48,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:07:48,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:07:48,556 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:07:48,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:07:48,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 16:07:48,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 16:07:48,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:48,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:48,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:07:48,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:07:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 16:07:48,798 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:07:48,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639705681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:48,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:07:48,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 16:07:48,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644080580] [2025-02-05 16:07:48,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:48,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:07:48,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:48,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:07:48,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:48,800 INFO L87 Difference]: Start difference. First operand 25933 states and 44155 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 16:07:51,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:51,597 INFO L93 Difference]: Finished difference Result 77122 states and 132039 transitions. [2025-02-05 16:07:51,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:07:51,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2025-02-05 16:07:51,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:51,848 INFO L225 Difference]: With dead ends: 77122 [2025-02-05 16:07:51,849 INFO L226 Difference]: Without dead ends: 51202 [2025-02-05 16:07:51,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:51,926 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 236 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:51,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 538 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:07:51,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51202 states. [2025-02-05 16:07:54,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51202 to 50808. [2025-02-05 16:07:54,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50808 states, 43707 states have (on average 1.4806781522410597) internal successors, (64716), 46503 states have internal predecessors, (64716), 2876 states have call successors, (2876), 1561 states have call predecessors, (2876), 4224 states have return successors, (19069), 2807 states have call predecessors, (19069), 2874 states have call successors, (19069) [2025-02-05 16:07:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50808 states to 50808 states and 86661 transitions. [2025-02-05 16:07:55,046 INFO L78 Accepts]: Start accepts. Automaton has 50808 states and 86661 transitions. Word has length 148 [2025-02-05 16:07:55,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:55,047 INFO L471 AbstractCegarLoop]: Abstraction has 50808 states and 86661 transitions. [2025-02-05 16:07:55,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 16:07:55,048 INFO L276 IsEmpty]: Start isEmpty. Operand 50808 states and 86661 transitions. [2025-02-05 16:07:55,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 16:07:55,131 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:55,131 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:07:55,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:07:55,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 16:07:55,332 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:55,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:55,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1436455590, now seen corresponding path program 1 times [2025-02-05 16:07:55,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:55,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199064852] [2025-02-05 16:07:55,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:55,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:55,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 16:07:55,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 16:07:55,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:55,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:55,420 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 16:07:55,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:55,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199064852] [2025-02-05 16:07:55,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199064852] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:07:55,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031789928] [2025-02-05 16:07:55,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:55,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:07:55,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:07:55,424 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:07:55,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:07:55,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 16:07:55,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 16:07:55,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:55,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:55,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:07:55,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:07:55,639 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 16:07:55,640 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:07:55,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031789928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:55,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:07:55,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 16:07:55,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376079752] [2025-02-05 16:07:55,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:55,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:07:55,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:55,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:07:55,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:55,641 INFO L87 Difference]: Start difference. First operand 50808 states and 86661 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 16:08:01,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:01,034 INFO L93 Difference]: Finished difference Result 151481 states and 259747 transitions. [2025-02-05 16:08:01,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:08:01,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2025-02-05 16:08:01,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:01,735 INFO L225 Difference]: With dead ends: 151481 [2025-02-05 16:08:01,735 INFO L226 Difference]: Without dead ends: 100686 [2025-02-05 16:08:01,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:08:01,864 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 230 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:01,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 538 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:08:01,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100686 states. [2025-02-05 16:08:06,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100686 to 99902. [2025-02-05 16:08:06,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99902 states, 85839 states have (on average 1.4803527534104544) internal successors, (127072), 91429 states have internal predecessors, (127072), 5614 states have call successors, (5614), 3121 states have call predecessors, (5614), 8448 states have return successors, (37939), 5415 states have call predecessors, (37939), 5612 states have call successors, (37939) [2025-02-05 16:08:07,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99902 states to 99902 states and 170625 transitions. [2025-02-05 16:08:07,577 INFO L78 Accepts]: Start accepts. Automaton has 99902 states and 170625 transitions. Word has length 148 [2025-02-05 16:08:07,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:07,578 INFO L471 AbstractCegarLoop]: Abstraction has 99902 states and 170625 transitions. [2025-02-05 16:08:07,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 16:08:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 99902 states and 170625 transitions. [2025-02-05 16:08:07,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 16:08:07,691 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:07,692 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:08:07,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 16:08:07,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:08:07,894 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:07,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:07,895 INFO L85 PathProgramCache]: Analyzing trace with hash -89395052, now seen corresponding path program 1 times [2025-02-05 16:08:07,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:07,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353232289] [2025-02-05 16:08:07,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:07,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:07,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 16:08:07,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 16:08:07,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:07,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:07,977 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 16:08:07,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:07,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353232289] [2025-02-05 16:08:07,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353232289] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:08:07,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481098533] [2025-02-05 16:08:07,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:07,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:08:07,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:08:07,980 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:08:07,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:08:08,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 16:08:08,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 16:08:08,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:08,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:08,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:08:08,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:08:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 16:08:08,152 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:08:08,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481098533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:08,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:08:08,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 16:08:08,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834199254] [2025-02-05 16:08:08,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:08,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:08:08,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:08,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:08:08,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:08:08,154 INFO L87 Difference]: Start difference. First operand 99902 states and 170625 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)