./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label24.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/Problem17_label24.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 b3ef3977d042afb4071915ce97341123de4af0d70f58c82feb0983ea770e3ba0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:12:03,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:12:03,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:12:03,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:12:03,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:12:03,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:12:03,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:12:03,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:12:03,124 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:12:03,124 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:12:03,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:12:03,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:12:03,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:12:03,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:12:03,125 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:12:03,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:12:03,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:12:03,125 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:12:03,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:12:03,125 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:12:03,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:12:03,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:12:03,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:12:03,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:12:03,126 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:12:03,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:12:03,126 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:12:03,126 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:12:03,126 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:12:03,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:12:03,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:12:03,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:12:03,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:12:03,127 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:12:03,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:12:03,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:12:03,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:12:03,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:12:03,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:12:03,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:12:03,127 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:12:03,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:12:03,128 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:12:03,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:12:03,128 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:12:03,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:12:03,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:12:03,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:12:03,128 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 -> b3ef3977d042afb4071915ce97341123de4af0d70f58c82feb0983ea770e3ba0 [2025-01-09 00:12:03,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:12:03,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:12:03,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:12:03,410 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:12:03,410 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:12:03,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label24.c [2025-01-09 00:12:04,682 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fcc9aac3d/5b469df1433b44ca8c488df119767f29/FLAG89fe70d32 [2025-01-09 00:12:05,221 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:12:05,222 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label24.c [2025-01-09 00:12:05,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fcc9aac3d/5b469df1433b44ca8c488df119767f29/FLAG89fe70d32 [2025-01-09 00:12:05,270 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fcc9aac3d/5b469df1433b44ca8c488df119767f29 [2025-01-09 00:12:05,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:12:05,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:12:05,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:12:05,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:12:05,281 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:12:05,282 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:12:05" (1/1) ... [2025-01-09 00:12:05,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79da9237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:05, skipping insertion in model container [2025-01-09 00:12:05,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:12:05" (1/1) ... [2025-01-09 00:12:05,364 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:12:05,582 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/Problem17_label24.c[8922,8935] [2025-01-09 00:12:06,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:12:06,054 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:12:06,109 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/Problem17_label24.c[8922,8935] [2025-01-09 00:12:06,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:12:06,325 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:12:06,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:06 WrapperNode [2025-01-09 00:12:06,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:12:06,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:12:06,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:12:06,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:12:06,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:06" (1/1) ... [2025-01-09 00:12:06,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:06" (1/1) ... [2025-01-09 00:12:06,638 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-01-09 00:12:06,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:12:06,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:12:06,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:12:06,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:12:06,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:06" (1/1) ... [2025-01-09 00:12:06,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:06" (1/1) ... [2025-01-09 00:12:06,785 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:06" (1/1) ... [2025-01-09 00:12:06,994 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-09 00:12:06,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:06" (1/1) ... [2025-01-09 00:12:06,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:06" (1/1) ... [2025-01-09 00:12:07,116 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:06" (1/1) ... [2025-01-09 00:12:07,136 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:06" (1/1) ... [2025-01-09 00:12:07,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:06" (1/1) ... [2025-01-09 00:12:07,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:06" (1/1) ... [2025-01-09 00:12:07,193 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:06" (1/1) ... [2025-01-09 00:12:07,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:12:07,272 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:12:07,273 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:12:07,273 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:12:07,274 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:06" (1/1) ... [2025-01-09 00:12:07,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:12:07,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:12:07,305 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-09 00:12:07,312 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-09 00:12:07,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:12:07,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:12:07,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:12:07,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:12:07,397 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:12:07,399 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:12:10,887 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-01-09 00:12:10,888 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:12:10,920 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:12:10,920 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:12:10,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:12:10 BoogieIcfgContainer [2025-01-09 00:12:10,921 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:12:10,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:12:10,923 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:12:10,930 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:12:10,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:12:05" (1/3) ... [2025-01-09 00:12:10,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a0a6cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:12:10, skipping insertion in model container [2025-01-09 00:12:10,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:06" (2/3) ... [2025-01-09 00:12:10,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a0a6cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:12:10, skipping insertion in model container [2025-01-09 00:12:10,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:12:10" (3/3) ... [2025-01-09 00:12:10,933 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label24.c [2025-01-09 00:12:10,946 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:12:10,948 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label24.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:12:11,015 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:12:11,028 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;@e469eb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:12:11,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:12:11,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 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-09 00:12:11,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 00:12:11,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:11,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:12:11,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:11,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:11,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1396635870, now seen corresponding path program 1 times [2025-01-09 00:12:11,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:11,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395343040] [2025-01-09 00:12:11,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:11,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:11,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 00:12:11,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 00:12:11,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:11,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:11,459 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-09 00:12:11,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:11,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395343040] [2025-01-09 00:12:11,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395343040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:11,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:11,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:12:11,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016770076] [2025-01-09 00:12:11,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:11,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:11,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:11,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:11,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:11,487 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 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 20.0) internal successors, (60), 2 states have internal predecessors, (60), 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-09 00:12:13,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:13,938 INFO L93 Difference]: Finished difference Result 1644 states and 3026 transitions. [2025-01-09 00:12:13,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:13,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 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 60 [2025-01-09 00:12:13,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:13,954 INFO L225 Difference]: With dead ends: 1644 [2025-01-09 00:12:13,954 INFO L226 Difference]: Without dead ends: 977 [2025-01-09 00:12:13,959 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-09 00:12:13,961 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 428 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:13,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 00:12:13,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-01-09 00:12:14,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2025-01-09 00:12:14,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 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-09 00:12:14,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2025-01-09 00:12:14,062 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 60 [2025-01-09 00:12:14,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:14,067 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2025-01-09 00:12:14,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 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-09 00:12:14,067 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2025-01-09 00:12:14,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 00:12:14,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:14,070 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:12:14,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:12:14,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:14,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:14,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1737744683, now seen corresponding path program 1 times [2025-01-09 00:12:14,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:14,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143102575] [2025-01-09 00:12:14,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:14,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:14,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 00:12:14,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 00:12:14,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:14,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:12:14,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:14,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143102575] [2025-01-09 00:12:14,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143102575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:14,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:14,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:12:14,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744648127] [2025-01-09 00:12:14,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:14,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:14,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:14,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:14,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:14,439 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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-09 00:12:16,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:16,441 INFO L93 Difference]: Finished difference Result 2846 states and 4429 transitions. [2025-01-09 00:12:16,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:16,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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 127 [2025-01-09 00:12:16,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:16,449 INFO L225 Difference]: With dead ends: 2846 [2025-01-09 00:12:16,450 INFO L226 Difference]: Without dead ends: 1877 [2025-01-09 00:12:16,451 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-09 00:12:16,452 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 444 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:16,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 241 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:12:16,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2025-01-09 00:12:16,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1854. [2025-01-09 00:12:16,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1853 states have (on average 1.489476524554776) internal successors, (2760), 1853 states have internal predecessors, (2760), 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-09 00:12:16,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2760 transitions. [2025-01-09 00:12:16,492 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2760 transitions. Word has length 127 [2025-01-09 00:12:16,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:16,492 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 2760 transitions. [2025-01-09 00:12:16,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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-09 00:12:16,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2760 transitions. [2025-01-09 00:12:16,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 00:12:16,496 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:16,497 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:12:16,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:12:16,497 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:16,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:16,501 INFO L85 PathProgramCache]: Analyzing trace with hash 975958574, now seen corresponding path program 1 times [2025-01-09 00:12:16,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:16,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638401679] [2025-01-09 00:12:16,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:16,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:16,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 00:12:16,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 00:12:16,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:16,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:16,768 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:12:16,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:16,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638401679] [2025-01-09 00:12:16,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638401679] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:16,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:16,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:12:16,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281652604] [2025-01-09 00:12:16,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:16,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:16,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:16,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:16,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:16,771 INFO L87 Difference]: Start difference. First operand 1854 states and 2760 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-09 00:12:18,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:18,789 INFO L93 Difference]: Finished difference Result 4574 states and 7028 transitions. [2025-01-09 00:12:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:18,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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 130 [2025-01-09 00:12:18,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:18,801 INFO L225 Difference]: With dead ends: 4574 [2025-01-09 00:12:18,801 INFO L226 Difference]: Without dead ends: 2722 [2025-01-09 00:12:18,803 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-09 00:12:18,804 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 432 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:18,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 919 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:12:18,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2025-01-09 00:12:18,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 2720. [2025-01-09 00:12:18,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2720 states, 2719 states have (on average 1.4133872747333578) internal successors, (3843), 2719 states have internal predecessors, (3843), 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-09 00:12:18,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2720 states and 3843 transitions. [2025-01-09 00:12:18,847 INFO L78 Accepts]: Start accepts. Automaton has 2720 states and 3843 transitions. Word has length 130 [2025-01-09 00:12:18,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:18,847 INFO L471 AbstractCegarLoop]: Abstraction has 2720 states and 3843 transitions. [2025-01-09 00:12:18,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-09 00:12:18,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 3843 transitions. [2025-01-09 00:12:18,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 00:12:18,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:18,850 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:12:18,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:12:18,850 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:18,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:18,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1636378281, now seen corresponding path program 1 times [2025-01-09 00:12:18,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:18,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833558018] [2025-01-09 00:12:18,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:18,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:18,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 00:12:18,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 00:12:18,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:18,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:19,019 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:12:19,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:19,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833558018] [2025-01-09 00:12:19,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833558018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:19,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:19,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:12:19,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577855713] [2025-01-09 00:12:19,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:19,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:19,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:19,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:19,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:19,021 INFO L87 Difference]: Start difference. First operand 2720 states and 3843 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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-09 00:12:21,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:21,110 INFO L93 Difference]: Finished difference Result 8021 states and 11343 transitions. [2025-01-09 00:12:21,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:21,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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 132 [2025-01-09 00:12:21,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:21,130 INFO L225 Difference]: With dead ends: 8021 [2025-01-09 00:12:21,131 INFO L226 Difference]: Without dead ends: 5303 [2025-01-09 00:12:21,135 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-09 00:12:21,137 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 400 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:21,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 579 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:12:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5303 states. [2025-01-09 00:12:21,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5303 to 5299. [2025-01-09 00:12:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5299 states, 5298 states have (on average 1.2655719139297847) internal successors, (6705), 5298 states have internal predecessors, (6705), 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-09 00:12:21,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 6705 transitions. [2025-01-09 00:12:21,226 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 6705 transitions. Word has length 132 [2025-01-09 00:12:21,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:21,227 INFO L471 AbstractCegarLoop]: Abstraction has 5299 states and 6705 transitions. [2025-01-09 00:12:21,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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-09 00:12:21,227 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 6705 transitions. [2025-01-09 00:12:21,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 00:12:21,230 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:21,230 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:12:21,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:12:21,231 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:21,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:21,231 INFO L85 PathProgramCache]: Analyzing trace with hash 559935460, now seen corresponding path program 1 times [2025-01-09 00:12:21,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:21,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779646802] [2025-01-09 00:12:21,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:21,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:21,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 00:12:21,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 00:12:21,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:21,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:21,429 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-09 00:12:21,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:21,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779646802] [2025-01-09 00:12:21,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779646802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:21,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:21,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:12:21,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060214741] [2025-01-09 00:12:21,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:21,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:21,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:21,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:21,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:21,433 INFO L87 Difference]: Start difference. First operand 5299 states and 6705 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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-09 00:12:23,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:23,082 INFO L93 Difference]: Finished difference Result 15280 states and 19390 transitions. [2025-01-09 00:12:23,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:23,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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 199 [2025-01-09 00:12:23,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:23,105 INFO L225 Difference]: With dead ends: 15280 [2025-01-09 00:12:23,105 INFO L226 Difference]: Without dead ends: 8704 [2025-01-09 00:12:23,114 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-09 00:12:23,115 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:23,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:12:23,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8704 states. [2025-01-09 00:12:23,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8704 to 7004. [2025-01-09 00:12:23,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7004 states, 7003 states have (on average 1.1552191917749537) internal successors, (8090), 7003 states have internal predecessors, (8090), 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-09 00:12:23,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7004 states to 7004 states and 8090 transitions. [2025-01-09 00:12:23,272 INFO L78 Accepts]: Start accepts. Automaton has 7004 states and 8090 transitions. Word has length 199 [2025-01-09 00:12:23,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:23,272 INFO L471 AbstractCegarLoop]: Abstraction has 7004 states and 8090 transitions. [2025-01-09 00:12:23,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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-09 00:12:23,273 INFO L276 IsEmpty]: Start isEmpty. Operand 7004 states and 8090 transitions. [2025-01-09 00:12:23,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 00:12:23,277 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:23,278 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:12:23,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:12:23,278 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:23,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:23,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1051447621, now seen corresponding path program 1 times [2025-01-09 00:12:23,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:23,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745326845] [2025-01-09 00:12:23,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:23,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:23,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 00:12:23,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 00:12:23,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:23,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:12:23,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:23,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745326845] [2025-01-09 00:12:23,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745326845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:23,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:23,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:12:23,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798125620] [2025-01-09 00:12:23,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:23,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:23,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:23,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:23,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:23,496 INFO L87 Difference]: Start difference. First operand 7004 states and 8090 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-09 00:12:25,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:25,267 INFO L93 Difference]: Finished difference Result 17838 states and 20943 transitions. [2025-01-09 00:12:25,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:25,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 212 [2025-01-09 00:12:25,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:25,295 INFO L225 Difference]: With dead ends: 17838 [2025-01-09 00:12:25,295 INFO L226 Difference]: Without dead ends: 10836 [2025-01-09 00:12:25,301 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-09 00:12:25,301 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:25,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 779 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:12:25,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10836 states. [2025-01-09 00:12:25,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10836 to 10411. [2025-01-09 00:12:25,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10411 states, 10410 states have (on average 1.1472622478386167) internal successors, (11943), 10410 states have internal predecessors, (11943), 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-09 00:12:25,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10411 states to 10411 states and 11943 transitions. [2025-01-09 00:12:25,449 INFO L78 Accepts]: Start accepts. Automaton has 10411 states and 11943 transitions. Word has length 212 [2025-01-09 00:12:25,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:25,449 INFO L471 AbstractCegarLoop]: Abstraction has 10411 states and 11943 transitions. [2025-01-09 00:12:25,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-09 00:12:25,450 INFO L276 IsEmpty]: Start isEmpty. Operand 10411 states and 11943 transitions. [2025-01-09 00:12:25,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-09 00:12:25,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:25,452 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:12:25,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:12:25,452 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:25,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:25,453 INFO L85 PathProgramCache]: Analyzing trace with hash -2094104416, now seen corresponding path program 1 times [2025-01-09 00:12:25,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:25,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694727518] [2025-01-09 00:12:25,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:25,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:25,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 00:12:25,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 00:12:25,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:25,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-09 00:12:25,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:25,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694727518] [2025-01-09 00:12:25,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694727518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:25,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:25,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:12:25,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269966325] [2025-01-09 00:12:25,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:25,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:25,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:25,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:25,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:25,648 INFO L87 Difference]: Start difference. First operand 10411 states and 11943 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 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-09 00:12:27,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:27,425 INFO L93 Difference]: Finished difference Result 25914 states and 29669 transitions. [2025-01-09 00:12:27,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:27,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 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 214 [2025-01-09 00:12:27,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:27,452 INFO L225 Difference]: With dead ends: 25914 [2025-01-09 00:12:27,452 INFO L226 Difference]: Without dead ends: 15504 [2025-01-09 00:12:27,463 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-09 00:12:27,464 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 393 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:27,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 439 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 1213 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:12:27,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15504 states. [2025-01-09 00:12:27,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15504 to 10377. [2025-01-09 00:12:27,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10377 states, 10376 states have (on average 1.1462027756360833) internal successors, (11893), 10376 states have internal predecessors, (11893), 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-09 00:12:27,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10377 states to 10377 states and 11893 transitions. [2025-01-09 00:12:27,597 INFO L78 Accepts]: Start accepts. Automaton has 10377 states and 11893 transitions. Word has length 214 [2025-01-09 00:12:27,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:27,598 INFO L471 AbstractCegarLoop]: Abstraction has 10377 states and 11893 transitions. [2025-01-09 00:12:27,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 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-09 00:12:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 10377 states and 11893 transitions. [2025-01-09 00:12:27,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-01-09 00:12:27,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:27,603 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:12:27,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:12:27,603 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:27,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:27,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1616634147, now seen corresponding path program 1 times [2025-01-09 00:12:27,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:27,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765294637] [2025-01-09 00:12:27,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:27,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:27,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-01-09 00:12:27,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-01-09 00:12:27,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:27,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:27,864 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-01-09 00:12:27,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:27,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765294637] [2025-01-09 00:12:27,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765294637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:27,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:27,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:12:27,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419985455] [2025-01-09 00:12:27,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:27,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:27,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:27,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:27,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:27,866 INFO L87 Difference]: Start difference. First operand 10377 states and 11893 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-09 00:12:29,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:29,530 INFO L93 Difference]: Finished difference Result 25412 states and 29358 transitions. [2025-01-09 00:12:29,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:29,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 292 [2025-01-09 00:12:29,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:29,550 INFO L225 Difference]: With dead ends: 25412 [2025-01-09 00:12:29,551 INFO L226 Difference]: Without dead ends: 13762 [2025-01-09 00:12:29,562 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-09 00:12:29,562 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 386 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:29,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 839 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:12:29,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13762 states. [2025-01-09 00:12:29,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13762 to 13762. [2025-01-09 00:12:29,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13762 states, 13761 states have (on average 1.1135818617833007) internal successors, (15324), 13761 states have internal predecessors, (15324), 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-09 00:12:29,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13762 states to 13762 states and 15324 transitions. [2025-01-09 00:12:29,709 INFO L78 Accepts]: Start accepts. Automaton has 13762 states and 15324 transitions. Word has length 292 [2025-01-09 00:12:29,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:29,711 INFO L471 AbstractCegarLoop]: Abstraction has 13762 states and 15324 transitions. [2025-01-09 00:12:29,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-09 00:12:29,711 INFO L276 IsEmpty]: Start isEmpty. Operand 13762 states and 15324 transitions. [2025-01-09 00:12:29,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-01-09 00:12:29,719 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:29,719 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, 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, 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] [2025-01-09 00:12:29,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:12:29,720 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:29,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:29,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1142075910, now seen corresponding path program 1 times [2025-01-09 00:12:29,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:29,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13325179] [2025-01-09 00:12:29,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:29,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:29,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-01-09 00:12:29,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-01-09 00:12:29,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:29,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:29,955 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-01-09 00:12:29,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:29,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13325179] [2025-01-09 00:12:29,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13325179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:29,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:29,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:12:29,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472180904] [2025-01-09 00:12:29,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:29,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:29,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:29,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:29,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:29,957 INFO L87 Difference]: Start difference. First operand 13762 states and 15324 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-09 00:12:31,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:31,661 INFO L93 Difference]: Finished difference Result 32201 states and 36142 transitions. [2025-01-09 00:12:31,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:31,662 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 332 [2025-01-09 00:12:31,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:31,694 INFO L225 Difference]: With dead ends: 32201 [2025-01-09 00:12:31,694 INFO L226 Difference]: Without dead ends: 18441 [2025-01-09 00:12:31,704 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-09 00:12:31,707 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 428 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:31,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 363 Invalid, 1488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1213 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:12:31,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18441 states. [2025-01-09 00:12:31,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18441 to 17161. [2025-01-09 00:12:32,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17161 states, 17160 states have (on average 1.1152097902097902) internal successors, (19137), 17160 states have internal predecessors, (19137), 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-09 00:12:32,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17161 states to 17161 states and 19137 transitions. [2025-01-09 00:12:32,040 INFO L78 Accepts]: Start accepts. Automaton has 17161 states and 19137 transitions. Word has length 332 [2025-01-09 00:12:32,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:32,041 INFO L471 AbstractCegarLoop]: Abstraction has 17161 states and 19137 transitions. [2025-01-09 00:12:32,041 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-09 00:12:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand 17161 states and 19137 transitions. [2025-01-09 00:12:32,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-01-09 00:12:32,049 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:32,049 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:12:32,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:12:32,051 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:32,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:32,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1041001370, now seen corresponding path program 1 times [2025-01-09 00:12:32,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:32,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448293733] [2025-01-09 00:12:32,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:32,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:32,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-01-09 00:12:32,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-01-09 00:12:32,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:32,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:32,408 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:12:32,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:32,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448293733] [2025-01-09 00:12:32,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448293733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:32,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:32,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:12:32,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951263108] [2025-01-09 00:12:32,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:32,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:32,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:32,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:32,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:32,411 INFO L87 Difference]: Start difference. First operand 17161 states and 19137 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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-09 00:12:34,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:34,061 INFO L93 Difference]: Finished difference Result 41166 states and 46080 transitions. [2025-01-09 00:12:34,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:34,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 349 [2025-01-09 00:12:34,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:34,105 INFO L225 Difference]: With dead ends: 41166 [2025-01-09 00:12:34,105 INFO L226 Difference]: Without dead ends: 24007 [2025-01-09 00:12:34,125 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-09 00:12:34,126 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 442 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:34,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 788 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1349 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:12:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24007 states. [2025-01-09 00:12:34,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24007 to 23132. [2025-01-09 00:12:34,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23132 states, 23131 states have (on average 1.1133543729194588) internal successors, (25753), 23131 states have internal predecessors, (25753), 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-09 00:12:34,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23132 states to 23132 states and 25753 transitions. [2025-01-09 00:12:34,474 INFO L78 Accepts]: Start accepts. Automaton has 23132 states and 25753 transitions. Word has length 349 [2025-01-09 00:12:34,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:34,475 INFO L471 AbstractCegarLoop]: Abstraction has 23132 states and 25753 transitions. [2025-01-09 00:12:34,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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-09 00:12:34,475 INFO L276 IsEmpty]: Start isEmpty. Operand 23132 states and 25753 transitions. [2025-01-09 00:12:34,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2025-01-09 00:12:34,485 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:34,486 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:12:34,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:12:34,486 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:34,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:34,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1269021325, now seen corresponding path program 1 times [2025-01-09 00:12:34,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:34,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471558939] [2025-01-09 00:12:34,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:34,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:34,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes. [2025-01-09 00:12:34,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements. [2025-01-09 00:12:34,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:34,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:12:34,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:34,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471558939] [2025-01-09 00:12:34,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471558939] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:34,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:34,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:12:34,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458622811] [2025-01-09 00:12:34,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:34,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:12:34,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:34,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:12:34,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:12:34,914 INFO L87 Difference]: Start difference. First operand 23132 states and 25753 transitions. Second operand has 4 states, 4 states have (on average 99.75) internal successors, (399), 3 states have internal predecessors, (399), 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-09 00:12:37,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:37,276 INFO L93 Difference]: Finished difference Result 53958 states and 60035 transitions. [2025-01-09 00:12:37,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:12:37,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 99.75) internal successors, (399), 3 states have internal predecessors, (399), 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 399 [2025-01-09 00:12:37,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:37,313 INFO L225 Difference]: With dead ends: 53958 [2025-01-09 00:12:37,313 INFO L226 Difference]: Without dead ends: 29978 [2025-01-09 00:12:37,335 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-09 00:12:37,336 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 523 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2861 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 3087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 2861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:37,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 408 Invalid, 3087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 2861 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 00:12:37,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29978 states. [2025-01-09 00:12:37,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29978 to 24411. [2025-01-09 00:12:37,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24411 states, 24410 states have (on average 1.1104465383039739) internal successors, (27106), 24410 states have internal predecessors, (27106), 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-09 00:12:37,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24411 states to 24411 states and 27106 transitions. [2025-01-09 00:12:37,598 INFO L78 Accepts]: Start accepts. Automaton has 24411 states and 27106 transitions. Word has length 399 [2025-01-09 00:12:37,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:37,599 INFO L471 AbstractCegarLoop]: Abstraction has 24411 states and 27106 transitions. [2025-01-09 00:12:37,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.75) internal successors, (399), 3 states have internal predecessors, (399), 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-09 00:12:37,599 INFO L276 IsEmpty]: Start isEmpty. Operand 24411 states and 27106 transitions. [2025-01-09 00:12:37,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-01-09 00:12:37,608 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:37,608 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, 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, 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] [2025-01-09 00:12:37,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:12:37,609 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:37,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:37,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1088882129, now seen corresponding path program 1 times [2025-01-09 00:12:37,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:37,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502098508] [2025-01-09 00:12:37,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:37,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:37,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-01-09 00:12:37,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-01-09 00:12:37,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:37,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2025-01-09 00:12:37,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:37,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502098508] [2025-01-09 00:12:37,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502098508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:37,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:37,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:12:37,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651906324] [2025-01-09 00:12:37,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:37,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:37,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:37,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:37,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:37,876 INFO L87 Difference]: Start difference. First operand 24411 states and 27106 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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-09 00:12:39,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:39,399 INFO L93 Difference]: Finished difference Result 54791 states and 60794 transitions. [2025-01-09 00:12:39,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:39,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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 428 [2025-01-09 00:12:39,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:39,433 INFO L225 Difference]: With dead ends: 54791 [2025-01-09 00:12:39,433 INFO L226 Difference]: Without dead ends: 29527 [2025-01-09 00:12:39,453 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-09 00:12:39,454 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 393 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:39,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 863 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:12:39,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29527 states. [2025-01-09 00:12:39,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29527 to 28660. [2025-01-09 00:12:39,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28660 states, 28659 states have (on average 1.1015038905753864) internal successors, (31568), 28659 states have internal predecessors, (31568), 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-09 00:12:39,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28660 states to 28660 states and 31568 transitions. [2025-01-09 00:12:39,799 INFO L78 Accepts]: Start accepts. Automaton has 28660 states and 31568 transitions. Word has length 428 [2025-01-09 00:12:39,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:39,800 INFO L471 AbstractCegarLoop]: Abstraction has 28660 states and 31568 transitions. [2025-01-09 00:12:39,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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-09 00:12:39,800 INFO L276 IsEmpty]: Start isEmpty. Operand 28660 states and 31568 transitions. [2025-01-09 00:12:39,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-01-09 00:12:39,810 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:39,810 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:12:39,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:12:39,811 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:39,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:39,811 INFO L85 PathProgramCache]: Analyzing trace with hash 443962009, now seen corresponding path program 1 times [2025-01-09 00:12:39,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:39,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131816168] [2025-01-09 00:12:39,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:39,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:39,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-01-09 00:12:39,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-01-09 00:12:39,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:39,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 139 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:12:40,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:40,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131816168] [2025-01-09 00:12:40,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131816168] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:12:40,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918522557] [2025-01-09 00:12:40,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:40,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:12:40,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:12:40,772 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-09 00:12:40,773 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-09 00:12:40,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-01-09 00:12:40,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-01-09 00:12:40,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:40,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:40,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:12:40,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:12:41,563 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 115 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:12:41,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:12:42,138 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:12:42,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918522557] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:12:42,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:12:42,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 8 [2025-01-09 00:12:42,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434237294] [2025-01-09 00:12:42,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:42,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:12:42,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:42,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:12:42,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:12:42,142 INFO L87 Difference]: Start difference. First operand 28660 states and 31568 transitions. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 3 states have internal predecessors, (446), 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-09 00:12:44,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:44,710 INFO L93 Difference]: Finished difference Result 74790 states and 83063 transitions. [2025-01-09 00:12:44,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:12:44,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 3 states have internal predecessors, (446), 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 446 [2025-01-09 00:12:44,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:44,761 INFO L225 Difference]: With dead ends: 74790 [2025-01-09 00:12:44,761 INFO L226 Difference]: Without dead ends: 45700 [2025-01-09 00:12:44,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 894 GetRequests, 888 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:12:44,777 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 638 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 2841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 577 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:44,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 186 Invalid, 2841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 00:12:44,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45700 states. [2025-01-09 00:12:45,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45700 to 45271. [2025-01-09 00:12:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45271 states, 45270 states have (on average 1.0996907444223547) internal successors, (49783), 45270 states have internal predecessors, (49783), 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-09 00:12:45,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45271 states to 45271 states and 49783 transitions. [2025-01-09 00:12:45,195 INFO L78 Accepts]: Start accepts. Automaton has 45271 states and 49783 transitions. Word has length 446 [2025-01-09 00:12:45,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:45,195 INFO L471 AbstractCegarLoop]: Abstraction has 45271 states and 49783 transitions. [2025-01-09 00:12:45,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 3 states have internal predecessors, (446), 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-09 00:12:45,196 INFO L276 IsEmpty]: Start isEmpty. Operand 45271 states and 49783 transitions. [2025-01-09 00:12:45,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-01-09 00:12:45,206 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:45,206 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, 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, 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] [2025-01-09 00:12:45,213 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-09 00:12:45,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 00:12:45,407 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:45,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:45,407 INFO L85 PathProgramCache]: Analyzing trace with hash 776094448, now seen corresponding path program 1 times [2025-01-09 00:12:45,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:45,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984245354] [2025-01-09 00:12:45,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:45,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:45,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-01-09 00:12:45,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-01-09 00:12:45,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:45,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:45,606 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-01-09 00:12:45,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:45,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984245354] [2025-01-09 00:12:45,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984245354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:45,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:45,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:12:45,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697765970] [2025-01-09 00:12:45,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:45,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:45,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:45,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:45,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:45,608 INFO L87 Difference]: Start difference. First operand 45271 states and 49783 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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-09 00:12:47,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:47,183 INFO L93 Difference]: Finished difference Result 101594 states and 112249 transitions. [2025-01-09 00:12:47,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:47,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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 464 [2025-01-09 00:12:47,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:47,260 INFO L225 Difference]: With dead ends: 101594 [2025-01-09 00:12:47,260 INFO L226 Difference]: Without dead ends: 53335 [2025-01-09 00:12:47,295 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-09 00:12:47,295 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 494 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:47,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 723 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:12:47,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53335 states. [2025-01-09 00:12:47,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53335 to 53325. [2025-01-09 00:12:47,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53325 states, 53324 states have (on average 1.0885342434926113) internal successors, (58045), 53324 states have internal predecessors, (58045), 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-09 00:12:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53325 states to 53325 states and 58045 transitions. [2025-01-09 00:12:48,034 INFO L78 Accepts]: Start accepts. Automaton has 53325 states and 58045 transitions. Word has length 464 [2025-01-09 00:12:48,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:48,035 INFO L471 AbstractCegarLoop]: Abstraction has 53325 states and 58045 transitions. [2025-01-09 00:12:48,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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-09 00:12:48,035 INFO L276 IsEmpty]: Start isEmpty. Operand 53325 states and 58045 transitions. [2025-01-09 00:12:48,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2025-01-09 00:12:48,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:48,046 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:12:48,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:12:48,046 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:48,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:48,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1416290584, now seen corresponding path program 1 times [2025-01-09 00:12:48,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:48,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835183562] [2025-01-09 00:12:48,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:48,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:48,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 513 statements into 1 equivalence classes. [2025-01-09 00:12:48,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 513 of 513 statements. [2025-01-09 00:12:48,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:48,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:49,968 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 373 proven. 82 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-01-09 00:12:49,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:49,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835183562] [2025-01-09 00:12:49,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835183562] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:12:49,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126665522] [2025-01-09 00:12:49,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:49,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:12:49,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:12:49,973 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-09 00:12:49,976 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-09 00:12:50,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 513 statements into 1 equivalence classes. [2025-01-09 00:12:50,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 513 of 513 statements. [2025-01-09 00:12:50,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:50,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:50,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 00:12:50,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:12:50,766 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 373 proven. 82 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-01-09 00:12:50,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:12:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 373 proven. 82 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-01-09 00:12:52,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126665522] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:12:52,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:12:52,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-01-09 00:12:52,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24799609] [2025-01-09 00:12:52,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:12:52,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 00:12:52,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:52,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 00:12:52,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:12:52,107 INFO L87 Difference]: Start difference. First operand 53325 states and 58045 transitions. Second operand has 10 states, 10 states have (on average 97.6) internal successors, (976), 9 states have internal predecessors, (976), 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-09 00:12:57,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:57,650 INFO L93 Difference]: Finished difference Result 129247 states and 141262 transitions. [2025-01-09 00:12:57,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 00:12:57,650 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 97.6) internal successors, (976), 9 states have internal predecessors, (976), 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 513 [2025-01-09 00:12:57,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:57,728 INFO L225 Difference]: With dead ends: 129247 [2025-01-09 00:12:57,728 INFO L226 Difference]: Without dead ends: 75924 [2025-01-09 00:12:57,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1032 GetRequests, 1021 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-01-09 00:12:57,763 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 2687 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 7712 mSolverCounterSat, 888 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2687 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 8600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 888 IncrementalHoareTripleChecker+Valid, 7712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:57,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2687 Valid, 504 Invalid, 8600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [888 Valid, 7712 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-01-09 00:12:57,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75924 states. [2025-01-09 00:12:58,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75924 to 70770. [2025-01-09 00:12:58,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70770 states, 70769 states have (on average 1.089120942785683) internal successors, (77076), 70769 states have internal predecessors, (77076), 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-09 00:12:58,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70770 states to 70770 states and 77076 transitions. [2025-01-09 00:12:58,433 INFO L78 Accepts]: Start accepts. Automaton has 70770 states and 77076 transitions. Word has length 513 [2025-01-09 00:12:58,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:58,433 INFO L471 AbstractCegarLoop]: Abstraction has 70770 states and 77076 transitions. [2025-01-09 00:12:58,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 97.6) internal successors, (976), 9 states have internal predecessors, (976), 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-09 00:12:58,433 INFO L276 IsEmpty]: Start isEmpty. Operand 70770 states and 77076 transitions. [2025-01-09 00:12:58,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-01-09 00:12:58,443 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:58,444 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:12:58,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 00:12:58,644 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,SelfDestructingSolverStorable14 [2025-01-09 00:12:58,644 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:58,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:58,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1277116625, now seen corresponding path program 1 times [2025-01-09 00:12:58,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:58,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93088860] [2025-01-09 00:12:58,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:58,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:58,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-01-09 00:12:58,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-01-09 00:12:58,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:58,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 658 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-01-09 00:12:59,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:59,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93088860] [2025-01-09 00:12:59,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93088860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:59,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:59,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:12:59,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135010831] [2025-01-09 00:12:59,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:59,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:59,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:59,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:59,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:59,505 INFO L87 Difference]: Start difference. First operand 70770 states and 77076 transitions. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 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-09 00:13:01,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:01,067 INFO L93 Difference]: Finished difference Result 156452 states and 169974 transitions. [2025-01-09 00:13:01,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:01,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 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 576 [2025-01-09 00:13:01,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:01,151 INFO L225 Difference]: With dead ends: 156452 [2025-01-09 00:13:01,152 INFO L226 Difference]: Without dead ends: 85259 [2025-01-09 00:13:01,196 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-09 00:13:01,197 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 308 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:01,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 697 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:13:01,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85259 states. [2025-01-09 00:13:02,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85259 to 81831. [2025-01-09 00:13:02,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81831 states, 81830 states have (on average 1.0828302578516436) internal successors, (88608), 81830 states have internal predecessors, (88608), 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-09 00:13:02,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81831 states to 81831 states and 88608 transitions. [2025-01-09 00:13:02,423 INFO L78 Accepts]: Start accepts. Automaton has 81831 states and 88608 transitions. Word has length 576 [2025-01-09 00:13:02,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:02,424 INFO L471 AbstractCegarLoop]: Abstraction has 81831 states and 88608 transitions. [2025-01-09 00:13:02,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 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-09 00:13:02,424 INFO L276 IsEmpty]: Start isEmpty. Operand 81831 states and 88608 transitions. [2025-01-09 00:13:02,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2025-01-09 00:13:02,434 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:02,434 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 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-09 00:13:02,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:13:02,434 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:02,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:02,435 INFO L85 PathProgramCache]: Analyzing trace with hash 450360975, now seen corresponding path program 1 times [2025-01-09 00:13:02,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:02,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516272540] [2025-01-09 00:13:02,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:02,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:02,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-01-09 00:13:02,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-01-09 00:13:02,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:02,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:03,078 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 758 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-01-09 00:13:03,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:03,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516272540] [2025-01-09 00:13:03,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516272540] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:03,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:03,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:13:03,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129560248] [2025-01-09 00:13:03,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:03,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:13:03,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:03,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:13:03,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:13:03,080 INFO L87 Difference]: Start difference. First operand 81831 states and 88608 transitions. Second operand has 4 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 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-09 00:13:05,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:05,284 INFO L93 Difference]: Finished difference Result 162810 states and 176359 transitions. [2025-01-09 00:13:05,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:13:05,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 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 595 [2025-01-09 00:13:05,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:05,363 INFO L225 Difference]: With dead ends: 162810 [2025-01-09 00:13:05,363 INFO L226 Difference]: Without dead ends: 81831 [2025-01-09 00:13:05,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:13:05,395 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 723 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 2580 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 2767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 2580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:05,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 763 Invalid, 2767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 2580 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:13:05,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81831 states. [2025-01-09 00:13:06,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81831 to 81831. [2025-01-09 00:13:06,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81831 states, 81830 states have (on average 1.0822925577416596) internal successors, (88564), 81830 states have internal predecessors, (88564), 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-09 00:13:06,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81831 states to 81831 states and 88564 transitions. [2025-01-09 00:13:06,544 INFO L78 Accepts]: Start accepts. Automaton has 81831 states and 88564 transitions. Word has length 595 [2025-01-09 00:13:06,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:06,544 INFO L471 AbstractCegarLoop]: Abstraction has 81831 states and 88564 transitions. [2025-01-09 00:13:06,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 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-09 00:13:06,544 INFO L276 IsEmpty]: Start isEmpty. Operand 81831 states and 88564 transitions. [2025-01-09 00:13:06,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2025-01-09 00:13:06,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:06,558 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:13:06,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:13:06,559 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:06,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:06,559 INFO L85 PathProgramCache]: Analyzing trace with hash -877444714, now seen corresponding path program 1 times [2025-01-09 00:13:06,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:06,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165227704] [2025-01-09 00:13:06,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:06,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:06,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-01-09 00:13:06,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-01-09 00:13:06,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:06,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:07,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 933 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2025-01-09 00:13:07,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:07,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165227704] [2025-01-09 00:13:07,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165227704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:07,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:07,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:07,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233823781] [2025-01-09 00:13:07,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:07,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:07,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:07,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:07,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:07,225 INFO L87 Difference]: Start difference. First operand 81831 states and 88564 transitions. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 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-09 00:13:08,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:08,870 INFO L93 Difference]: Finished difference Result 172183 states and 186577 transitions. [2025-01-09 00:13:08,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:08,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 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 687 [2025-01-09 00:13:08,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:08,977 INFO L225 Difference]: With dead ends: 172183 [2025-01-09 00:13:08,977 INFO L226 Difference]: Without dead ends: 91204 [2025-01-09 00:13:09,033 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-09 00:13:09,033 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 356 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:09,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 318 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:13:09,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91204 states. [2025-01-09 00:13:10,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91204 to 86085. [2025-01-09 00:13:10,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86085 states, 86084 states have (on average 1.0714999303006365) internal successors, (92239), 86084 states have internal predecessors, (92239), 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-09 00:13:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86085 states to 86085 states and 92239 transitions. [2025-01-09 00:13:10,247 INFO L78 Accepts]: Start accepts. Automaton has 86085 states and 92239 transitions. Word has length 687 [2025-01-09 00:13:10,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:10,248 INFO L471 AbstractCegarLoop]: Abstraction has 86085 states and 92239 transitions. [2025-01-09 00:13:10,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 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-09 00:13:10,248 INFO L276 IsEmpty]: Start isEmpty. Operand 86085 states and 92239 transitions. [2025-01-09 00:13:10,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2025-01-09 00:13:10,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:10,272 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 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, 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-09 00:13:10,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:13:10,272 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:10,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:10,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1435788892, now seen corresponding path program 1 times [2025-01-09 00:13:10,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:10,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618640322] [2025-01-09 00:13:10,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:10,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:10,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 784 statements into 1 equivalence classes. [2025-01-09 00:13:10,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 784 of 784 statements. [2025-01-09 00:13:10,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:10,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:11,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 1192 proven. 120 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-09 00:13:11,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:11,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618640322] [2025-01-09 00:13:11,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618640322] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:13:11,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675543064] [2025-01-09 00:13:11,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:11,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:13:11,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:13:11,995 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:13:11,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 00:13:12,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 784 statements into 1 equivalence classes. [2025-01-09 00:13:12,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 784 of 784 statements. [2025-01-09 00:13:12,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:12,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:12,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:13:12,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:13:13,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 1163 trivial. 0 not checked. [2025-01-09 00:13:13,133 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:13:13,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675543064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:13,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:13:13,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 00:13:13,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372557005] [2025-01-09 00:13:13,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:13,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:13,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:13,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:13,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:13:13,135 INFO L87 Difference]: Start difference. First operand 86085 states and 92239 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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-09 00:13:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:15,095 INFO L93 Difference]: Finished difference Result 180284 states and 193112 transitions. [2025-01-09 00:13:15,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:15,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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 784 [2025-01-09 00:13:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:15,186 INFO L225 Difference]: With dead ends: 180284 [2025-01-09 00:13:15,186 INFO L226 Difference]: Without dead ends: 94624 [2025-01-09 00:13:15,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 787 GetRequests, 784 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-09 00:13:15,222 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 437 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:15,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 657 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:13:15,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94624 states. [2025-01-09 00:13:15,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94624 to 83093.