./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label47.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/Problem13_label47.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 9caa4030530e2e9671468e08c95e91bac3f6959ea80b1f57c09b5d22d183ce56 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:55:06,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:55:06,308 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:55:06,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:55:06,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:55:06,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:55:06,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:55:06,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:55:06,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:55:06,338 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:55:06,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:55:06,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:55:06,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:55:06,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:55:06,340 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:55:06,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:55:06,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:55:06,340 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:55:06,340 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:55:06,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:55:06,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:55:06,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:55:06,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:55:06,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:55:06,341 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:55:06,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:55:06,341 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:55:06,341 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:55:06,341 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:55:06,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:55:06,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:55:06,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:55:06,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:55:06,342 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:55:06,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:55:06,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:55:06,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:55:06,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:55:06,343 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:55:06,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:55:06,343 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:55:06,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:55:06,343 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:55:06,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:55:06,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:55:06,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:55:06,344 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:55:06,344 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:55:06,344 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 -> 9caa4030530e2e9671468e08c95e91bac3f6959ea80b1f57c09b5d22d183ce56 [2025-01-08 23:55:06,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:55:06,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:55:06,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:55:06,607 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:55:06,608 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:55:06,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label47.c [2025-01-08 23:55:07,881 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f10f516ec/1f5afc5e537d494fa0ebe127f3ac19e8/FLAG0b28d7fd7 [2025-01-08 23:55:08,526 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:55:08,527 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label47.c [2025-01-08 23:55:08,565 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f10f516ec/1f5afc5e537d494fa0ebe127f3ac19e8/FLAG0b28d7fd7 [2025-01-08 23:55:08,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f10f516ec/1f5afc5e537d494fa0ebe127f3ac19e8 [2025-01-08 23:55:08,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:55:08,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:55:08,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:55:08,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:55:08,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:55:08,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:55:08" (1/1) ... [2025-01-08 23:55:08,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab80c3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:08, skipping insertion in model container [2025-01-08 23:55:08,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:55:08" (1/1) ... [2025-01-08 23:55:09,073 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:55:09,328 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/Problem13_label47.c[6189,6202] [2025-01-08 23:55:10,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:55:10,081 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:55:10,104 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/Problem13_label47.c[6189,6202] [2025-01-08 23:55:10,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:55:10,518 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:55:10,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:10 WrapperNode [2025-01-08 23:55:10,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:55:10,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:55:10,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:55:10,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:55:10,528 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:55:10" (1/1) ... [2025-01-08 23:55:10,586 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:55:10" (1/1) ... [2025-01-08 23:55:11,118 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-01-08 23:55:11,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:55:11,121 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:55:11,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:55:11,122 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:55:11,130 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:10" (1/1) ... [2025-01-08 23:55:11,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:10" (1/1) ... [2025-01-08 23:55:11,292 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:10" (1/1) ... [2025-01-08 23:55:11,497 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:55:11,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:10" (1/1) ... [2025-01-08 23:55:11,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:10" (1/1) ... [2025-01-08 23:55:11,764 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:10" (1/1) ... [2025-01-08 23:55:11,789 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:10" (1/1) ... [2025-01-08 23:55:11,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:10" (1/1) ... [2025-01-08 23:55:11,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:10" (1/1) ... [2025-01-08 23:55:11,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:10" (1/1) ... [2025-01-08 23:55:12,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:55:12,083 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:55:12,084 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:55:12,084 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:55:12,085 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:10" (1/1) ... [2025-01-08 23:55:12,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:55:12,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:55:12,119 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:55:12,123 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:55:12,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:55:12,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:55:12,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:55:12,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:55:12,215 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:55:12,217 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:55:17,836 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-01-08 23:55:17,836 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:55:17,882 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:55:17,883 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:55:17,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:55:17 BoogieIcfgContainer [2025-01-08 23:55:17,884 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:55:17,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:55:17,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:55:17,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:55:17,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:55:08" (1/3) ... [2025-01-08 23:55:17,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1ef53a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:55:17, skipping insertion in model container [2025-01-08 23:55:17,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:10" (2/3) ... [2025-01-08 23:55:17,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1ef53a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:55:17, skipping insertion in model container [2025-01-08 23:55:17,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:55:17" (3/3) ... [2025-01-08 23:55:17,893 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label47.c [2025-01-08 23:55:17,907 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:55:17,909 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label47.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:55:17,999 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:55:18,012 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;@4f37281e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:55:18,012 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:55:18,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 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:55:18,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-08 23:55:18,027 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:18,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:55:18,028 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:18,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:18,033 INFO L85 PathProgramCache]: Analyzing trace with hash -23576676, now seen corresponding path program 1 times [2025-01-08 23:55:18,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:18,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045014790] [2025-01-08 23:55:18,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:18,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:18,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-08 23:55:18,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-08 23:55:18,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:18,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:18,342 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:55:18,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:18,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045014790] [2025-01-08 23:55:18,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045014790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:18,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:18,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:55:18,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759712423] [2025-01-08 23:55:18,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:18,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:18,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:18,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:18,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:18,372 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 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 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 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:55:22,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:22,183 INFO L93 Difference]: Finished difference Result 3035 states and 5640 transitions. [2025-01-08 23:55:22,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:22,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 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 43 [2025-01-08 23:55:22,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:22,214 INFO L225 Difference]: With dead ends: 3035 [2025-01-08 23:55:22,215 INFO L226 Difference]: Without dead ends: 1873 [2025-01-08 23:55:22,224 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:55:22,226 INFO L435 NwaCegarLoop]: 991 mSDtfsCounter, 862 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 858 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:22,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 1145 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [858 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-01-08 23:55:22,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2025-01-08 23:55:22,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1859. [2025-01-08 23:55:22,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1858 states have (on average 1.5441334768568353) internal successors, (2869), 1858 states have internal predecessors, (2869), 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:55:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2869 transitions. [2025-01-08 23:55:22,360 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2869 transitions. Word has length 43 [2025-01-08 23:55:22,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:22,361 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2869 transitions. [2025-01-08 23:55:22,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 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:55:22,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2869 transitions. [2025-01-08 23:55:22,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-08 23:55:22,366 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:22,367 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:22,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:55:22,367 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:22,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:22,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1307277072, now seen corresponding path program 1 times [2025-01-08 23:55:22,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:22,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095539937] [2025-01-08 23:55:22,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:22,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:22,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-08 23:55:22,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-08 23:55:22,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:22,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:22,674 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:55:22,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:22,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095539937] [2025-01-08 23:55:22,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095539937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:22,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:22,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:55:22,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251684937] [2025-01-08 23:55:22,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:22,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:22,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:22,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:22,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:22,680 INFO L87 Difference]: Start difference. First operand 1859 states and 2869 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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:55:27,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:27,039 INFO L93 Difference]: Finished difference Result 5405 states and 8404 transitions. [2025-01-08 23:55:27,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:27,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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 115 [2025-01-08 23:55:27,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:27,054 INFO L225 Difference]: With dead ends: 5405 [2025-01-08 23:55:27,054 INFO L226 Difference]: Without dead ends: 3548 [2025-01-08 23:55:27,056 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:55:27,058 INFO L435 NwaCegarLoop]: 906 mSDtfsCounter, 863 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 3343 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 3785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 3343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:27,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 1039 Invalid, 3785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 3343 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-01-08 23:55:27,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2025-01-08 23:55:27,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3476. [2025-01-08 23:55:27,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3476 states, 3475 states have (on average 1.4900719424460431) internal successors, (5178), 3475 states have internal predecessors, (5178), 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:55:27,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 5178 transitions. [2025-01-08 23:55:27,138 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 5178 transitions. Word has length 115 [2025-01-08 23:55:27,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:27,138 INFO L471 AbstractCegarLoop]: Abstraction has 3476 states and 5178 transitions. [2025-01-08 23:55:27,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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:55:27,139 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 5178 transitions. [2025-01-08 23:55:27,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-08 23:55:27,140 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:27,140 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:27,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:55:27,141 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:27,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:27,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1444495833, now seen corresponding path program 1 times [2025-01-08 23:55:27,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:27,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067897496] [2025-01-08 23:55:27,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:27,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:27,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-08 23:55:27,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-08 23:55:27,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:27,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:55:27,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:27,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067897496] [2025-01-08 23:55:27,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067897496] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:27,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:27,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:55:27,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740515078] [2025-01-08 23:55:27,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:27,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:27,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:27,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:27,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:27,372 INFO L87 Difference]: Start difference. First operand 3476 states and 5178 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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:55:31,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:31,125 INFO L93 Difference]: Finished difference Result 10142 states and 15132 transitions. [2025-01-08 23:55:31,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:31,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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 129 [2025-01-08 23:55:31,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:31,147 INFO L225 Difference]: With dead ends: 10142 [2025-01-08 23:55:31,147 INFO L226 Difference]: Without dead ends: 6668 [2025-01-08 23:55:31,152 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:55:31,153 INFO L435 NwaCegarLoop]: 712 mSDtfsCounter, 964 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2532 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 3307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 2532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:31,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 848 Invalid, 3307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 2532 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-08 23:55:31,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6668 states. [2025-01-08 23:55:31,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6668 to 6659. [2025-01-08 23:55:31,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6659 states, 6658 states have (on average 1.364674076299189) internal successors, (9086), 6658 states have internal predecessors, (9086), 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:55:31,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6659 states to 6659 states and 9086 transitions. [2025-01-08 23:55:31,274 INFO L78 Accepts]: Start accepts. Automaton has 6659 states and 9086 transitions. Word has length 129 [2025-01-08 23:55:31,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:31,274 INFO L471 AbstractCegarLoop]: Abstraction has 6659 states and 9086 transitions. [2025-01-08 23:55:31,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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:55:31,275 INFO L276 IsEmpty]: Start isEmpty. Operand 6659 states and 9086 transitions. [2025-01-08 23:55:31,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-08 23:55:31,276 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:31,277 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:31,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:55:31,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:31,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:31,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1256075178, now seen corresponding path program 1 times [2025-01-08 23:55:31,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:31,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492092093] [2025-01-08 23:55:31,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:31,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:31,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-08 23:55:31,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-08 23:55:31,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:31,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:31,708 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:55:31,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:31,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492092093] [2025-01-08 23:55:31,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492092093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:31,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:31,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:55:31,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409803330] [2025-01-08 23:55:31,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:31,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:31,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:31,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:31,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:31,711 INFO L87 Difference]: Start difference. First operand 6659 states and 9086 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:34,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:34,438 INFO L93 Difference]: Finished difference Result 14110 states and 19034 transitions. [2025-01-08 23:55:34,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:34,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2025-01-08 23:55:34,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:34,457 INFO L225 Difference]: With dead ends: 14110 [2025-01-08 23:55:34,457 INFO L226 Difference]: Without dead ends: 7453 [2025-01-08 23:55:34,466 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:55:34,467 INFO L435 NwaCegarLoop]: 1047 mSDtfsCounter, 707 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2568 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 2597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:34,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1176 Invalid, 2597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2568 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:55:34,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7453 states. [2025-01-08 23:55:34,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7453 to 7446. [2025-01-08 23:55:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7446 states, 7445 states have (on average 1.3308260577568838) internal successors, (9908), 7445 states have internal predecessors, (9908), 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:55:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7446 states to 7446 states and 9908 transitions. [2025-01-08 23:55:34,593 INFO L78 Accepts]: Start accepts. Automaton has 7446 states and 9908 transitions. Word has length 132 [2025-01-08 23:55:34,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:34,595 INFO L471 AbstractCegarLoop]: Abstraction has 7446 states and 9908 transitions. [2025-01-08 23:55:34,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:34,595 INFO L276 IsEmpty]: Start isEmpty. Operand 7446 states and 9908 transitions. [2025-01-08 23:55:34,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-08 23:55:34,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:34,599 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:34,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:55:34,599 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:34,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:34,600 INFO L85 PathProgramCache]: Analyzing trace with hash 626794970, now seen corresponding path program 1 times [2025-01-08 23:55:34,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:34,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662879472] [2025-01-08 23:55:34,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:34,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:34,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-08 23:55:34,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-08 23:55:34,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:34,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:34,788 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:55:34,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:34,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662879472] [2025-01-08 23:55:34,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662879472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:34,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:34,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:55:34,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176954648] [2025-01-08 23:55:34,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:34,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:34,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:34,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:34,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:34,790 INFO L87 Difference]: Start difference. First operand 7446 states and 9908 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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:55:38,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:38,128 INFO L93 Difference]: Finished difference Result 17275 states and 24006 transitions. [2025-01-08 23:55:38,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:38,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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 139 [2025-01-08 23:55:38,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:38,158 INFO L225 Difference]: With dead ends: 17275 [2025-01-08 23:55:38,158 INFO L226 Difference]: Without dead ends: 10618 [2025-01-08 23:55:38,165 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:55:38,166 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 914 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 2406 mSolverCounterSat, 901 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 3307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 901 IncrementalHoareTripleChecker+Valid, 2406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:38,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 999 Invalid, 3307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [901 Valid, 2406 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-08 23:55:38,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10618 states. [2025-01-08 23:55:38,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10618 to 10608. [2025-01-08 23:55:38,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10608 states, 10607 states have (on average 1.3128122937682662) internal successors, (13925), 10607 states have internal predecessors, (13925), 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:55:38,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10608 states to 10608 states and 13925 transitions. [2025-01-08 23:55:38,365 INFO L78 Accepts]: Start accepts. Automaton has 10608 states and 13925 transitions. Word has length 139 [2025-01-08 23:55:38,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:38,365 INFO L471 AbstractCegarLoop]: Abstraction has 10608 states and 13925 transitions. [2025-01-08 23:55:38,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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:55:38,366 INFO L276 IsEmpty]: Start isEmpty. Operand 10608 states and 13925 transitions. [2025-01-08 23:55:38,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-08 23:55:38,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:38,367 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:38,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:55:38,367 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:38,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:38,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1438125150, now seen corresponding path program 1 times [2025-01-08 23:55:38,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:38,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828466414] [2025-01-08 23:55:38,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:38,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:38,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-08 23:55:38,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-08 23:55:38,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:38,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:55:38,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:38,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828466414] [2025-01-08 23:55:38,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828466414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:38,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:38,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:55:38,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184041622] [2025-01-08 23:55:38,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:38,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:55:38,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:38,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:55:38,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:55:38,783 INFO L87 Difference]: Start difference. First operand 10608 states and 13925 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 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:55:43,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:43,304 INFO L93 Difference]: Finished difference Result 29882 states and 39631 transitions. [2025-01-08 23:55:43,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:55:43,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 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 148 [2025-01-08 23:55:43,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:43,348 INFO L225 Difference]: With dead ends: 29882 [2025-01-08 23:55:43,349 INFO L226 Difference]: Without dead ends: 20063 [2025-01-08 23:55:43,358 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:55:43,360 INFO L435 NwaCegarLoop]: 1007 mSDtfsCounter, 2376 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 4541 mSolverCounterSat, 793 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2376 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 5334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 793 IncrementalHoareTripleChecker+Valid, 4541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:43,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2376 Valid, 1296 Invalid, 5334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [793 Valid, 4541 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-01-08 23:55:43,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20063 states. [2025-01-08 23:55:43,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20063 to 20062. [2025-01-08 23:55:43,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20062 states, 20061 states have (on average 1.2497881461542295) internal successors, (25072), 20061 states have internal predecessors, (25072), 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:55:43,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20062 states to 20062 states and 25072 transitions. [2025-01-08 23:55:43,596 INFO L78 Accepts]: Start accepts. Automaton has 20062 states and 25072 transitions. Word has length 148 [2025-01-08 23:55:43,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:43,596 INFO L471 AbstractCegarLoop]: Abstraction has 20062 states and 25072 transitions. [2025-01-08 23:55:43,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 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:55:43,597 INFO L276 IsEmpty]: Start isEmpty. Operand 20062 states and 25072 transitions. [2025-01-08 23:55:43,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-01-08 23:55:43,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:43,599 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:55:43,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:55:43,600 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:43,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:43,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1160170482, now seen corresponding path program 1 times [2025-01-08 23:55:43,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:43,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310884395] [2025-01-08 23:55:43,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:43,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:43,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-01-08 23:55:43,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-01-08 23:55:43,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:43,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:43,775 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:55:43,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:43,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310884395] [2025-01-08 23:55:43,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310884395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:43,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:43,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:55:43,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035012089] [2025-01-08 23:55:43,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:43,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:43,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:43,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:43,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:43,777 INFO L87 Difference]: Start difference. First operand 20062 states and 25072 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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:55:47,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:47,625 INFO L93 Difference]: Finished difference Result 55911 states and 70680 transitions. [2025-01-08 23:55:47,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:47,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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 224 [2025-01-08 23:55:47,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:47,708 INFO L225 Difference]: With dead ends: 55911 [2025-01-08 23:55:47,708 INFO L226 Difference]: Without dead ends: 36638 [2025-01-08 23:55:47,732 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:55:47,735 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 909 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 2888 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 3427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 2888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:47,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 642 Invalid, 3427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 2888 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-08 23:55:47,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36638 states. [2025-01-08 23:55:48,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36638 to 36629. [2025-01-08 23:55:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36629 states, 36628 states have (on average 1.2236813366823196) internal successors, (44821), 36628 states have internal predecessors, (44821), 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:55:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36629 states to 36629 states and 44821 transitions. [2025-01-08 23:55:48,215 INFO L78 Accepts]: Start accepts. Automaton has 36629 states and 44821 transitions. Word has length 224 [2025-01-08 23:55:48,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:48,215 INFO L471 AbstractCegarLoop]: Abstraction has 36629 states and 44821 transitions. [2025-01-08 23:55:48,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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:55:48,216 INFO L276 IsEmpty]: Start isEmpty. Operand 36629 states and 44821 transitions. [2025-01-08 23:55:48,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-01-08 23:55:48,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:48,222 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:55:48,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:55:48,222 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:48,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:48,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1621631971, now seen corresponding path program 1 times [2025-01-08 23:55:48,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:48,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544990254] [2025-01-08 23:55:48,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:48,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:48,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-01-08 23:55:48,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-01-08 23:55:48,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:48,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-08 23:55:48,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:48,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544990254] [2025-01-08 23:55:48,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544990254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:48,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:48,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:55:48,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058805886] [2025-01-08 23:55:48,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:48,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:48,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:48,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:48,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:48,468 INFO L87 Difference]: Start difference. First operand 36629 states and 44821 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 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:55:52,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:52,148 INFO L93 Difference]: Finished difference Result 103154 states and 127145 transitions. [2025-01-08 23:55:52,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:52,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 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 273 [2025-01-08 23:55:52,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:52,267 INFO L225 Difference]: With dead ends: 103154 [2025-01-08 23:55:52,267 INFO L226 Difference]: Without dead ends: 67314 [2025-01-08 23:55:52,302 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:55:52,303 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 853 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2315 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 3183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 2315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:52,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 994 Invalid, 3183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 2315 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-08 23:55:52,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67314 states. [2025-01-08 23:55:52,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67314 to 61798. [2025-01-08 23:55:53,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61798 states, 61797 states have (on average 1.1764810589510817) internal successors, (72703), 61797 states have internal predecessors, (72703), 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:55:53,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61798 states to 61798 states and 72703 transitions. [2025-01-08 23:55:53,085 INFO L78 Accepts]: Start accepts. Automaton has 61798 states and 72703 transitions. Word has length 273 [2025-01-08 23:55:53,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:53,086 INFO L471 AbstractCegarLoop]: Abstraction has 61798 states and 72703 transitions. [2025-01-08 23:55:53,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 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:55:53,086 INFO L276 IsEmpty]: Start isEmpty. Operand 61798 states and 72703 transitions. [2025-01-08 23:55:53,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-01-08 23:55:53,096 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:53,096 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:55:53,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:55:53,097 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:53,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:53,098 INFO L85 PathProgramCache]: Analyzing trace with hash -2018372771, now seen corresponding path program 1 times [2025-01-08 23:55:53,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:53,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460684855] [2025-01-08 23:55:53,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:53,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:53,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-01-08 23:55:53,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-01-08 23:55:53,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:53,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-01-08 23:55:53,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:53,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460684855] [2025-01-08 23:55:53,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460684855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:53,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:53,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:55:53,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109763702] [2025-01-08 23:55:53,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:53,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:53,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:53,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:53,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:53,486 INFO L87 Difference]: Start difference. First operand 61798 states and 72703 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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:55:55,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-08 23:55:58,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:58,116 INFO L93 Difference]: Finished difference Result 142490 states and 170154 transitions. [2025-01-08 23:55:58,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:58,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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 331 [2025-01-08 23:55:58,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:58,393 INFO L225 Difference]: With dead ends: 142490 [2025-01-08 23:55:58,393 INFO L226 Difference]: Without dead ends: 81481 [2025-01-08 23:55:58,434 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:55:58,435 INFO L435 NwaCegarLoop]: 1793 mSDtfsCounter, 827 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2541 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 3264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 2541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:58,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 1944 Invalid, 3264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 2541 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-01-08 23:55:58,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81481 states. [2025-01-08 23:55:59,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81481 to 79902. [2025-01-08 23:55:59,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79902 states, 79901 states have (on average 1.1534148508779616) internal successors, (92159), 79901 states have internal predecessors, (92159), 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:55:59,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79902 states to 79902 states and 92159 transitions. [2025-01-08 23:55:59,325 INFO L78 Accepts]: Start accepts. Automaton has 79902 states and 92159 transitions. Word has length 331 [2025-01-08 23:55:59,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:59,325 INFO L471 AbstractCegarLoop]: Abstraction has 79902 states and 92159 transitions. [2025-01-08 23:55:59,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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:55:59,326 INFO L276 IsEmpty]: Start isEmpty. Operand 79902 states and 92159 transitions. [2025-01-08 23:55:59,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-01-08 23:55:59,330 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:59,330 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:55:59,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:55:59,330 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:59,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:59,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1474247678, now seen corresponding path program 1 times [2025-01-08 23:55:59,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:59,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694102624] [2025-01-08 23:55:59,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:59,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:59,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-01-08 23:55:59,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-01-08 23:55:59,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:59,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:59,629 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-08 23:55:59,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:59,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694102624] [2025-01-08 23:55:59,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694102624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:59,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:59,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:55:59,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210166136] [2025-01-08 23:55:59,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:59,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:55:59,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:59,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:55:59,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:55:59,632 INFO L87 Difference]: Start difference. First operand 79902 states and 92159 transitions. Second operand has 4 states, 4 states have (on average 75.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:56:06,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:06,376 INFO L93 Difference]: Finished difference Result 223778 states and 259849 transitions. [2025-01-08 23:56:06,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:56:06,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.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 340 [2025-01-08 23:56:06,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:06,562 INFO L225 Difference]: With dead ends: 223778 [2025-01-08 23:56:06,562 INFO L226 Difference]: Without dead ends: 144665 [2025-01-08 23:56:06,620 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:56:06,621 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 1731 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 6586 mSolverCounterSat, 1152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1731 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 7738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1152 IncrementalHoareTripleChecker+Valid, 6586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:06,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1731 Valid, 665 Invalid, 7738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1152 Valid, 6586 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2025-01-08 23:56:06,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144665 states. [2025-01-08 23:56:08,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144665 to 142167. [2025-01-08 23:56:08,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142167 states, 142166 states have (on average 1.148460250692852) internal successors, (163272), 142166 states have internal predecessors, (163272), 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:56:08,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142167 states to 142167 states and 163272 transitions. [2025-01-08 23:56:08,525 INFO L78 Accepts]: Start accepts. Automaton has 142167 states and 163272 transitions. Word has length 340 [2025-01-08 23:56:08,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:56:08,525 INFO L471 AbstractCegarLoop]: Abstraction has 142167 states and 163272 transitions. [2025-01-08 23:56:08,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.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:56:08,525 INFO L276 IsEmpty]: Start isEmpty. Operand 142167 states and 163272 transitions. [2025-01-08 23:56:08,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-01-08 23:56:08,535 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:56:08,535 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:56:08,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:56:08,535 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:56:08,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:56:08,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1851981540, now seen corresponding path program 1 times [2025-01-08 23:56:08,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:56:08,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919429857] [2025-01-08 23:56:08,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:08,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:56:08,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-01-08 23:56:08,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-01-08 23:56:08,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:08,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 358 proven. 25 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-08 23:56:09,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:09,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919429857] [2025-01-08 23:56:09,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919429857] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:56:09,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328616159] [2025-01-08 23:56:09,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:09,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:56:09,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:56:09,408 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:56:09,410 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:56:09,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-01-08 23:56:09,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-01-08 23:56:09,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:09,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:09,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:56:09,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:56:09,696 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2025-01-08 23:56:09,696 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:56:09,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328616159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:09,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:56:09,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:56:09,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266857109] [2025-01-08 23:56:09,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:09,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:56:09,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:09,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:56:09,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:56:09,699 INFO L87 Difference]: Start difference. First operand 142167 states and 163272 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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:56:12,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:12,908 INFO L93 Difference]: Finished difference Result 286675 states and 329887 transitions. [2025-01-08 23:56:12,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:56:12,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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 369 [2025-01-08 23:56:12,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:13,074 INFO L225 Difference]: With dead ends: 286675 [2025-01-08 23:56:13,074 INFO L226 Difference]: Without dead ends: 161836 [2025-01-08 23:56:13,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:56:13,120 INFO L435 NwaCegarLoop]: 1763 mSDtfsCounter, 861 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 2406 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1893 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 2406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:13,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1893 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 2406 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:56:13,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161836 states. [2025-01-08 23:56:14,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161836 to 151596. [2025-01-08 23:56:14,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151596 states, 151595 states have (on average 1.140796200402388) internal successors, (172939), 151595 states have internal predecessors, (172939), 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:56:15,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151596 states to 151596 states and 172939 transitions. [2025-01-08 23:56:15,075 INFO L78 Accepts]: Start accepts. Automaton has 151596 states and 172939 transitions. Word has length 369 [2025-01-08 23:56:15,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:56:15,075 INFO L471 AbstractCegarLoop]: Abstraction has 151596 states and 172939 transitions. [2025-01-08 23:56:15,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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:56:15,076 INFO L276 IsEmpty]: Start isEmpty. Operand 151596 states and 172939 transitions. [2025-01-08 23:56:15,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-01-08 23:56:15,087 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:56:15,088 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:15,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 23:56:15,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-08 23:56:15,288 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:56:15,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:56:15,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1699371718, now seen corresponding path program 1 times [2025-01-08 23:56:15,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:56:15,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535653116] [2025-01-08 23:56:15,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:15,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:56:15,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-01-08 23:56:15,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-01-08 23:56:15,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:15,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 360 proven. 25 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-08 23:56:16,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:16,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535653116] [2025-01-08 23:56:16,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535653116] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:56:16,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036688100] [2025-01-08 23:56:16,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:16,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:56:16,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:56:16,298 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:56:16,301 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:56:16,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-01-08 23:56:16,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-01-08 23:56:16,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:16,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:16,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:56:16,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:56:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-08 23:56:16,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:56:16,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036688100] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:16,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:56:16,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:56:16,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320292602] [2025-01-08 23:56:16,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:16,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:56:16,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:16,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:56:16,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:56:16,768 INFO L87 Difference]: Start difference. First operand 151596 states and 172939 transitions. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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:56:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:20,934 INFO L93 Difference]: Finished difference Result 344101 states and 398013 transitions. [2025-01-08 23:56:20,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:56:20,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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 444 [2025-01-08 23:56:20,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:21,174 INFO L225 Difference]: With dead ends: 344101 [2025-01-08 23:56:21,174 INFO L226 Difference]: Without dead ends: 209833 [2025-01-08 23:56:21,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:56:21,209 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 736 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 2461 mSolverCounterSat, 763 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 3224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 763 IncrementalHoareTripleChecker+Valid, 2461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:21,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1126 Invalid, 3224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [763 Valid, 2461 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-08 23:56:21,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209833 states.