./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label30.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/eca-rers2012/Problem12_label30.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 0e208708a27329bc1b7bf267e92e92da86b44f6d40f860b2d7ec34e4892651a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:46:52,090 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:46:52,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:46:52,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:46:52,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:46:52,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:46:52,154 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:46:52,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:46:52,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:46:52,155 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:46:52,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:46:52,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:46:52,155 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:46:52,155 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:46:52,155 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:46:52,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:46:52,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:46:52,155 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:46:52,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:46:52,156 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:46:52,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:46:52,156 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:46:52,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:46:52,156 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:46:52,156 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:46:52,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:46:52,156 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:46:52,156 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:46:52,156 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:46:52,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:46:52,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:46:52,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:46:52,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:46:52,156 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:46:52,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:46:52,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:46:52,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:46:52,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:46:52,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:46:52,156 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:46:52,157 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:46:52,157 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:46:52,157 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:46:52,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:46:52,157 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:46:52,157 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:46:52,157 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:46:52,157 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:46:52,157 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 -> 0e208708a27329bc1b7bf267e92e92da86b44f6d40f860b2d7ec34e4892651a8 [2025-01-08 23:46:52,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:46:52,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:46:52,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:46:52,374 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:46:52,375 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:46:52,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label30.c [2025-01-08 23:46:53,571 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e97179ac1/84354ccf9ce640c3bc982b0ec86910e0/FLAG0961dc591 [2025-01-08 23:46:54,015 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:46:54,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label30.c [2025-01-08 23:46:54,039 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e97179ac1/84354ccf9ce640c3bc982b0ec86910e0/FLAG0961dc591 [2025-01-08 23:46:54,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e97179ac1/84354ccf9ce640c3bc982b0ec86910e0 [2025-01-08 23:46:54,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:46:54,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:46:54,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:46:54,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:46:54,132 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:46:54,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:46:54" (1/1) ... [2025-01-08 23:46:54,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ee67061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:54, skipping insertion in model container [2025-01-08 23:46:54,133 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:46:54" (1/1) ... [2025-01-08 23:46:54,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:46:54,337 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/eca-rers2012/Problem12_label30.c[3429,3442] [2025-01-08 23:46:54,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:46:54,860 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:46:54,872 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/eca-rers2012/Problem12_label30.c[3429,3442] [2025-01-08 23:46:55,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:46:55,131 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:46:55,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:55 WrapperNode [2025-01-08 23:46:55,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:46:55,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:46:55,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:46:55,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:46:55,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:55" (1/1) ... [2025-01-08 23:46:55,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:55" (1/1) ... [2025-01-08 23:46:55,382 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-01-08 23:46:55,383 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:46:55,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:46:55,384 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:46:55,384 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:46:55,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:55" (1/1) ... [2025-01-08 23:46:55,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:55" (1/1) ... [2025-01-08 23:46:55,426 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:55" (1/1) ... [2025-01-08 23:46:55,583 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-01-08 23:46:55,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:55" (1/1) ... [2025-01-08 23:46:55,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:55" (1/1) ... [2025-01-08 23:46:55,684 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:55" (1/1) ... [2025-01-08 23:46:55,710 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:55" (1/1) ... [2025-01-08 23:46:55,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:55" (1/1) ... [2025-01-08 23:46:55,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:55" (1/1) ... [2025-01-08 23:46:55,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:55" (1/1) ... [2025-01-08 23:46:55,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:46:55,848 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:46:55,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:46:55,849 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:46:55,849 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:55" (1/1) ... [2025-01-08 23:46:55,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:46:55,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:46:55,875 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-01-08 23:46:55,882 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-01-08 23:46:55,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:46:55,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:46:55,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:46:55,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:46:55,940 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:46:55,941 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:46:59,181 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-01-08 23:46:59,182 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:46:59,205 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:46:59,205 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:46:59,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:46:59 BoogieIcfgContainer [2025-01-08 23:46:59,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:46:59,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:46:59,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:46:59,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:46:59,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:46:54" (1/3) ... [2025-01-08 23:46:59,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28aabe8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:46:59, skipping insertion in model container [2025-01-08 23:46:59,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:46:55" (2/3) ... [2025-01-08 23:46:59,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28aabe8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:46:59, skipping insertion in model container [2025-01-08 23:46:59,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:46:59" (3/3) ... [2025-01-08 23:46:59,213 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label30.c [2025-01-08 23:46:59,226 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:46:59,227 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label30.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:46:59,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:46:59,283 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;@468b07ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:46:59,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:46:59,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:46:59,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 23:46:59,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:46:59,292 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] [2025-01-08 23:46:59,292 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:46:59,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:46:59,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1649442964, now seen corresponding path program 1 times [2025-01-08 23:46:59,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:46:59,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658470852] [2025-01-08 23:46:59,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:46:59,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:46:59,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 23:46:59,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 23:46:59,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:46:59,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:46:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:46:59,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:46:59,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658470852] [2025-01-08 23:46:59,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658470852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:46:59,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:46:59,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:46:59,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063104974] [2025-01-08 23:46:59,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:46:59,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:46:59,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:46:59,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:46:59,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:46:59,492 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:02,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:02,596 INFO L93 Difference]: Finished difference Result 2404 states and 4642 transitions. [2025-01-08 23:47:02,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:02,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-08 23:47:02,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:02,611 INFO L225 Difference]: With dead ends: 2404 [2025-01-08 23:47:02,612 INFO L226 Difference]: Without dead ends: 1506 [2025-01-08 23:47:02,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:02,618 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 795 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:02,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 525 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-08 23:47:02,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-01-08 23:47:02,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-01-08 23:47:02,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.6066445182724252) internal successors, (2418), 1505 states have internal predecessors, (2418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2418 transitions. [2025-01-08 23:47:02,709 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2418 transitions. Word has length 25 [2025-01-08 23:47:02,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:02,709 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2418 transitions. [2025-01-08 23:47:02,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:02,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2418 transitions. [2025-01-08 23:47:02,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-08 23:47:02,711 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:02,711 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:47:02,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:47:02,712 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:02,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:02,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1408844117, now seen corresponding path program 1 times [2025-01-08 23:47:02,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:02,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693176365] [2025-01-08 23:47:02,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:02,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:02,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-08 23:47:02,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-08 23:47:02,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:02,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:02,935 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:47:02,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:02,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693176365] [2025-01-08 23:47:02,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693176365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:02,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:02,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:47:02,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896592381] [2025-01-08 23:47:02,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:02,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:02,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:02,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:02,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:02,937 INFO L87 Difference]: Start difference. First operand 1506 states and 2418 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:05,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:05,495 INFO L93 Difference]: Finished difference Result 4512 states and 7249 transitions. [2025-01-08 23:47:05,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:05,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-01-08 23:47:05,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:05,505 INFO L225 Difference]: With dead ends: 4512 [2025-01-08 23:47:05,505 INFO L226 Difference]: Without dead ends: 3008 [2025-01-08 23:47:05,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:05,508 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 774 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:05,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 449 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:47:05,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2025-01-08 23:47:05,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3008. [2025-01-08 23:47:05,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.4156967076820752) internal successors, (4257), 3007 states have internal predecessors, (4257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:05,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4257 transitions. [2025-01-08 23:47:05,549 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4257 transitions. Word has length 100 [2025-01-08 23:47:05,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:05,550 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4257 transitions. [2025-01-08 23:47:05,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:05,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4257 transitions. [2025-01-08 23:47:05,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-08 23:47:05,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:05,552 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:47:05,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:47:05,553 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:05,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:05,553 INFO L85 PathProgramCache]: Analyzing trace with hash 352938586, now seen corresponding path program 1 times [2025-01-08 23:47:05,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:05,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682726901] [2025-01-08 23:47:05,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:05,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:05,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-08 23:47:05,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-08 23:47:05,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:05,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:05,895 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:47:05,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:05,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682726901] [2025-01-08 23:47:05,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682726901] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:05,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:05,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:05,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607676655] [2025-01-08 23:47:05,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:05,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:47:05,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:05,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:47:05,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:47:05,899 INFO L87 Difference]: Start difference. First operand 3008 states and 4257 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:09,697 INFO L93 Difference]: Finished difference Result 9769 states and 13601 transitions. [2025-01-08 23:47:09,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:47:09,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-01-08 23:47:09,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:09,722 INFO L225 Difference]: With dead ends: 9769 [2025-01-08 23:47:09,722 INFO L226 Difference]: Without dead ends: 6763 [2025-01-08 23:47:09,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:47:09,727 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 2182 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4712 mSolverCounterSat, 747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2182 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 5459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 747 IncrementalHoareTripleChecker+Valid, 4712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:09,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2182 Valid, 164 Invalid, 5459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [747 Valid, 4712 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-01-08 23:47:09,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2025-01-08 23:47:09,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6763. [2025-01-08 23:47:09,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6763 states, 6762 states have (on average 1.3510795622596865) internal successors, (9136), 6762 states have internal predecessors, (9136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:09,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6763 states to 6763 states and 9136 transitions. [2025-01-08 23:47:09,814 INFO L78 Accepts]: Start accepts. Automaton has 6763 states and 9136 transitions. Word has length 102 [2025-01-08 23:47:09,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:09,815 INFO L471 AbstractCegarLoop]: Abstraction has 6763 states and 9136 transitions. [2025-01-08 23:47:09,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:09,815 INFO L276 IsEmpty]: Start isEmpty. Operand 6763 states and 9136 transitions. [2025-01-08 23:47:09,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-08 23:47:09,819 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:09,819 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:47:09,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:47:09,819 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:09,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:09,821 INFO L85 PathProgramCache]: Analyzing trace with hash -12072198, now seen corresponding path program 1 times [2025-01-08 23:47:09,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:09,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874142323] [2025-01-08 23:47:09,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:09,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:09,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-08 23:47:09,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-08 23:47:09,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:09,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:10,194 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:47:10,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:10,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874142323] [2025-01-08 23:47:10,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874142323] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:47:10,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922108714] [2025-01-08 23:47:10,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:10,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:47:10,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:47:10,197 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-01-08 23:47:10,210 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-01-08 23:47:10,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-08 23:47:10,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-08 23:47:10,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:10,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:10,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:47:10,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:47:10,521 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-08 23:47:10,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:47:10,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922108714] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:10,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:47:10,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-01-08 23:47:10,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012871696] [2025-01-08 23:47:10,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:10,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:10,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:10,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:10,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:47:10,525 INFO L87 Difference]: Start difference. First operand 6763 states and 9136 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:12,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:12,686 INFO L93 Difference]: Finished difference Result 15777 states and 21149 transitions. [2025-01-08 23:47:12,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:12,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2025-01-08 23:47:12,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:12,712 INFO L225 Difference]: With dead ends: 15777 [2025-01-08 23:47:12,713 INFO L226 Difference]: Without dead ends: 9767 [2025-01-08 23:47:12,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:47:12,721 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 716 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2395 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 2851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 2395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:12,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 156 Invalid, 2851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 2395 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 23:47:12,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2025-01-08 23:47:12,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9767. [2025-01-08 23:47:12,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.255785377841491) internal successors, (12264), 9766 states have internal predecessors, (12264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:12,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 12264 transitions. [2025-01-08 23:47:12,850 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 12264 transitions. Word has length 166 [2025-01-08 23:47:12,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:12,850 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 12264 transitions. [2025-01-08 23:47:12,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:12,851 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 12264 transitions. [2025-01-08 23:47:12,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-08 23:47:12,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:12,852 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:47:12,858 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-01-08 23:47:13,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:47:13,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:13,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:13,054 INFO L85 PathProgramCache]: Analyzing trace with hash -2082187005, now seen corresponding path program 1 times [2025-01-08 23:47:13,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:13,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171135106] [2025-01-08 23:47:13,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:13,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:13,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-08 23:47:13,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-08 23:47:13,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:13,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:13,317 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:47:13,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:13,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171135106] [2025-01-08 23:47:13,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171135106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:13,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:13,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:13,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545372634] [2025-01-08 23:47:13,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:13,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:47:13,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:13,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:47:13,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:47:13,319 INFO L87 Difference]: Start difference. First operand 9767 states and 12264 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:15,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:15,817 INFO L93 Difference]: Finished difference Result 21822 states and 27290 transitions. [2025-01-08 23:47:15,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:47:15,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2025-01-08 23:47:15,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:15,840 INFO L225 Difference]: With dead ends: 21822 [2025-01-08 23:47:15,841 INFO L226 Difference]: Without dead ends: 12771 [2025-01-08 23:47:15,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:47:15,848 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 702 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3049 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 3315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 3049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:15,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 612 Invalid, 3315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 3049 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:47:15,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12771 states. [2025-01-08 23:47:15,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12771 to 12020. [2025-01-08 23:47:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12020 states, 12019 states have (on average 1.2085032032615026) internal successors, (14525), 12019 states have internal predecessors, (14525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:15,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12020 states to 12020 states and 14525 transitions. [2025-01-08 23:47:15,968 INFO L78 Accepts]: Start accepts. Automaton has 12020 states and 14525 transitions. Word has length 173 [2025-01-08 23:47:15,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:15,968 INFO L471 AbstractCegarLoop]: Abstraction has 12020 states and 14525 transitions. [2025-01-08 23:47:15,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:15,969 INFO L276 IsEmpty]: Start isEmpty. Operand 12020 states and 14525 transitions. [2025-01-08 23:47:15,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-01-08 23:47:15,970 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:15,970 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:47:15,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:47:15,971 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:15,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:15,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1024504357, now seen corresponding path program 1 times [2025-01-08 23:47:15,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:15,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810907734] [2025-01-08 23:47:15,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:15,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:15,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-01-08 23:47:15,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-01-08 23:47:15,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:15,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:16,088 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-08 23:47:16,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:16,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810907734] [2025-01-08 23:47:16,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810907734] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:16,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:16,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:16,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592038289] [2025-01-08 23:47:16,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:16,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:16,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:16,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:16,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:16,090 INFO L87 Difference]: Start difference. First operand 12020 states and 14525 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:18,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:18,632 INFO L93 Difference]: Finished difference Result 27793 states and 34552 transitions. [2025-01-08 23:47:18,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:18,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 237 [2025-01-08 23:47:18,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:18,653 INFO L225 Difference]: With dead ends: 27793 [2025-01-08 23:47:18,653 INFO L226 Difference]: Without dead ends: 16526 [2025-01-08 23:47:18,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:18,661 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 761 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2218 mSolverCounterSat, 626 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 2844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 626 IncrementalHoareTripleChecker+Valid, 2218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:18,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 495 Invalid, 2844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [626 Valid, 2218 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:47:18,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16526 states. [2025-01-08 23:47:18,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16526 to 12020. [2025-01-08 23:47:18,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12020 states, 12019 states have (on average 1.2085032032615026) internal successors, (14525), 12019 states have internal predecessors, (14525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:18,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12020 states to 12020 states and 14525 transitions. [2025-01-08 23:47:18,775 INFO L78 Accepts]: Start accepts. Automaton has 12020 states and 14525 transitions. Word has length 237 [2025-01-08 23:47:18,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:18,775 INFO L471 AbstractCegarLoop]: Abstraction has 12020 states and 14525 transitions. [2025-01-08 23:47:18,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:18,775 INFO L276 IsEmpty]: Start isEmpty. Operand 12020 states and 14525 transitions. [2025-01-08 23:47:18,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-01-08 23:47:18,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:18,777 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:47:18,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:47:18,777 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:18,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:18,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1802165169, now seen corresponding path program 1 times [2025-01-08 23:47:18,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:18,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376745553] [2025-01-08 23:47:18,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:18,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:18,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-01-08 23:47:18,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-01-08 23:47:18,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:18,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:18,896 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-01-08 23:47:18,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:18,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376745553] [2025-01-08 23:47:18,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376745553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:18,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:18,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:47:18,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587714075] [2025-01-08 23:47:18,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:18,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:18,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:18,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:18,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:18,898 INFO L87 Difference]: Start difference. First operand 12020 states and 14525 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:21,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:21,290 INFO L93 Difference]: Finished difference Result 31550 states and 38845 transitions. [2025-01-08 23:47:21,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:21,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2025-01-08 23:47:21,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:21,322 INFO L225 Difference]: With dead ends: 31550 [2025-01-08 23:47:21,322 INFO L226 Difference]: Without dead ends: 20283 [2025-01-08 23:47:21,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:21,334 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 848 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:21,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 312 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:47:21,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20283 states. [2025-01-08 23:47:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20283 to 18779. [2025-01-08 23:47:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18779 states, 18778 states have (on average 1.1888380019171372) internal successors, (22324), 18778 states have internal predecessors, (22324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18779 states to 18779 states and 22324 transitions. [2025-01-08 23:47:21,593 INFO L78 Accepts]: Start accepts. Automaton has 18779 states and 22324 transitions. Word has length 238 [2025-01-08 23:47:21,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:21,593 INFO L471 AbstractCegarLoop]: Abstraction has 18779 states and 22324 transitions. [2025-01-08 23:47:21,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 18779 states and 22324 transitions. [2025-01-08 23:47:21,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-01-08 23:47:21,596 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:21,597 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2025-01-08 23:47:21,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:47:21,597 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:21,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:21,597 INFO L85 PathProgramCache]: Analyzing trace with hash 476740892, now seen corresponding path program 1 times [2025-01-08 23:47:21,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:21,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290661792] [2025-01-08 23:47:21,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:21,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:21,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-08 23:47:21,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-08 23:47:21,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:21,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:21,740 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:47:21,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:21,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290661792] [2025-01-08 23:47:21,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290661792] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:21,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:21,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:21,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072337102] [2025-01-08 23:47:21,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:21,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:21,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:21,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:21,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:21,743 INFO L87 Difference]: Start difference. First operand 18779 states and 22324 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:24,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:24,134 INFO L93 Difference]: Finished difference Result 43564 states and 53013 transitions. [2025-01-08 23:47:24,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:24,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 324 [2025-01-08 23:47:24,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:24,207 INFO L225 Difference]: With dead ends: 43564 [2025-01-08 23:47:24,211 INFO L226 Difference]: Without dead ends: 25538 [2025-01-08 23:47:24,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:24,247 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 792 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 834 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 2909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 834 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:24,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 238 Invalid, 2909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [834 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 23:47:24,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25538 states. [2025-01-08 23:47:24,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25538 to 24787. [2025-01-08 23:47:24,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24787 states, 24786 states have (on average 1.1906721536351166) internal successors, (29512), 24786 states have internal predecessors, (29512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:24,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24787 states to 24787 states and 29512 transitions. [2025-01-08 23:47:24,456 INFO L78 Accepts]: Start accepts. Automaton has 24787 states and 29512 transitions. Word has length 324 [2025-01-08 23:47:24,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:24,456 INFO L471 AbstractCegarLoop]: Abstraction has 24787 states and 29512 transitions. [2025-01-08 23:47:24,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:24,456 INFO L276 IsEmpty]: Start isEmpty. Operand 24787 states and 29512 transitions. [2025-01-08 23:47:24,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-01-08 23:47:24,460 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:24,461 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2025-01-08 23:47:24,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:47:24,461 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:24,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:24,461 INFO L85 PathProgramCache]: Analyzing trace with hash -854175422, now seen corresponding path program 1 times [2025-01-08 23:47:24,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:24,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140353152] [2025-01-08 23:47:24,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:24,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:24,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-01-08 23:47:24,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-01-08 23:47:24,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:24,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:24,805 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-08 23:47:24,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:24,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140353152] [2025-01-08 23:47:24,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140353152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:24,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:24,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:24,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728508192] [2025-01-08 23:47:24,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:24,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:24,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:24,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:24,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:24,807 INFO L87 Difference]: Start difference. First operand 24787 states and 29512 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:27,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:27,482 INFO L93 Difference]: Finished difference Result 62339 states and 74047 transitions. [2025-01-08 23:47:27,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:27,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 352 [2025-01-08 23:47:27,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:27,535 INFO L225 Difference]: With dead ends: 62339 [2025-01-08 23:47:27,536 INFO L226 Difference]: Without dead ends: 38305 [2025-01-08 23:47:27,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:27,559 INFO L435 NwaCegarLoop]: 1239 mSDtfsCounter, 635 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2625 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 2958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 2625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:27,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1247 Invalid, 2958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 2625 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:47:27,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38305 states. [2025-01-08 23:47:27,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38305 to 36052. [2025-01-08 23:47:27,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36052 states, 36051 states have (on average 1.178940944772683) internal successors, (42502), 36051 states have internal predecessors, (42502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:27,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36052 states to 36052 states and 42502 transitions. [2025-01-08 23:47:27,879 INFO L78 Accepts]: Start accepts. Automaton has 36052 states and 42502 transitions. Word has length 352 [2025-01-08 23:47:27,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:27,879 INFO L471 AbstractCegarLoop]: Abstraction has 36052 states and 42502 transitions. [2025-01-08 23:47:27,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:27,880 INFO L276 IsEmpty]: Start isEmpty. Operand 36052 states and 42502 transitions. [2025-01-08 23:47:27,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-01-08 23:47:27,883 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:27,883 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2025-01-08 23:47:27,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:47:27,883 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:27,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:27,886 INFO L85 PathProgramCache]: Analyzing trace with hash 561954508, now seen corresponding path program 1 times [2025-01-08 23:47:27,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:27,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118035257] [2025-01-08 23:47:27,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:27,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:27,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-01-08 23:47:27,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-01-08 23:47:27,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:27,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-01-08 23:47:28,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:28,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118035257] [2025-01-08 23:47:28,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118035257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:28,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:28,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:28,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312582588] [2025-01-08 23:47:28,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:28,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:28,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:28,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:28,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:28,164 INFO L87 Difference]: Start difference. First operand 36052 states and 42502 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:30,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:30,806 INFO L93 Difference]: Finished difference Result 104395 states and 123608 transitions. [2025-01-08 23:47:30,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:30,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 356 [2025-01-08 23:47:30,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:30,895 INFO L225 Difference]: With dead ends: 104395 [2025-01-08 23:47:30,895 INFO L226 Difference]: Without dead ends: 64590 [2025-01-08 23:47:30,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:30,927 INFO L435 NwaCegarLoop]: 1307 mSDtfsCounter, 768 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 620 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 2854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 620 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:30,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 1315 Invalid, 2854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [620 Valid, 2234 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:47:30,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64590 states. [2025-01-08 23:47:31,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64590 to 54076. [2025-01-08 23:47:31,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54076 states, 54075 states have (on average 1.1409893666204345) internal successors, (61699), 54075 states have internal predecessors, (61699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:31,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54076 states to 54076 states and 61699 transitions. [2025-01-08 23:47:31,890 INFO L78 Accepts]: Start accepts. Automaton has 54076 states and 61699 transitions. Word has length 356 [2025-01-08 23:47:31,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:31,894 INFO L471 AbstractCegarLoop]: Abstraction has 54076 states and 61699 transitions. [2025-01-08 23:47:31,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:31,895 INFO L276 IsEmpty]: Start isEmpty. Operand 54076 states and 61699 transitions. [2025-01-08 23:47:31,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-01-08 23:47:31,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:31,898 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:47:31,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:47:31,903 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:31,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:31,903 INFO L85 PathProgramCache]: Analyzing trace with hash -490287793, now seen corresponding path program 1 times [2025-01-08 23:47:31,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:31,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586637549] [2025-01-08 23:47:31,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:31,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:31,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-01-08 23:47:31,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-01-08 23:47:31,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:31,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:47:32,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:32,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586637549] [2025-01-08 23:47:32,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586637549] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:32,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:32,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:32,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3742650] [2025-01-08 23:47:32,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:32,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:32,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:32,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:32,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:32,238 INFO L87 Difference]: Start difference. First operand 54076 states and 61699 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:34,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:34,865 INFO L93 Difference]: Finished difference Result 136688 states and 157854 transitions. [2025-01-08 23:47:34,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:34,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 363 [2025-01-08 23:47:34,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:34,961 INFO L225 Difference]: With dead ends: 136688 [2025-01-08 23:47:34,962 INFO L226 Difference]: Without dead ends: 83365 [2025-01-08 23:47:34,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:34,994 INFO L435 NwaCegarLoop]: 1228 mSDtfsCounter, 720 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2115 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 2811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:34,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 1236 Invalid, 2811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2115 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:47:35,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83365 states. [2025-01-08 23:47:35,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83365 to 77357. [2025-01-08 23:47:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77357 states, 77356 states have (on average 1.1244247375769172) internal successors, (86981), 77356 states have internal predecessors, (86981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:35,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77357 states to 77357 states and 86981 transitions. [2025-01-08 23:47:35,907 INFO L78 Accepts]: Start accepts. Automaton has 77357 states and 86981 transitions. Word has length 363 [2025-01-08 23:47:35,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:35,907 INFO L471 AbstractCegarLoop]: Abstraction has 77357 states and 86981 transitions. [2025-01-08 23:47:35,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:35,907 INFO L276 IsEmpty]: Start isEmpty. Operand 77357 states and 86981 transitions. [2025-01-08 23:47:36,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-01-08 23:47:36,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:36,056 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:47:36,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:47:36,056 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:36,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:36,057 INFO L85 PathProgramCache]: Analyzing trace with hash 218877392, now seen corresponding path program 1 times [2025-01-08 23:47:36,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:36,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383790883] [2025-01-08 23:47:36,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:36,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:36,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-01-08 23:47:36,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-01-08 23:47:36,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:36,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:36,307 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-01-08 23:47:36,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:36,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383790883] [2025-01-08 23:47:36,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383790883] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:36,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:36,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:36,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104425973] [2025-01-08 23:47:36,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:36,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:36,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:36,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:36,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:36,308 INFO L87 Difference]: Start difference. First operand 77357 states and 86981 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:39,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:39,228 INFO L93 Difference]: Finished difference Result 188507 states and 213665 transitions. [2025-01-08 23:47:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:39,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 460 [2025-01-08 23:47:39,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:39,356 INFO L225 Difference]: With dead ends: 188507 [2025-01-08 23:47:39,356 INFO L226 Difference]: Without dead ends: 111903 [2025-01-08 23:47:39,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:39,416 INFO L435 NwaCegarLoop]: 1288 mSDtfsCounter, 741 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2328 mSolverCounterSat, 522 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 2850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 522 IncrementalHoareTripleChecker+Valid, 2328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:39,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 1296 Invalid, 2850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [522 Valid, 2328 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:47:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111903 states. [2025-01-08 23:47:40,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111903 to 99887. [2025-01-08 23:47:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99887 states, 99886 states have (on average 1.1136896061510122) internal successors, (111242), 99886 states have internal predecessors, (111242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:41,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99887 states to 99887 states and 111242 transitions. [2025-01-08 23:47:41,051 INFO L78 Accepts]: Start accepts. Automaton has 99887 states and 111242 transitions. Word has length 460 [2025-01-08 23:47:41,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:41,051 INFO L471 AbstractCegarLoop]: Abstraction has 99887 states and 111242 transitions. [2025-01-08 23:47:41,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 99887 states and 111242 transitions. [2025-01-08 23:47:41,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 736 [2025-01-08 23:47:41,085 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:41,085 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:47:41,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:47:41,085 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:41,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:41,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1641902515, now seen corresponding path program 1 times [2025-01-08 23:47:41,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:41,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475634695] [2025-01-08 23:47:41,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:41,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:41,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 735 statements into 1 equivalence classes. [2025-01-08 23:47:41,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 735 of 735 statements. [2025-01-08 23:47:41,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:41,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:41,627 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2025-01-08 23:47:41,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:41,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475634695] [2025-01-08 23:47:41,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475634695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:41,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:41,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:41,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145635973] [2025-01-08 23:47:41,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:41,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:41,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:41,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:41,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:41,630 INFO L87 Difference]: Start difference. First operand 99887 states and 111242 transitions. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:44,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:44,231 INFO L93 Difference]: Finished difference Result 223804 states and 251654 transitions. [2025-01-08 23:47:44,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:44,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 735 [2025-01-08 23:47:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:44,399 INFO L225 Difference]: With dead ends: 223804 [2025-01-08 23:47:44,399 INFO L226 Difference]: Without dead ends: 124670 [2025-01-08 23:47:44,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:44,454 INFO L435 NwaCegarLoop]: 1389 mSDtfsCounter, 649 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:44,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1397 Invalid, 2731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [589 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 23:47:44,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124670 states. [2025-01-08 23:47:45,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124670 to 118662. [2025-01-08 23:47:45,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118662 states, 118661 states have (on average 1.1008840309790073) internal successors, (130632), 118661 states have internal predecessors, (130632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:45,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118662 states to 118662 states and 130632 transitions. [2025-01-08 23:47:45,656 INFO L78 Accepts]: Start accepts. Automaton has 118662 states and 130632 transitions. Word has length 735 [2025-01-08 23:47:45,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:45,656 INFO L471 AbstractCegarLoop]: Abstraction has 118662 states and 130632 transitions. [2025-01-08 23:47:45,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:45,657 INFO L276 IsEmpty]: Start isEmpty. Operand 118662 states and 130632 transitions. [2025-01-08 23:47:45,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 755 [2025-01-08 23:47:45,684 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:45,684 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:47:45,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:47:45,684 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:45,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:45,685 INFO L85 PathProgramCache]: Analyzing trace with hash -855712383, now seen corresponding path program 1 times [2025-01-08 23:47:45,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:45,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022763146] [2025-01-08 23:47:45,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:45,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:45,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 754 statements into 1 equivalence classes. [2025-01-08 23:47:45,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 754 of 754 statements. [2025-01-08 23:47:45,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:45,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 640 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-01-08 23:47:46,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:46,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022763146] [2025-01-08 23:47:46,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022763146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:46,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:46,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:46,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045660211] [2025-01-08 23:47:46,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:46,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:46,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:46,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:46,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:46,305 INFO L87 Difference]: Start difference. First operand 118662 states and 130632 transitions. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:49,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:49,252 INFO L93 Difference]: Finished difference Result 236571 states and 260506 transitions. [2025-01-08 23:47:49,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:49,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 754 [2025-01-08 23:47:49,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:49,389 INFO L225 Difference]: With dead ends: 236571 [2025-01-08 23:47:49,390 INFO L226 Difference]: Without dead ends: 118662 [2025-01-08 23:47:49,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:49,456 INFO L435 NwaCegarLoop]: 1262 mSDtfsCounter, 405 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2228 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 2662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 2228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:49,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1270 Invalid, 2662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 2228 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:47:49,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118662 states. [2025-01-08 23:47:50,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118662 to 116409. [2025-01-08 23:47:50,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116409 states, 116408 states have (on average 1.0679248848876366) internal successors, (124315), 116408 states have internal predecessors, (124315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:50,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116409 states to 116409 states and 124315 transitions. [2025-01-08 23:47:50,885 INFO L78 Accepts]: Start accepts. Automaton has 116409 states and 124315 transitions. Word has length 754 [2025-01-08 23:47:50,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:50,885 INFO L471 AbstractCegarLoop]: Abstraction has 116409 states and 124315 transitions. [2025-01-08 23:47:50,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:50,886 INFO L276 IsEmpty]: Start isEmpty. Operand 116409 states and 124315 transitions. [2025-01-08 23:47:50,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 770 [2025-01-08 23:47:50,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:50,909 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:47:50,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:47:50,909 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:50,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:50,909 INFO L85 PathProgramCache]: Analyzing trace with hash -444728162, now seen corresponding path program 1 times [2025-01-08 23:47:50,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:50,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721955071] [2025-01-08 23:47:50,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:50,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:50,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 769 statements into 1 equivalence classes. [2025-01-08 23:47:50,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 769 of 769 statements. [2025-01-08 23:47:50,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:50,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:51,316 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 655 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-01-08 23:47:51,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:51,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721955071] [2025-01-08 23:47:51,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721955071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:51,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:51,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:47:51,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945313114] [2025-01-08 23:47:51,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:51,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:51,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:51,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:51,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:51,319 INFO L87 Difference]: Start difference. First operand 116409 states and 124315 transitions. Second operand has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:54,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:54,075 INFO L93 Difference]: Finished difference Result 249338 states and 265639 transitions. [2025-01-08 23:47:54,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:54,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 769 [2025-01-08 23:47:54,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:54,236 INFO L225 Difference]: With dead ends: 249338 [2025-01-08 23:47:54,236 INFO L226 Difference]: Without dead ends: 133682 [2025-01-08 23:47:54,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:54,288 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 449 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2256 mSolverCounterSat, 672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 2928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 672 IncrementalHoareTripleChecker+Valid, 2256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:54,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 193 Invalid, 2928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [672 Valid, 2256 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 23:47:54,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133682 states. [2025-01-08 23:47:55,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133682 to 117160. [2025-01-08 23:47:55,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117160 states, 117159 states have (on average 1.0643996619977978) internal successors, (124704), 117159 states have internal predecessors, (124704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117160 states to 117160 states and 124704 transitions. [2025-01-08 23:47:55,657 INFO L78 Accepts]: Start accepts. Automaton has 117160 states and 124704 transitions. Word has length 769 [2025-01-08 23:47:55,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:55,659 INFO L471 AbstractCegarLoop]: Abstraction has 117160 states and 124704 transitions. [2025-01-08 23:47:55,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:47:55,659 INFO L276 IsEmpty]: Start isEmpty. Operand 117160 states and 124704 transitions. [2025-01-08 23:47:55,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 770 [2025-01-08 23:47:55,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:55,695 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:47:55,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:47:55,696 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:55,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:55,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1888934238, now seen corresponding path program 1 times [2025-01-08 23:47:55,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:55,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71426469] [2025-01-08 23:47:55,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:55,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:55,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 769 statements into 1 equivalence classes. [2025-01-08 23:47:55,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 769 of 769 statements. [2025-01-08 23:47:55,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:55,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:57,423 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 445 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:47:57,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:57,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71426469] [2025-01-08 23:47:57,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71426469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:57,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:57,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-08 23:47:57,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584283103] [2025-01-08 23:47:57,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:57,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-08 23:47:57,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:57,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-08 23:47:57,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-08 23:47:57,425 INFO L87 Difference]: Start difference. First operand 117160 states and 124704 transitions. Second operand has 8 states, 8 states have (on average 96.125) internal successors, (769), 7 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:48:03,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:48:03,891 INFO L93 Difference]: Finished difference Result 248589 states and 264211 transitions. [2025-01-08 23:48:03,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 23:48:03,891 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 96.125) internal successors, (769), 7 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 769 [2025-01-08 23:48:03,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:48:04,016 INFO L225 Difference]: With dead ends: 248589 [2025-01-08 23:48:04,016 INFO L226 Difference]: Without dead ends: 132182 [2025-01-08 23:48:04,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:48:04,076 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 2900 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 10004 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2900 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 10449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 10004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:48:04,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2900 Valid, 648 Invalid, 10449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 10004 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2025-01-08 23:48:04,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132182 states. [2025-01-08 23:48:05,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132182 to 119413. [2025-01-08 23:48:05,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119413 states, 119412 states have (on average 1.0636368204200584) internal successors, (127011), 119412 states have internal predecessors, (127011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:48:05,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119413 states to 119413 states and 127011 transitions. [2025-01-08 23:48:05,543 INFO L78 Accepts]: Start accepts. Automaton has 119413 states and 127011 transitions. Word has length 769 [2025-01-08 23:48:05,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:48:05,544 INFO L471 AbstractCegarLoop]: Abstraction has 119413 states and 127011 transitions. [2025-01-08 23:48:05,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.125) internal successors, (769), 7 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:48:05,545 INFO L276 IsEmpty]: Start isEmpty. Operand 119413 states and 127011 transitions. [2025-01-08 23:48:05,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2025-01-08 23:48:05,592 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:48:05,592 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:48:05,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 23:48:05,593 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:48:05,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:48:05,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1844048519, now seen corresponding path program 1 times [2025-01-08 23:48:05,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:48:05,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589786630] [2025-01-08 23:48:05,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:48:05,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:48:05,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 792 statements into 1 equivalence classes. [2025-01-08 23:48:05,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 792 of 792 statements. [2025-01-08 23:48:05,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:48:05,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:48:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 415 proven. 54 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-08 23:48:06,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:48:06,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589786630] [2025-01-08 23:48:06,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589786630] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:48:06,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000580081] [2025-01-08 23:48:06,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:48:06,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:48:06,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:48:06,878 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-01-08 23:48:06,882 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-01-08 23:48:07,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 792 statements into 1 equivalence classes. [2025-01-08 23:48:07,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 792 of 792 statements. [2025-01-08 23:48:07,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:48:07,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:48:07,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:48:07,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:48:08,038 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-01-08 23:48:08,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:48:08,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000580081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:48:08,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:48:08,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:48:08,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722432904] [2025-01-08 23:48:08,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:48:08,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:48:08,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:48:08,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:48:08,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:48:08,040 INFO L87 Difference]: Start difference. First operand 119413 states and 127011 transitions. Second operand has 4 states, 4 states have (on average 127.5) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:48:12,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:48:12,790 INFO L93 Difference]: Finished difference Result 361990 states and 386472 transitions. [2025-01-08 23:48:12,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:48:12,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 127.5) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 792 [2025-01-08 23:48:12,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:48:13,065 INFO L225 Difference]: With dead ends: 361990 [2025-01-08 23:48:13,066 INFO L226 Difference]: Without dead ends: 243330 [2025-01-08 23:48:13,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 795 GetRequests, 790 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:48:13,128 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 1477 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 4826 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 5335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 4826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:48:13,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 66 Invalid, 5335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 4826 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-01-08 23:48:13,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243330 states. [2025-01-08 23:48:15,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243330 to 242577. [2025-01-08 23:48:15,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242577 states, 242576 states have (on average 1.0654763867818746) internal successors, (258459), 242576 states have internal predecessors, (258459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:48:15,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242577 states to 242577 states and 258459 transitions. [2025-01-08 23:48:15,695 INFO L78 Accepts]: Start accepts. Automaton has 242577 states and 258459 transitions. Word has length 792 [2025-01-08 23:48:15,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:48:15,696 INFO L471 AbstractCegarLoop]: Abstraction has 242577 states and 258459 transitions. [2025-01-08 23:48:15,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.5) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:48:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand 242577 states and 258459 transitions. [2025-01-08 23:48:15,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 878 [2025-01-08 23:48:15,758 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:48:15,758 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:48:15,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 23:48:15,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-08 23:48:15,962 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:48:15,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:48:15,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1573547504, now seen corresponding path program 1 times [2025-01-08 23:48:15,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:48:15,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301644056] [2025-01-08 23:48:15,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:48:15,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:48:16,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 877 statements into 1 equivalence classes. [2025-01-08 23:48:16,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 877 of 877 statements. [2025-01-08 23:48:16,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:48:16,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:48:16,970 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 379 proven. 0 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2025-01-08 23:48:16,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:48:16,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301644056] [2025-01-08 23:48:16,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301644056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:48:16,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:48:16,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:48:16,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026222807] [2025-01-08 23:48:16,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:48:16,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:48:16,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:48:16,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:48:16,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:48:16,972 INFO L87 Difference]: Start difference. First operand 242577 states and 258459 transitions. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:48:20,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:48:20,502 INFO L93 Difference]: Finished difference Result 536971 states and 570727 transitions. [2025-01-08 23:48:20,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:48:20,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 877 [2025-01-08 23:48:20,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted.