./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label52.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label52.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 ddbc486d8837447489a9f02b29f9b0c86837a784a73349e3a6819c320282b326 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:49:05,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:49:05,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:49:05,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:49:05,965 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:49:05,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:49:05,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:49:05,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:49:05,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:49:05,990 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:49:05,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:49:05,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:49:05,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:49:05,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:49:05,991 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:49:05,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:49:05,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:49:05,991 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:49:05,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:49:05,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:49:05,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:49:05,992 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:49:05,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:49:05,992 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:49:05,992 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:49:05,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:49:05,992 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:49:05,992 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:49:05,993 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:49:05,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:49:05,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:49:05,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:49:05,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:49:05,993 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:49:05,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:49:05,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:49:05,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:49:05,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:49:05,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:49:05,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:49:05,994 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:49:05,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:49:05,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:49:05,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:49:05,995 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:49:05,995 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:49:05,995 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:49:05,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:49:05,995 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 -> ddbc486d8837447489a9f02b29f9b0c86837a784a73349e3a6819c320282b326 [2025-01-08 23:49:06,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:49:06,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:49:06,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:49:06,282 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:49:06,283 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:49:06,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label52.c [2025-01-08 23:49:07,616 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5661236d/d27470ddae344533be828d48292a7c56/FLAG28c49a426 [2025-01-08 23:49:08,167 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:49:08,168 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label52.c [2025-01-08 23:49:08,204 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5661236d/d27470ddae344533be828d48292a7c56/FLAG28c49a426 [2025-01-08 23:49:08,220 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5661236d/d27470ddae344533be828d48292a7c56 [2025-01-08 23:49:08,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:49:08,226 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:49:08,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:49:08,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:49:08,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:49:08,234 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:49:08" (1/1) ... [2025-01-08 23:49:08,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ba4e5ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:08, skipping insertion in model container [2025-01-08 23:49:08,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:49:08" (1/1) ... [2025-01-08 23:49:08,336 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:49:08,529 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label52.c[3994,4007] [2025-01-08 23:49:09,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:49:09,106 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:49:09,125 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label52.c[3994,4007] [2025-01-08 23:49:09,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:49:09,461 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:49:09,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:09 WrapperNode [2025-01-08 23:49:09,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:49:09,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:49:09,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:49:09,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:49:09,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:09" (1/1) ... [2025-01-08 23:49:09,530 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:09" (1/1) ... [2025-01-08 23:49:09,835 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-01-08 23:49:09,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:49:09,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:49:09,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:49:09,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:49:09,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:09" (1/1) ... [2025-01-08 23:49:09,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:09" (1/1) ... [2025-01-08 23:49:09,898 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:09" (1/1) ... [2025-01-08 23:49:10,051 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 23:49:10,051 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:09" (1/1) ... [2025-01-08 23:49:10,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:09" (1/1) ... [2025-01-08 23:49:10,177 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:09" (1/1) ... [2025-01-08 23:49:10,193 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:09" (1/1) ... [2025-01-08 23:49:10,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:09" (1/1) ... [2025-01-08 23:49:10,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:09" (1/1) ... [2025-01-08 23:49:10,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:09" (1/1) ... [2025-01-08 23:49:10,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:49:10,340 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:49:10,341 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:49:10,341 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:49:10,342 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:09" (1/1) ... [2025-01-08 23:49:10,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:49:10,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:49:10,370 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:49:10,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:49:10,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:49:10,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:49:10,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:49:10,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:49:10,461 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:49:10,463 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:49:14,755 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-01-08 23:49:14,756 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:49:14,795 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:49:14,798 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:49:14,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:49:14 BoogieIcfgContainer [2025-01-08 23:49:14,798 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:49:14,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:49:14,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:49:14,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:49:14,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:49:08" (1/3) ... [2025-01-08 23:49:14,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ec4a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:49:14, skipping insertion in model container [2025-01-08 23:49:14,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:49:09" (2/3) ... [2025-01-08 23:49:14,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ec4a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:49:14, skipping insertion in model container [2025-01-08 23:49:14,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:49:14" (3/3) ... [2025-01-08 23:49:14,810 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label52.c [2025-01-08 23:49:14,823 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:49:14,825 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label52.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:49:14,908 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:49:14,920 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;@d16f252, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:49:14,921 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:49:14,930 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:14,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-08 23:49:14,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:49:14,936 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] [2025-01-08 23:49:14,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:49:14,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:49:14,941 INFO L85 PathProgramCache]: Analyzing trace with hash -405900566, now seen corresponding path program 1 times [2025-01-08 23:49:14,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:49:14,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336362200] [2025-01-08 23:49:14,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:49:14,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:49:15,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-08 23:49:15,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-08 23:49:15,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:49:15,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:49:15,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:49:15,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:49:15,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336362200] [2025-01-08 23:49:15,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336362200] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:49:15,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:49:15,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:49:15,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008356608] [2025-01-08 23:49:15,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:49:15,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:49:15,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:49:15,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:49:15,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:49:15,275 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:18,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:49:18,829 INFO L93 Difference]: Finished difference Result 2388 states and 4626 transitions. [2025-01-08 23:49:18,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:49:18,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 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 30 [2025-01-08 23:49:18,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:49:18,855 INFO L225 Difference]: With dead ends: 2388 [2025-01-08 23:49:18,855 INFO L226 Difference]: Without dead ends: 1506 [2025-01-08 23:49:18,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:49:18,867 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 829 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 1058 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 3395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1058 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:49:18,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 102 Invalid, 3395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1058 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-08 23:49:18,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-01-08 23:49:18,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-01-08 23:49:18,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.869767441860465) internal successors, (2814), 1505 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:18,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2814 transitions. [2025-01-08 23:49:18,992 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2814 transitions. Word has length 30 [2025-01-08 23:49:18,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:49:18,992 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2814 transitions. [2025-01-08 23:49:18,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:18,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2814 transitions. [2025-01-08 23:49:18,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-08 23:49:18,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:49:18,997 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:49:18,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:49:18,998 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:49:18,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:49:18,999 INFO L85 PathProgramCache]: Analyzing trace with hash 2007332623, now seen corresponding path program 1 times [2025-01-08 23:49:18,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:49:18,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410014890] [2025-01-08 23:49:18,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:49:18,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:49:19,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-08 23:49:19,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-08 23:49:19,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:49:19,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:49:19,263 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:49:19,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:49:19,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410014890] [2025-01-08 23:49:19,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410014890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:49:19,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:49:19,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:49:19,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592432793] [2025-01-08 23:49:19,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:49:19,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:49:19,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:49:19,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:49:19,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:49:19,267 INFO L87 Difference]: Start difference. First operand 1506 states and 2814 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:22,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:49:22,242 INFO L93 Difference]: Finished difference Result 4514 states and 8438 transitions. [2025-01-08 23:49:22,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:49:22,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 103 [2025-01-08 23:49:22,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:49:22,257 INFO L225 Difference]: With dead ends: 4514 [2025-01-08 23:49:22,257 INFO L226 Difference]: Without dead ends: 3010 [2025-01-08 23:49:22,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:49:22,260 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 918 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:49:22,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 354 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:49:22,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2025-01-08 23:49:22,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 3008. [2025-01-08 23:49:22,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.6531426671100764) internal successors, (4971), 3007 states have internal predecessors, (4971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:22,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4971 transitions. [2025-01-08 23:49:22,380 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4971 transitions. Word has length 103 [2025-01-08 23:49:22,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:49:22,381 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4971 transitions. [2025-01-08 23:49:22,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:22,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4971 transitions. [2025-01-08 23:49:22,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-08 23:49:22,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:49:22,386 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:49:22,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:49:22,386 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:49:22,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:49:22,388 INFO L85 PathProgramCache]: Analyzing trace with hash -2015665105, now seen corresponding path program 1 times [2025-01-08 23:49:22,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:49:22,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531203263] [2025-01-08 23:49:22,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:49:22,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:49:22,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-08 23:49:22,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-08 23:49:22,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:49:22,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:49:22,841 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:49:22,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:49:22,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531203263] [2025-01-08 23:49:22,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531203263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:49:22,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:49:22,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:49:22,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560992924] [2025-01-08 23:49:22,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:49:22,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:49:22,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:49:22,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:49:22,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:49:22,843 INFO L87 Difference]: Start difference. First operand 3008 states and 4971 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:26,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:49:26,999 INFO L93 Difference]: Finished difference Result 8267 states and 13429 transitions. [2025-01-08 23:49:27,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:49:27,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 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 116 [2025-01-08 23:49:27,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:49:27,020 INFO L225 Difference]: With dead ends: 8267 [2025-01-08 23:49:27,020 INFO L226 Difference]: Without dead ends: 5261 [2025-01-08 23:49:27,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:49:27,024 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 2154 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 4998 mSolverCounterSat, 851 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2154 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 5849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 851 IncrementalHoareTripleChecker+Valid, 4998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:49:27,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2154 Valid, 353 Invalid, 5849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [851 Valid, 4998 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-08 23:49:27,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5261 states. [2025-01-08 23:49:27,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5261 to 5261. [2025-01-08 23:49:27,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5261 states, 5260 states have (on average 1.5102661596958176) internal successors, (7944), 5260 states have internal predecessors, (7944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5261 states to 5261 states and 7944 transitions. [2025-01-08 23:49:27,121 INFO L78 Accepts]: Start accepts. Automaton has 5261 states and 7944 transitions. Word has length 116 [2025-01-08 23:49:27,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:49:27,121 INFO L471 AbstractCegarLoop]: Abstraction has 5261 states and 7944 transitions. [2025-01-08 23:49:27,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:27,122 INFO L276 IsEmpty]: Start isEmpty. Operand 5261 states and 7944 transitions. [2025-01-08 23:49:27,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-08 23:49:27,124 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:49:27,124 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:49:27,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:49:27,124 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:49:27,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:49:27,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1963643429, now seen corresponding path program 1 times [2025-01-08 23:49:27,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:49:27,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115748696] [2025-01-08 23:49:27,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:49:27,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:49:27,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-08 23:49:27,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-08 23:49:27,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:49:27,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:49:27,590 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-08 23:49:27,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:49:27,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115748696] [2025-01-08 23:49:27,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115748696] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:49:27,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880850757] [2025-01-08 23:49:27,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:49:27,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:49:27,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:49:27,597 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:49:27,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 23:49:27,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-08 23:49:27,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-08 23:49:27,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:49:27,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:49:27,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:49:27,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:49:27,939 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-08 23:49:27,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:49:27,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880850757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:49:27,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:49:27,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-01-08 23:49:27,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315742434] [2025-01-08 23:49:27,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:49:27,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:49:27,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:49:27,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:49:27,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:49:27,941 INFO L87 Difference]: Start difference. First operand 5261 states and 7944 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:30,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:49:30,575 INFO L93 Difference]: Finished difference Result 14275 states and 22313 transitions. [2025-01-08 23:49:30,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:49:30,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2025-01-08 23:49:30,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:49:30,603 INFO L225 Difference]: With dead ends: 14275 [2025-01-08 23:49:30,603 INFO L226 Difference]: Without dead ends: 9767 [2025-01-08 23:49:30,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:49:30,610 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 621 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2456 mSolverCounterSat, 585 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 3041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 585 IncrementalHoareTripleChecker+Valid, 2456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:49:30,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 666 Invalid, 3041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [585 Valid, 2456 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:49:30,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2025-01-08 23:49:30,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9767. [2025-01-08 23:49:30,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.3878763055498669) internal successors, (13554), 9766 states have internal predecessors, (13554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:30,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 13554 transitions. [2025-01-08 23:49:30,775 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 13554 transitions. Word has length 171 [2025-01-08 23:49:30,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:49:30,776 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 13554 transitions. [2025-01-08 23:49:30,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:30,777 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 13554 transitions. [2025-01-08 23:49:30,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-08 23:49:30,780 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:49:30,780 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:49:30,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 23:49:30,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:49:30,984 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:49:30,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:49:30,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1090006777, now seen corresponding path program 1 times [2025-01-08 23:49:30,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:49:30,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798165150] [2025-01-08 23:49:30,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:49:30,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:49:31,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-08 23:49:31,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-08 23:49:31,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:49:31,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:49:31,372 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:49:31,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:49:31,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798165150] [2025-01-08 23:49:31,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798165150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:49:31,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:49:31,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:49:31,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848651820] [2025-01-08 23:49:31,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:49:31,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:49:31,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:49:31,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:49:31,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:49:31,374 INFO L87 Difference]: Start difference. First operand 9767 states and 13554 transitions. Second operand has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:34,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:49:34,468 INFO L93 Difference]: Finished difference Result 23324 states and 32177 transitions. [2025-01-08 23:49:34,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:49:34,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 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 187 [2025-01-08 23:49:34,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:49:34,506 INFO L225 Difference]: With dead ends: 23324 [2025-01-08 23:49:34,506 INFO L226 Difference]: Without dead ends: 14273 [2025-01-08 23:49:34,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:49:34,517 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 702 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 3500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:49:34,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 708 Invalid, 3500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-08 23:49:34,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14273 states. [2025-01-08 23:49:34,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14273 to 14273. [2025-01-08 23:49:34,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14273 states, 14272 states have (on average 1.2779568385650224) internal successors, (18239), 14272 states have internal predecessors, (18239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14273 states to 14273 states and 18239 transitions. [2025-01-08 23:49:34,746 INFO L78 Accepts]: Start accepts. Automaton has 14273 states and 18239 transitions. Word has length 187 [2025-01-08 23:49:34,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:49:34,746 INFO L471 AbstractCegarLoop]: Abstraction has 14273 states and 18239 transitions. [2025-01-08 23:49:34,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:34,750 INFO L276 IsEmpty]: Start isEmpty. Operand 14273 states and 18239 transitions. [2025-01-08 23:49:34,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-01-08 23:49:34,753 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:49:34,753 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:49:34,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:49:34,753 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:49:34,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:49:34,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1029615520, now seen corresponding path program 1 times [2025-01-08 23:49:34,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:49:34,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858289331] [2025-01-08 23:49:34,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:49:34,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:49:34,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-01-08 23:49:34,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-01-08 23:49:34,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:49:34,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:49:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-01-08 23:49:34,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:49:34,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858289331] [2025-01-08 23:49:34,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858289331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:49:34,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:49:34,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:49:34,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341263979] [2025-01-08 23:49:34,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:49:34,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:49:34,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:49:34,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:49:34,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:49:34,990 INFO L87 Difference]: Start difference. First operand 14273 states and 18239 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:37,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:49:37,800 INFO L93 Difference]: Finished difference Result 39058 states and 50794 transitions. [2025-01-08 23:49:37,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:49:37,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 261 [2025-01-08 23:49:37,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:49:37,911 INFO L225 Difference]: With dead ends: 39058 [2025-01-08 23:49:37,911 INFO L226 Difference]: Without dead ends: 25538 [2025-01-08 23:49:37,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:49:37,923 INFO L435 NwaCegarLoop]: 1283 mSDtfsCounter, 736 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 3017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:49:37,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1291 Invalid, 3017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:49:37,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25538 states. [2025-01-08 23:49:38,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25538 to 25538. [2025-01-08 23:49:38,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25538 states, 25537 states have (on average 1.2637741316521127) internal successors, (32273), 25537 states have internal predecessors, (32273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:38,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25538 states to 25538 states and 32273 transitions. [2025-01-08 23:49:38,241 INFO L78 Accepts]: Start accepts. Automaton has 25538 states and 32273 transitions. Word has length 261 [2025-01-08 23:49:38,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:49:38,241 INFO L471 AbstractCegarLoop]: Abstraction has 25538 states and 32273 transitions. [2025-01-08 23:49:38,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:38,242 INFO L276 IsEmpty]: Start isEmpty. Operand 25538 states and 32273 transitions. [2025-01-08 23:49:38,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-01-08 23:49:38,247 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:49:38,248 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:49:38,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:49:38,248 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:49:38,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:49:38,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1367061105, now seen corresponding path program 1 times [2025-01-08 23:49:38,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:49:38,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099207494] [2025-01-08 23:49:38,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:49:38,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:49:38,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-01-08 23:49:38,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-01-08 23:49:38,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:49:38,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:49:38,500 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-08 23:49:38,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:49:38,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099207494] [2025-01-08 23:49:38,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099207494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:49:38,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:49:38,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:49:38,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886186284] [2025-01-08 23:49:38,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:49:38,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:49:38,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:49:38,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:49:38,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:49:38,502 INFO L87 Difference]: Start difference. First operand 25538 states and 32273 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:41,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:49:41,572 INFO L93 Difference]: Finished difference Result 50323 states and 63788 transitions. [2025-01-08 23:49:41,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:49:41,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 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 319 [2025-01-08 23:49:41,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:49:41,624 INFO L225 Difference]: With dead ends: 50323 [2025-01-08 23:49:41,625 INFO L226 Difference]: Without dead ends: 25538 [2025-01-08 23:49:41,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:49:41,643 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 690 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 2696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:49:41,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 427 Invalid, 2696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:49:41,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25538 states. [2025-01-08 23:49:41,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25538 to 21783. [2025-01-08 23:49:41,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21783 states, 21782 states have (on average 1.1813883022679277) internal successors, (25733), 21782 states have internal predecessors, (25733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:41,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21783 states to 21783 states and 25733 transitions. [2025-01-08 23:49:41,906 INFO L78 Accepts]: Start accepts. Automaton has 21783 states and 25733 transitions. Word has length 319 [2025-01-08 23:49:41,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:49:41,907 INFO L471 AbstractCegarLoop]: Abstraction has 21783 states and 25733 transitions. [2025-01-08 23:49:41,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:41,907 INFO L276 IsEmpty]: Start isEmpty. Operand 21783 states and 25733 transitions. [2025-01-08 23:49:41,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-01-08 23:49:41,916 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:49:41,916 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:49:41,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:49:41,916 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:49:41,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:49:41,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1903579062, now seen corresponding path program 1 times [2025-01-08 23:49:41,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:49:41,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119035821] [2025-01-08 23:49:41,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:49:41,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:49:41,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-01-08 23:49:41,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-01-08 23:49:41,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:49:41,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:49:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 124 proven. 230 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-08 23:49:42,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:49:42,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119035821] [2025-01-08 23:49:42,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119035821] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:49:42,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978112340] [2025-01-08 23:49:42,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:49:42,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:49:42,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:49:42,623 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:49:42,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:49:42,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-01-08 23:49:42,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-01-08 23:49:42,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:49:42,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:49:42,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:49:42,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:49:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-01-08 23:49:43,066 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:49:43,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978112340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:49:43,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:49:43,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-08 23:49:43,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728187488] [2025-01-08 23:49:43,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:49:43,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:49:43,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:49:43,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:49:43,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:49:43,068 INFO L87 Difference]: Start difference. First operand 21783 states and 25733 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:45,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:49:45,808 INFO L93 Difference]: Finished difference Result 58584 states and 70114 transitions. [2025-01-08 23:49:45,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:49:45,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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 409 [2025-01-08 23:49:45,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:49:45,874 INFO L225 Difference]: With dead ends: 58584 [2025-01-08 23:49:45,875 INFO L226 Difference]: Without dead ends: 37554 [2025-01-08 23:49:45,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:49:45,890 INFO L435 NwaCegarLoop]: 937 mSDtfsCounter, 670 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2295 mSolverCounterSat, 758 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 3053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 758 IncrementalHoareTripleChecker+Valid, 2295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:49:45,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 944 Invalid, 3053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [758 Valid, 2295 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:49:45,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37554 states. [2025-01-08 23:49:46,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37554 to 37554. [2025-01-08 23:49:46,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37554 states, 37553 states have (on average 1.1895454424413496) internal successors, (44671), 37553 states have internal predecessors, (44671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:46,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37554 states to 37554 states and 44671 transitions. [2025-01-08 23:49:46,399 INFO L78 Accepts]: Start accepts. Automaton has 37554 states and 44671 transitions. Word has length 409 [2025-01-08 23:49:46,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:49:46,399 INFO L471 AbstractCegarLoop]: Abstraction has 37554 states and 44671 transitions. [2025-01-08 23:49:46,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:46,400 INFO L276 IsEmpty]: Start isEmpty. Operand 37554 states and 44671 transitions. [2025-01-08 23:49:46,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-01-08 23:49:46,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:49:46,409 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-08 23:49:46,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 23:49:46,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:49:46,610 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:49:46,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:49:46,611 INFO L85 PathProgramCache]: Analyzing trace with hash 449066594, now seen corresponding path program 1 times [2025-01-08 23:49:46,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:49:46,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439778095] [2025-01-08 23:49:46,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:49:46,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:49:46,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-01-08 23:49:46,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-01-08 23:49:46,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:49:46,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:49:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-08 23:49:46,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:49:46,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439778095] [2025-01-08 23:49:46,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439778095] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:49:46,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:49:46,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:49:46,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473648993] [2025-01-08 23:49:46,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:49:46,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:49:46,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:49:46,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:49:46,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:49:46,906 INFO L87 Difference]: Start difference. First operand 37554 states and 44671 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:49,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:49:49,509 INFO L93 Difference]: Finished difference Result 95383 states and 114715 transitions. [2025-01-08 23:49:49,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:49:49,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 410 [2025-01-08 23:49:49,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:49:49,671 INFO L225 Difference]: With dead ends: 95383 [2025-01-08 23:49:49,671 INFO L226 Difference]: Without dead ends: 58582 [2025-01-08 23:49:49,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:49:49,720 INFO L435 NwaCegarLoop]: 1219 mSDtfsCounter, 703 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:49:49,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 1227 Invalid, 2572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:49:49,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58582 states. [2025-01-08 23:49:50,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58582 to 57080. [2025-01-08 23:49:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57080 states, 57079 states have (on average 1.1586397799540986) internal successors, (66134), 57079 states have internal predecessors, (66134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:50,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57080 states to 57080 states and 66134 transitions. [2025-01-08 23:49:50,555 INFO L78 Accepts]: Start accepts. Automaton has 57080 states and 66134 transitions. Word has length 410 [2025-01-08 23:49:50,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:49:50,555 INFO L471 AbstractCegarLoop]: Abstraction has 57080 states and 66134 transitions. [2025-01-08 23:49:50,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:50,556 INFO L276 IsEmpty]: Start isEmpty. Operand 57080 states and 66134 transitions. [2025-01-08 23:49:50,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2025-01-08 23:49:50,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:49:50,563 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:49:50,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:49:50,564 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:49:50,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:49:50,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1682045246, now seen corresponding path program 1 times [2025-01-08 23:49:50,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:49:50,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205839291] [2025-01-08 23:49:50,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:49:50,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:49:50,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-01-08 23:49:50,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-01-08 23:49:50,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:49:50,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:49:50,799 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-01-08 23:49:50,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:49:50,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205839291] [2025-01-08 23:49:50,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205839291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:49:50,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:49:50,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:49:50,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389216079] [2025-01-08 23:49:50,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:49:50,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:49:50,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:49:50,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:49:50,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:49:50,801 INFO L87 Difference]: Start difference. First operand 57080 states and 66134 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:53,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:49:53,828 INFO L93 Difference]: Finished difference Result 149455 states and 174891 transitions. [2025-01-08 23:49:53,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:49:53,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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 416 [2025-01-08 23:49:53,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:49:53,915 INFO L225 Difference]: With dead ends: 149455 [2025-01-08 23:49:53,915 INFO L226 Difference]: Without dead ends: 93128 [2025-01-08 23:49:53,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:49:53,959 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 709 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2288 mSolverCounterSat, 643 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 2931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 643 IncrementalHoareTripleChecker+Valid, 2288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:49:53,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 534 Invalid, 2931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [643 Valid, 2288 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:49:54,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93128 states. [2025-01-08 23:49:54,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93128 to 87120. [2025-01-08 23:49:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87120 states, 87119 states have (on average 1.1410714080740136) internal successors, (99409), 87119 states have internal predecessors, (99409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:55,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87120 states to 87120 states and 99409 transitions. [2025-01-08 23:49:55,021 INFO L78 Accepts]: Start accepts. Automaton has 87120 states and 99409 transitions. Word has length 416 [2025-01-08 23:49:55,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:49:55,024 INFO L471 AbstractCegarLoop]: Abstraction has 87120 states and 99409 transitions. [2025-01-08 23:49:55,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:55,024 INFO L276 IsEmpty]: Start isEmpty. Operand 87120 states and 99409 transitions. [2025-01-08 23:49:55,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2025-01-08 23:49:55,031 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:49:55,031 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:49:55,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:49:55,032 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:49:55,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:49:55,033 INFO L85 PathProgramCache]: Analyzing trace with hash -39209347, now seen corresponding path program 1 times [2025-01-08 23:49:55,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:49:55,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650495342] [2025-01-08 23:49:55,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:49:55,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:49:55,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-01-08 23:49:55,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-01-08 23:49:55,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:49:55,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:49:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-01-08 23:49:55,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:49:55,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650495342] [2025-01-08 23:49:55,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650495342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:49:55,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:49:55,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:49:55,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371688557] [2025-01-08 23:49:55,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:49:55,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:49:55,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:49:55,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:49:55,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:49:55,479 INFO L87 Difference]: Start difference. First operand 87120 states and 99409 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:58,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:49:58,187 INFO L93 Difference]: Finished difference Result 177242 states and 201913 transitions. [2025-01-08 23:49:58,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:49:58,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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 418 [2025-01-08 23:49:58,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:49:58,290 INFO L225 Difference]: With dead ends: 177242 [2025-01-08 23:49:58,290 INFO L226 Difference]: Without dead ends: 90875 [2025-01-08 23:49:58,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:49:58,331 INFO L435 NwaCegarLoop]: 993 mSDtfsCounter, 761 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2084 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 2637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 2084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:49:58,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 1000 Invalid, 2637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 2084 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:49:58,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90875 states. [2025-01-08 23:49:59,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90875 to 81863. [2025-01-08 23:49:59,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81863 states, 81862 states have (on average 1.108182062495419) internal successors, (90718), 81862 states have internal predecessors, (90718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:59,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81863 states to 81863 states and 90718 transitions. [2025-01-08 23:49:59,655 INFO L78 Accepts]: Start accepts. Automaton has 81863 states and 90718 transitions. Word has length 418 [2025-01-08 23:49:59,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:49:59,656 INFO L471 AbstractCegarLoop]: Abstraction has 81863 states and 90718 transitions. [2025-01-08 23:49:59,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:49:59,656 INFO L276 IsEmpty]: Start isEmpty. Operand 81863 states and 90718 transitions. [2025-01-08 23:49:59,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-01-08 23:49:59,662 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:49:59,662 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:49:59,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:49:59,662 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:49:59,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:49:59,663 INFO L85 PathProgramCache]: Analyzing trace with hash 951391250, now seen corresponding path program 1 times [2025-01-08 23:49:59,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:49:59,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099536412] [2025-01-08 23:49:59,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:49:59,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:49:59,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-01-08 23:49:59,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-01-08 23:49:59,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:49:59,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:49:59,862 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2025-01-08 23:49:59,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:49:59,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099536412] [2025-01-08 23:49:59,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099536412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:49:59,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:49:59,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:49:59,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60854840] [2025-01-08 23:49:59,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:49:59,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:49:59,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:49:59,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:49:59,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:49:59,864 INFO L87 Difference]: Start difference. First operand 81863 states and 90718 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:02,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:02,561 INFO L93 Difference]: Finished difference Result 181748 states and 201973 transitions. [2025-01-08 23:50:02,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:02,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 442 [2025-01-08 23:50:02,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:02,685 INFO L225 Difference]: With dead ends: 181748 [2025-01-08 23:50:02,685 INFO L226 Difference]: Without dead ends: 100638 [2025-01-08 23:50:02,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:02,710 INFO L435 NwaCegarLoop]: 1109 mSDtfsCounter, 844 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2198 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 2198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:02,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1117 Invalid, 2685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 2198 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 23:50:02,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100638 states. [2025-01-08 23:50:03,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100638 to 96883. [2025-01-08 23:50:03,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96883 states, 96882 states have (on average 1.097758097479408) internal successors, (106353), 96882 states have internal predecessors, (106353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:03,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96883 states to 96883 states and 106353 transitions. [2025-01-08 23:50:03,765 INFO L78 Accepts]: Start accepts. Automaton has 96883 states and 106353 transitions. Word has length 442 [2025-01-08 23:50:03,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:03,766 INFO L471 AbstractCegarLoop]: Abstraction has 96883 states and 106353 transitions. [2025-01-08 23:50:03,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:03,766 INFO L276 IsEmpty]: Start isEmpty. Operand 96883 states and 106353 transitions. [2025-01-08 23:50:03,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-01-08 23:50:03,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:03,778 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:50:03,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:50:03,778 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:03,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:03,778 INFO L85 PathProgramCache]: Analyzing trace with hash 107708947, now seen corresponding path program 1 times [2025-01-08 23:50:03,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:03,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888894031] [2025-01-08 23:50:03,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:03,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:03,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-01-08 23:50:03,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-01-08 23:50:03,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:03,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:04,519 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 415 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-01-08 23:50:04,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:04,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888894031] [2025-01-08 23:50:04,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888894031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:04,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:04,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:04,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462145166] [2025-01-08 23:50:04,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:04,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:04,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:04,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:04,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:04,521 INFO L87 Difference]: Start difference. First operand 96883 states and 106353 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:07,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:07,136 INFO L93 Difference]: Finished difference Result 207282 states and 227112 transitions. [2025-01-08 23:50:07,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:07,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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 480 [2025-01-08 23:50:07,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:07,260 INFO L225 Difference]: With dead ends: 207282 [2025-01-08 23:50:07,260 INFO L226 Difference]: Without dead ends: 111152 [2025-01-08 23:50:07,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:07,314 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 733 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 572 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 2714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 572 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:07,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 937 Invalid, 2714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [572 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 23:50:07,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111152 states. [2025-01-08 23:50:08,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111152 to 102140. [2025-01-08 23:50:08,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102140 states, 102139 states have (on average 1.0943028617863892) internal successors, (111771), 102139 states have internal predecessors, (111771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:08,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102140 states to 102140 states and 111771 transitions. [2025-01-08 23:50:08,452 INFO L78 Accepts]: Start accepts. Automaton has 102140 states and 111771 transitions. Word has length 480 [2025-01-08 23:50:08,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:08,452 INFO L471 AbstractCegarLoop]: Abstraction has 102140 states and 111771 transitions. [2025-01-08 23:50:08,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:08,452 INFO L276 IsEmpty]: Start isEmpty. Operand 102140 states and 111771 transitions. [2025-01-08 23:50:08,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-01-08 23:50:08,462 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:08,462 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:50:08,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:50:08,462 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:08,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:08,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1951165920, now seen corresponding path program 1 times [2025-01-08 23:50:08,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:08,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139845076] [2025-01-08 23:50:08,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:08,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:08,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-01-08 23:50:08,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-01-08 23:50:08,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:08,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2025-01-08 23:50:09,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:09,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139845076] [2025-01-08 23:50:09,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139845076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:09,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:09,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:50:09,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632432710] [2025-01-08 23:50:09,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:09,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:50:09,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:09,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:50:09,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:09,026 INFO L87 Difference]: Start difference. First operand 102140 states and 111771 transitions. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:11,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:50:11,856 INFO L93 Difference]: Finished difference Result 232816 states and 255659 transitions. [2025-01-08 23:50:11,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:50:11,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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 567 [2025-01-08 23:50:11,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:50:11,991 INFO L225 Difference]: With dead ends: 232816 [2025-01-08 23:50:11,991 INFO L226 Difference]: Without dead ends: 131429 [2025-01-08 23:50:12,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:50:12,039 INFO L435 NwaCegarLoop]: 1223 mSDtfsCounter, 704 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2112 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 2591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 2112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:50:12,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1231 Invalid, 2591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 2112 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:50:12,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131429 states. [2025-01-08 23:50:13,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131429 to 127674. [2025-01-08 23:50:13,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127674 states, 127673 states have (on average 1.0866353888449398) internal successors, (138734), 127673 states have internal predecessors, (138734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127674 states to 127674 states and 138734 transitions. [2025-01-08 23:50:13,400 INFO L78 Accepts]: Start accepts. Automaton has 127674 states and 138734 transitions. Word has length 567 [2025-01-08 23:50:13,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:50:13,400 INFO L471 AbstractCegarLoop]: Abstraction has 127674 states and 138734 transitions. [2025-01-08 23:50:13,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:50:13,401 INFO L276 IsEmpty]: Start isEmpty. Operand 127674 states and 138734 transitions. [2025-01-08 23:50:13,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2025-01-08 23:50:13,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:50:13,455 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:50:13,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:50:13,456 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:50:13,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:50:13,457 INFO L85 PathProgramCache]: Analyzing trace with hash -116005583, now seen corresponding path program 1 times [2025-01-08 23:50:13,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:50:13,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816102685] [2025-01-08 23:50:13,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:50:13,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:50:13,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1035 statements into 1 equivalence classes. [2025-01-08 23:50:13,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1035 of 1035 statements. [2025-01-08 23:50:13,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:50:13,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:50:15,530 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2025-01-08 23:50:15,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:50:15,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816102685] [2025-01-08 23:50:15,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816102685] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:50:15,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:50:15,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 23:50:15,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888912165] [2025-01-08 23:50:15,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:50:15,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 23:50:15,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:50:15,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 23:50:15,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:50:15,533 INFO L87 Difference]: Start difference. First operand 127674 states and 138734 transitions. Second operand has 6 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 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)