./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label31.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_label31.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 781b4c30281e668acaf3c14c6cf74c491996fd51fc229d130e4fc767358d6ab3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:53:15,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:53:15,807 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:53:15,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:53:15,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:53:15,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:53:15,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:53:15,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:53:15,842 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:53:15,842 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:53:15,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:53:15,843 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:53:15,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:53:15,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:53:15,844 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:53:15,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:53:15,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:53:15,844 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:53:15,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:53:15,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:53:15,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:53:15,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:53:15,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:53:15,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:53:15,845 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:53:15,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:53:15,845 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:53:15,845 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:53:15,845 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:53:15,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:53:15,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:53:15,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:53:15,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:53:15,846 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:53:15,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:53:15,847 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:53:15,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:53:15,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:53:15,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:53:15,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:53:15,847 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:53:15,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:53:15,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:53:15,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:53:15,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:53:15,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:53:15,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:53:15,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:53:15,847 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 -> 781b4c30281e668acaf3c14c6cf74c491996fd51fc229d130e4fc767358d6ab3 [2025-01-08 23:53:16,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:53:16,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:53:16,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:53:16,093 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:53:16,093 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:53:16,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label31.c [2025-01-08 23:53:17,236 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f5c7f5a7/be9b71bd9beb4ea68e54697fa5c1333c/FLAGd1d7a3c61 [2025-01-08 23:53:17,776 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:53:17,777 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label31.c [2025-01-08 23:53:17,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f5c7f5a7/be9b71bd9beb4ea68e54697fa5c1333c/FLAGd1d7a3c61 [2025-01-08 23:53:17,818 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f5c7f5a7/be9b71bd9beb4ea68e54697fa5c1333c [2025-01-08 23:53:17,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:53:17,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:53:17,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:53:17,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:53:17,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:53:17,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:53:17" (1/1) ... [2025-01-08 23:53:17,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@660fd5c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:17, skipping insertion in model container [2025-01-08 23:53:17,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:53:17" (1/1) ... [2025-01-08 23:53:17,915 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:53:18,111 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_label31.c[5792,5805] [2025-01-08 23:53:18,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:53:18,677 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:53:18,693 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_label31.c[5792,5805] [2025-01-08 23:53:19,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:53:19,037 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:53:19,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:19 WrapperNode [2025-01-08 23:53:19,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:53:19,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:53:19,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:53:19,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:53:19,042 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:53:19" (1/1) ... [2025-01-08 23:53:19,091 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:53:19" (1/1) ... [2025-01-08 23:53:19,530 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-01-08 23:53:19,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:53:19,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:53:19,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:53:19,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:53:19,547 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:19" (1/1) ... [2025-01-08 23:53:19,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:19" (1/1) ... [2025-01-08 23:53:19,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:19" (1/1) ... [2025-01-08 23:53:19,833 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:53:19,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:19" (1/1) ... [2025-01-08 23:53:19,833 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:19" (1/1) ... [2025-01-08 23:53:19,983 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:19" (1/1) ... [2025-01-08 23:53:19,996 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:19" (1/1) ... [2025-01-08 23:53:20,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:19" (1/1) ... [2025-01-08 23:53:20,071 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:19" (1/1) ... [2025-01-08 23:53:20,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:19" (1/1) ... [2025-01-08 23:53:20,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:53:20,125 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:53:20,125 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:53:20,125 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:53:20,126 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:19" (1/1) ... [2025-01-08 23:53:20,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:53:20,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:53:20,149 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:53:20,154 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:53:20,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:53:20,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:53:20,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:53:20,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:53:20,213 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:53:20,214 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:53:24,336 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-01-08 23:53:24,337 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:53:24,367 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:53:24,369 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:53:24,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:53:24 BoogieIcfgContainer [2025-01-08 23:53:24,370 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:53:24,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:53:24,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:53:24,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:53:24,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:53:17" (1/3) ... [2025-01-08 23:53:24,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30566172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:53:24, skipping insertion in model container [2025-01-08 23:53:24,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:53:19" (2/3) ... [2025-01-08 23:53:24,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30566172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:53:24, skipping insertion in model container [2025-01-08 23:53:24,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:53:24" (3/3) ... [2025-01-08 23:53:24,379 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label31.c [2025-01-08 23:53:24,390 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:53:24,391 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label31.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:53:24,479 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:53:24,494 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;@6b673693, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:53:24,494 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:53:24,503 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:53:24,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-08 23:53:24,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:53:24,510 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] [2025-01-08 23:53:24,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:53:24,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:53:24,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1322904494, now seen corresponding path program 1 times [2025-01-08 23:53:24,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:53:24,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733211331] [2025-01-08 23:53:24,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:53:24,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:53:24,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-08 23:53:24,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-08 23:53:24,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:53:24,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:53:24,856 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:53:24,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:53:24,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733211331] [2025-01-08 23:53:24,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733211331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:53:24,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:53:24,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:53:24,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575101216] [2025-01-08 23:53:24,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:53:24,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:53:24,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:53:24,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:53:24,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:53:24,898 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 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 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:53:28,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:53:28,335 INFO L93 Difference]: Finished difference Result 3082 states and 5686 transitions. [2025-01-08 23:53:28,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:53:28,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 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 40 [2025-01-08 23:53:28,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:53:28,357 INFO L225 Difference]: With dead ends: 3082 [2025-01-08 23:53:28,358 INFO L226 Difference]: Without dead ends: 1899 [2025-01-08 23:53:28,362 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:53:28,366 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 999 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 2955 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 3554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 2955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:53:28,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 645 Invalid, 3554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 2955 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-08 23:53:28,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2025-01-08 23:53:28,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1894. [2025-01-08 23:53:28,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1893 states have (on average 1.7374537770734284) internal successors, (3289), 1893 states have internal predecessors, (3289), 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:53:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 3289 transitions. [2025-01-08 23:53:28,540 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 3289 transitions. Word has length 40 [2025-01-08 23:53:28,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:53:28,543 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 3289 transitions. [2025-01-08 23:53:28,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 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:53:28,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 3289 transitions. [2025-01-08 23:53:28,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-08 23:53:28,547 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:53:28,547 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:28,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:53:28,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:53:28,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:53:28,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1481181451, now seen corresponding path program 1 times [2025-01-08 23:53:28,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:53:28,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316747311] [2025-01-08 23:53:28,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:53:28,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:53:28,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-08 23:53:28,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-08 23:53:28,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:53:28,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:53:28,758 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:53:28,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:53:28,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316747311] [2025-01-08 23:53:28,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316747311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:53:28,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:53:28,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:53:28,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650879768] [2025-01-08 23:53:28,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:53:28,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:53:28,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:53:28,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:53:28,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:53:28,761 INFO L87 Difference]: Start difference. First operand 1894 states and 3289 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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:53:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:53:31,560 INFO L93 Difference]: Finished difference Result 5384 states and 9441 transitions. [2025-01-08 23:53:31,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:53:31,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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 105 [2025-01-08 23:53:31,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:53:31,571 INFO L225 Difference]: With dead ends: 5384 [2025-01-08 23:53:31,571 INFO L226 Difference]: Without dead ends: 3492 [2025-01-08 23:53:31,573 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:53:31,573 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 922 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2310 mSolverCounterSat, 879 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 3189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 879 IncrementalHoareTripleChecker+Valid, 2310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:53:31,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 1014 Invalid, 3189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [879 Valid, 2310 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:53:31,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3492 states. [2025-01-08 23:53:31,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3492 to 3491. [2025-01-08 23:53:31,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3491 states, 3490 states have (on average 1.5383954154727795) internal successors, (5369), 3490 states have internal predecessors, (5369), 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:53:31,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3491 states to 3491 states and 5369 transitions. [2025-01-08 23:53:31,617 INFO L78 Accepts]: Start accepts. Automaton has 3491 states and 5369 transitions. Word has length 105 [2025-01-08 23:53:31,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:53:31,618 INFO L471 AbstractCegarLoop]: Abstraction has 3491 states and 5369 transitions. [2025-01-08 23:53:31,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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:53:31,618 INFO L276 IsEmpty]: Start isEmpty. Operand 3491 states and 5369 transitions. [2025-01-08 23:53:31,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-08 23:53:31,619 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:53:31,619 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:31,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:53:31,620 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:53:31,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:53:31,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1006582544, now seen corresponding path program 1 times [2025-01-08 23:53:31,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:53:31,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332592615] [2025-01-08 23:53:31,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:53:31,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:53:31,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-08 23:53:31,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-08 23:53:31,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:53:31,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:53:31,851 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:53:31,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:53:31,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332592615] [2025-01-08 23:53:31,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332592615] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:53:31,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:53:31,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:53:31,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689345453] [2025-01-08 23:53:31,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:53:31,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:53:31,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:53:31,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:53:31,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:53:31,854 INFO L87 Difference]: Start difference. First operand 3491 states and 5369 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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:53:35,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:53:35,273 INFO L93 Difference]: Finished difference Result 10205 states and 15786 transitions. [2025-01-08 23:53:35,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:53:35,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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 107 [2025-01-08 23:53:35,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:53:35,290 INFO L225 Difference]: With dead ends: 10205 [2025-01-08 23:53:35,290 INFO L226 Difference]: Without dead ends: 6716 [2025-01-08 23:53:35,293 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:53:35,293 INFO L435 NwaCegarLoop]: 945 mSDtfsCounter, 813 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3285 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 3646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 3285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:53:35,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 1081 Invalid, 3646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 3285 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-08 23:53:35,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6716 states. [2025-01-08 23:53:35,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6716 to 6655. [2025-01-08 23:53:35,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6655 states, 6654 states have (on average 1.4171926660655245) internal successors, (9430), 6654 states have internal predecessors, (9430), 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:53:35,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6655 states to 6655 states and 9430 transitions. [2025-01-08 23:53:35,365 INFO L78 Accepts]: Start accepts. Automaton has 6655 states and 9430 transitions. Word has length 107 [2025-01-08 23:53:35,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:53:35,365 INFO L471 AbstractCegarLoop]: Abstraction has 6655 states and 9430 transitions. [2025-01-08 23:53:35,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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:53:35,366 INFO L276 IsEmpty]: Start isEmpty. Operand 6655 states and 9430 transitions. [2025-01-08 23:53:35,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-08 23:53:35,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:53:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:35,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:53:35,367 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:53:35,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:53:35,368 INFO L85 PathProgramCache]: Analyzing trace with hash -994837717, now seen corresponding path program 1 times [2025-01-08 23:53:35,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:53:35,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673578406] [2025-01-08 23:53:35,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:53:35,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:53:35,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-08 23:53:35,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-08 23:53:35,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:53:35,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:53:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:53:35,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:53:35,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673578406] [2025-01-08 23:53:35,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673578406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:53:35,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:53:35,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:53:35,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062907642] [2025-01-08 23:53:35,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:53:35,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:53:35,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:53:35,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:53:35,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:53:35,438 INFO L87 Difference]: Start difference. First operand 6655 states and 9430 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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:53:38,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:53:38,019 INFO L93 Difference]: Finished difference Result 14106 states and 20655 transitions. [2025-01-08 23:53:38,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:53:38,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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 109 [2025-01-08 23:53:38,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:53:38,036 INFO L225 Difference]: With dead ends: 14106 [2025-01-08 23:53:38,037 INFO L226 Difference]: Without dead ends: 7453 [2025-01-08 23:53:38,044 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:53:38,044 INFO L435 NwaCegarLoop]: 1088 mSDtfsCounter, 786 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 777 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 3308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 777 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:53:38,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1239 Invalid, 3308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [777 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:53:38,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7453 states. [2025-01-08 23:53:38,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7453 to 7438. [2025-01-08 23:53:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7438 states, 7437 states have (on average 1.3155842409573753) internal successors, (9784), 7437 states have internal predecessors, (9784), 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:53:38,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7438 states to 7438 states and 9784 transitions. [2025-01-08 23:53:38,131 INFO L78 Accepts]: Start accepts. Automaton has 7438 states and 9784 transitions. Word has length 109 [2025-01-08 23:53:38,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:53:38,131 INFO L471 AbstractCegarLoop]: Abstraction has 7438 states and 9784 transitions. [2025-01-08 23:53:38,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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:53:38,131 INFO L276 IsEmpty]: Start isEmpty. Operand 7438 states and 9784 transitions. [2025-01-08 23:53:38,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-08 23:53:38,132 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:53:38,132 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:38,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:53:38,132 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:53:38,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:53:38,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2054243318, now seen corresponding path program 1 times [2025-01-08 23:53:38,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:53:38,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26277998] [2025-01-08 23:53:38,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:53:38,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:53:38,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-08 23:53:38,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-08 23:53:38,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:53:38,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:53:38,229 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:53:38,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:53:38,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26277998] [2025-01-08 23:53:38,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26277998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:53:38,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:53:38,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:53:38,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485519027] [2025-01-08 23:53:38,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:53:38,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:53:38,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:53:38,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:53:38,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:53:38,232 INFO L87 Difference]: Start difference. First operand 7438 states and 9784 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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:53:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:53:41,212 INFO L93 Difference]: Finished difference Result 19632 states and 26424 transitions. [2025-01-08 23:53:41,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:53:41,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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 126 [2025-01-08 23:53:41,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:53:41,237 INFO L225 Difference]: With dead ends: 19632 [2025-01-08 23:53:41,239 INFO L226 Difference]: Without dead ends: 12983 [2025-01-08 23:53:41,252 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:53:41,255 INFO L435 NwaCegarLoop]: 731 mSDtfsCounter, 960 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2539 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 960 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 3303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:53:41,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [960 Valid, 863 Invalid, 3303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2539 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:53:41,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12983 states. [2025-01-08 23:53:41,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12983 to 12972. [2025-01-08 23:53:41,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12972 states, 12971 states have (on average 1.2362963534037468) internal successors, (16036), 12971 states have internal predecessors, (16036), 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:53:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12972 states to 12972 states and 16036 transitions. [2025-01-08 23:53:41,449 INFO L78 Accepts]: Start accepts. Automaton has 12972 states and 16036 transitions. Word has length 126 [2025-01-08 23:53:41,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:53:41,450 INFO L471 AbstractCegarLoop]: Abstraction has 12972 states and 16036 transitions. [2025-01-08 23:53:41,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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:53:41,450 INFO L276 IsEmpty]: Start isEmpty. Operand 12972 states and 16036 transitions. [2025-01-08 23:53:41,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-01-08 23:53:41,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:53:41,453 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:53:41,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:53:41,453 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:53:41,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:53:41,453 INFO L85 PathProgramCache]: Analyzing trace with hash 450741341, now seen corresponding path program 1 times [2025-01-08 23:53:41,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:53:41,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673595655] [2025-01-08 23:53:41,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:53:41,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:53:41,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-01-08 23:53:41,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-01-08 23:53:41,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:53:41,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:53:41,798 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-08 23:53:41,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:53:41,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673595655] [2025-01-08 23:53:41,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673595655] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:53:41,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:53:41,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:53:41,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258192933] [2025-01-08 23:53:41,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:53:41,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:53:41,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:53:41,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:53:41,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:53:41,803 INFO L87 Difference]: Start difference. First operand 12972 states and 16036 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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:53:44,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:53:44,413 INFO L93 Difference]: Finished difference Result 25155 states and 31273 transitions. [2025-01-08 23:53:44,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:53:44,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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 245 [2025-01-08 23:53:44,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:53:44,437 INFO L225 Difference]: With dead ends: 25155 [2025-01-08 23:53:44,437 INFO L226 Difference]: Without dead ends: 12972 [2025-01-08 23:53:44,445 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:53:44,446 INFO L435 NwaCegarLoop]: 1084 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:53:44,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1213 Invalid, 2525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:53:44,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12972 states. [2025-01-08 23:53:44,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12972 to 12972. [2025-01-08 23:53:44,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12972 states, 12971 states have (on average 1.235910878112713) internal successors, (16031), 12971 states have internal predecessors, (16031), 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:53:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12972 states to 12972 states and 16031 transitions. [2025-01-08 23:53:44,565 INFO L78 Accepts]: Start accepts. Automaton has 12972 states and 16031 transitions. Word has length 245 [2025-01-08 23:53:44,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:53:44,565 INFO L471 AbstractCegarLoop]: Abstraction has 12972 states and 16031 transitions. [2025-01-08 23:53:44,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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:53:44,566 INFO L276 IsEmpty]: Start isEmpty. Operand 12972 states and 16031 transitions. [2025-01-08 23:53:44,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-01-08 23:53:44,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:53:44,570 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:53:44,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:53:44,570 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:53:44,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:53:44,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1679042697, now seen corresponding path program 1 times [2025-01-08 23:53:44,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:53:44,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937152320] [2025-01-08 23:53:44,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:53:44,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:53:44,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-01-08 23:53:44,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-01-08 23:53:44,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:53:44,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:53:45,054 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 145 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:53:45,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:53:45,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937152320] [2025-01-08 23:53:45,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937152320] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:53:45,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136649618] [2025-01-08 23:53:45,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:53:45,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:53:45,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:53:45,064 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:53:45,070 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:53:45,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-01-08 23:53:45,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-01-08 23:53:45,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:53:45,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:53:45,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:53:45,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:53:45,656 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:53:45,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:53:45,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136649618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:53:45,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:53:45,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:53:45,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067440437] [2025-01-08 23:53:45,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:53:45,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:53:45,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:53:45,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:53:45,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:53:45,663 INFO L87 Difference]: Start difference. First operand 12972 states and 16031 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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:53:49,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:53:49,036 INFO L93 Difference]: Finished difference Result 32231 states and 40759 transitions. [2025-01-08 23:53:49,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:53:49,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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 252 [2025-01-08 23:53:49,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:53:49,066 INFO L225 Difference]: With dead ends: 32231 [2025-01-08 23:53:49,066 INFO L226 Difference]: Without dead ends: 22419 [2025-01-08 23:53:49,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 251 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:53:49,077 INFO L435 NwaCegarLoop]: 1015 mSDtfsCounter, 727 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 2506 mSolverCounterSat, 765 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 3271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 765 IncrementalHoareTripleChecker+Valid, 2506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:53:49,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1189 Invalid, 3271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [765 Valid, 2506 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-08 23:53:49,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22419 states. [2025-01-08 23:53:49,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22419 to 22418. [2025-01-08 23:53:49,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22418 states, 22417 states have (on average 1.1692019449524915) internal successors, (26210), 22417 states have internal predecessors, (26210), 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:53:49,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22418 states to 22418 states and 26210 transitions. [2025-01-08 23:53:49,227 INFO L78 Accepts]: Start accepts. Automaton has 22418 states and 26210 transitions. Word has length 252 [2025-01-08 23:53:49,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:53:49,227 INFO L471 AbstractCegarLoop]: Abstraction has 22418 states and 26210 transitions. [2025-01-08 23:53:49,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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:53:49,228 INFO L276 IsEmpty]: Start isEmpty. Operand 22418 states and 26210 transitions. [2025-01-08 23:53:49,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-01-08 23:53:49,231 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:53:49,231 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, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 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:53:49,237 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:53:49,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:53:49,434 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:53:49,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:53:49,434 INFO L85 PathProgramCache]: Analyzing trace with hash 297752674, now seen corresponding path program 1 times [2025-01-08 23:53:49,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:53:49,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626525956] [2025-01-08 23:53:49,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:53:49,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:53:49,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-01-08 23:53:49,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-01-08 23:53:49,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:53:49,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:53:49,549 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-08 23:53:49,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:53:49,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626525956] [2025-01-08 23:53:49,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626525956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:53:49,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:53:49,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:53:49,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347024435] [2025-01-08 23:53:49,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:53:49,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:53:49,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:53:49,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:53:49,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:53:49,553 INFO L87 Difference]: Start difference. First operand 22418 states and 26210 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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:53:52,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:53:52,602 INFO L93 Difference]: Finished difference Result 55078 states and 65658 transitions. [2025-01-08 23:53:52,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:53:52,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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 276 [2025-01-08 23:53:52,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:53:52,670 INFO L225 Difference]: With dead ends: 55078 [2025-01-08 23:53:52,673 INFO L226 Difference]: Without dead ends: 33449 [2025-01-08 23:53:52,706 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:53:52,710 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 889 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 911 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 911 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:53:52,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 950 Invalid, 3299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [911 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:53:52,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33449 states. [2025-01-08 23:53:52,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33449 to 23182. [2025-01-08 23:53:52,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23182 states, 23181 states have (on average 1.1823907510461154) internal successors, (27409), 23181 states have internal predecessors, (27409), 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:53:52,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23182 states to 23182 states and 27409 transitions. [2025-01-08 23:53:52,941 INFO L78 Accepts]: Start accepts. Automaton has 23182 states and 27409 transitions. Word has length 276 [2025-01-08 23:53:52,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:53:52,941 INFO L471 AbstractCegarLoop]: Abstraction has 23182 states and 27409 transitions. [2025-01-08 23:53:52,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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:53:52,941 INFO L276 IsEmpty]: Start isEmpty. Operand 23182 states and 27409 transitions. [2025-01-08 23:53:52,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-01-08 23:53:52,945 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:53:52,945 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:53:52,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:53:52,946 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:53:52,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:53:52,946 INFO L85 PathProgramCache]: Analyzing trace with hash 54750668, now seen corresponding path program 1 times [2025-01-08 23:53:52,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:53:52,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679113798] [2025-01-08 23:53:52,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:53:52,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:53:52,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-01-08 23:53:52,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-01-08 23:53:52,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:53:52,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:53:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 351 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-08 23:53:53,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:53:53,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679113798] [2025-01-08 23:53:53,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679113798] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:53:53,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:53:53,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:53:53,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46804101] [2025-01-08 23:53:53,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:53:53,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:53:53,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:53:53,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:53:53,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:53:53,158 INFO L87 Difference]: Start difference. First operand 23182 states and 27409 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 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:53:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:53:59,357 INFO L93 Difference]: Finished difference Result 86712 states and 103286 transitions. [2025-01-08 23:53:59,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:53:59,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 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 328 [2025-01-08 23:53:59,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:53:59,437 INFO L225 Difference]: With dead ends: 86712 [2025-01-08 23:53:59,438 INFO L226 Difference]: Without dead ends: 64319 [2025-01-08 23:53:59,462 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:53:59,463 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 1706 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 7130 mSolverCounterSat, 996 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1706 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 8126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 996 IncrementalHoareTripleChecker+Valid, 7130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:53:59,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1706 Valid, 1082 Invalid, 8126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [996 Valid, 7130 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-01-08 23:53:59,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64319 states. [2025-01-08 23:54:00,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64319 to 62627. [2025-01-08 23:54:00,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62627 states, 62626 states have (on average 1.1566601730910484) internal successors, (72437), 62626 states have internal predecessors, (72437), 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:54:00,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62627 states to 62627 states and 72437 transitions. [2025-01-08 23:54:00,151 INFO L78 Accepts]: Start accepts. Automaton has 62627 states and 72437 transitions. Word has length 328 [2025-01-08 23:54:00,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:00,151 INFO L471 AbstractCegarLoop]: Abstraction has 62627 states and 72437 transitions. [2025-01-08 23:54:00,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 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:54:00,152 INFO L276 IsEmpty]: Start isEmpty. Operand 62627 states and 72437 transitions. [2025-01-08 23:54:00,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-01-08 23:54:00,155 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:00,155 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:54:00,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:54:00,155 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:00,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:00,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1700402347, now seen corresponding path program 1 times [2025-01-08 23:54:00,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:00,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291927968] [2025-01-08 23:54:00,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:00,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:00,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-01-08 23:54:00,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-01-08 23:54:00,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:00,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:01,019 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 204 proven. 113 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-08 23:54:01,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:01,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291927968] [2025-01-08 23:54:01,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291927968] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:54:01,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091284647] [2025-01-08 23:54:01,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:01,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:54:01,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:54:01,027 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:54:01,028 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:54:01,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-01-08 23:54:01,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-01-08 23:54:01,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:01,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:01,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:54:01,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:54:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-01-08 23:54:01,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:54:01,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091284647] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:01,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:54:01,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-01-08 23:54:01,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862424755] [2025-01-08 23:54:01,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:01,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:01,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:01,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:01,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:54:01,217 INFO L87 Difference]: Start difference. First operand 62627 states and 72437 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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:54:04,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:04,633 INFO L93 Difference]: Finished difference Result 171850 states and 199837 transitions. [2025-01-08 23:54:04,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:04,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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 346 [2025-01-08 23:54:04,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:04,747 INFO L225 Difference]: With dead ends: 171850 [2025-01-08 23:54:04,747 INFO L226 Difference]: Without dead ends: 110012 [2025-01-08 23:54:04,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:54:04,766 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 1077 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 2636 mSolverCounterSat, 537 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 3173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 537 IncrementalHoareTripleChecker+Valid, 2636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:04,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 926 Invalid, 3173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [537 Valid, 2636 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:54:04,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110012 states. [2025-01-08 23:54:05,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110012 to 109981. [2025-01-08 23:54:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109981 states, 109980 states have (on average 1.1370794689943626) internal successors, (125056), 109980 states have internal predecessors, (125056), 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:54:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109981 states to 109981 states and 125056 transitions. [2025-01-08 23:54:05,639 INFO L78 Accepts]: Start accepts. Automaton has 109981 states and 125056 transitions. Word has length 346 [2025-01-08 23:54:05,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:05,639 INFO L471 AbstractCegarLoop]: Abstraction has 109981 states and 125056 transitions. [2025-01-08 23:54:05,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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:54:05,639 INFO L276 IsEmpty]: Start isEmpty. Operand 109981 states and 125056 transitions. [2025-01-08 23:54:05,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-01-08 23:54:05,643 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:05,644 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:54:05,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 23:54:05,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:54:05,848 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:05,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:05,849 INFO L85 PathProgramCache]: Analyzing trace with hash -378462922, now seen corresponding path program 1 times [2025-01-08 23:54:05,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:05,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613474592] [2025-01-08 23:54:05,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:05,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:05,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-01-08 23:54:05,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-01-08 23:54:05,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:05,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:06,143 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-08 23:54:06,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:06,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613474592] [2025-01-08 23:54:06,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613474592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:06,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:06,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:54:06,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972673119] [2025-01-08 23:54:06,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:06,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:06,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:06,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:06,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:06,146 INFO L87 Difference]: Start difference. First operand 109981 states and 125056 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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:54:09,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:09,854 INFO L93 Difference]: Finished difference Result 228603 states and 262686 transitions. [2025-01-08 23:54:09,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:09,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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 355 [2025-01-08 23:54:09,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:09,992 INFO L225 Difference]: With dead ends: 228603 [2025-01-08 23:54:09,993 INFO L226 Difference]: Without dead ends: 119411 [2025-01-08 23:54:10,057 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:54:10,061 INFO L435 NwaCegarLoop]: 1470 mSDtfsCounter, 1126 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 2405 mSolverCounterSat, 772 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 3177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 772 IncrementalHoareTripleChecker+Valid, 2405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:10,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 1560 Invalid, 3177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [772 Valid, 2405 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-08 23:54:10,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119411 states. [2025-01-08 23:54:11,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119411 to 117047. [2025-01-08 23:54:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117047 states, 117046 states have (on average 1.1186029424328896) internal successors, (130928), 117046 states have internal predecessors, (130928), 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:54:11,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117047 states to 117047 states and 130928 transitions. [2025-01-08 23:54:11,375 INFO L78 Accepts]: Start accepts. Automaton has 117047 states and 130928 transitions. Word has length 355 [2025-01-08 23:54:11,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:11,375 INFO L471 AbstractCegarLoop]: Abstraction has 117047 states and 130928 transitions. [2025-01-08 23:54:11,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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:54:11,375 INFO L276 IsEmpty]: Start isEmpty. Operand 117047 states and 130928 transitions. [2025-01-08 23:54:11,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2025-01-08 23:54:11,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:11,389 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:54:11,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:54:11,389 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:11,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:11,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1493305289, now seen corresponding path program 1 times [2025-01-08 23:54:11,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:11,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290476112] [2025-01-08 23:54:11,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:11,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:11,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes. [2025-01-08 23:54:11,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements. [2025-01-08 23:54:11,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:11,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:11,666 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-01-08 23:54:11,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:11,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290476112] [2025-01-08 23:54:11,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290476112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:11,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:11,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:54:11,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127637342] [2025-01-08 23:54:11,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:11,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:11,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:11,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:11,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:11,671 INFO L87 Difference]: Start difference. First operand 117047 states and 130928 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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:54:15,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:15,634 INFO L93 Difference]: Finished difference Result 264790 states and 298473 transitions. [2025-01-08 23:54:15,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:15,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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 396 [2025-01-08 23:54:15,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:15,824 INFO L225 Difference]: With dead ends: 264790 [2025-01-08 23:54:15,824 INFO L226 Difference]: Without dead ends: 148532 [2025-01-08 23:54:15,899 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:54:15,900 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 911 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2407 mSolverCounterSat, 965 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 3372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 965 IncrementalHoareTripleChecker+Valid, 2407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:15,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 855 Invalid, 3372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [965 Valid, 2407 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-08 23:54:16,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148532 states. [2025-01-08 23:54:17,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148532 to 146936. [2025-01-08 23:54:17,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146936 states, 146935 states have (on average 1.1126144213427707) internal successors, (163482), 146935 states have internal predecessors, (163482), 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:54:17,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146936 states to 146936 states and 163482 transitions. [2025-01-08 23:54:17,607 INFO L78 Accepts]: Start accepts. Automaton has 146936 states and 163482 transitions. Word has length 396 [2025-01-08 23:54:17,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:17,608 INFO L471 AbstractCegarLoop]: Abstraction has 146936 states and 163482 transitions. [2025-01-08 23:54:17,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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:54:17,608 INFO L276 IsEmpty]: Start isEmpty. Operand 146936 states and 163482 transitions. [2025-01-08 23:54:17,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2025-01-08 23:54:17,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:17,632 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:54:17,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:54:17,635 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:17,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:17,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1100550142, now seen corresponding path program 1 times [2025-01-08 23:54:17,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:17,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090000861] [2025-01-08 23:54:17,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:17,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:17,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-01-08 23:54:17,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-01-08 23:54:17,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:17,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:18,082 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-01-08 23:54:18,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:18,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090000861] [2025-01-08 23:54:18,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090000861] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:18,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:18,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:54:18,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410892909] [2025-01-08 23:54:18,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:18,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:18,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:18,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:18,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:18,084 INFO L87 Difference]: Start difference. First operand 146936 states and 163482 transitions. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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:54:21,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:21,429 INFO L93 Difference]: Finished difference Result 320638 states and 358761 transitions. [2025-01-08 23:54:21,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:21,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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 516 [2025-01-08 23:54:21,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:21,666 INFO L225 Difference]: With dead ends: 320638 [2025-01-08 23:54:21,666 INFO L226 Difference]: Without dead ends: 174491 [2025-01-08 23:54:21,741 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:54:21,742 INFO L435 NwaCegarLoop]: 1770 mSDtfsCounter, 699 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2543 mSolverCounterSat, 702 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 3245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 702 IncrementalHoareTripleChecker+Valid, 2543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:21,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1913 Invalid, 3245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [702 Valid, 2543 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:54:21,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174491 states. [2025-01-08 23:54:23,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174491 to 172894. [2025-01-08 23:54:23,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172894 states, 172893 states have (on average 1.0959032465166316) internal successors, (189474), 172893 states have internal predecessors, (189474), 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:54:23,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172894 states to 172894 states and 189474 transitions. [2025-01-08 23:54:23,633 INFO L78 Accepts]: Start accepts. Automaton has 172894 states and 189474 transitions. Word has length 516 [2025-01-08 23:54:23,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:23,634 INFO L471 AbstractCegarLoop]: Abstraction has 172894 states and 189474 transitions. [2025-01-08 23:54:23,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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:54:23,634 INFO L276 IsEmpty]: Start isEmpty. Operand 172894 states and 189474 transitions. [2025-01-08 23:54:23,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2025-01-08 23:54:23,658 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:23,662 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:23,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:54:23,662 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:23,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:23,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1742008392, now seen corresponding path program 1 times [2025-01-08 23:54:23,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:23,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822966460] [2025-01-08 23:54:23,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:23,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:23,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-01-08 23:54:23,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-01-08 23:54:23,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:23,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:24,037 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2025-01-08 23:54:24,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:24,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822966460] [2025-01-08 23:54:24,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822966460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:24,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:24,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:54:24,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649402866] [2025-01-08 23:54:24,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:24,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:24,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:24,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:24,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:24,040 INFO L87 Difference]: Start difference. First operand 172894 states and 189474 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 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:54:26,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:26,361 INFO L93 Difference]: Finished difference Result 344191 states and 377311 transitions. [2025-01-08 23:54:26,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:26,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 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 525 [2025-01-08 23:54:26,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:26,590 INFO L225 Difference]: With dead ends: 344191 [2025-01-08 23:54:26,590 INFO L226 Difference]: Without dead ends: 172086 [2025-01-08 23:54:26,677 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:54:26,678 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 1639 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1639 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:26,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1639 Valid, 303 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1500 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-08 23:54:26,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172086 states. [2025-01-08 23:54:28,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172086 to 172084. [2025-01-08 23:54:28,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172084 states, 172083 states have (on average 1.0960176194045896) internal successors, (188606), 172083 states have internal predecessors, (188606), 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:54:28,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172084 states to 172084 states and 188606 transitions. [2025-01-08 23:54:28,537 INFO L78 Accepts]: Start accepts. Automaton has 172084 states and 188606 transitions. Word has length 525 [2025-01-08 23:54:28,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:28,537 INFO L471 AbstractCegarLoop]: Abstraction has 172084 states and 188606 transitions. [2025-01-08 23:54:28,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 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:54:28,538 INFO L276 IsEmpty]: Start isEmpty. Operand 172084 states and 188606 transitions. [2025-01-08 23:54:28,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2025-01-08 23:54:28,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:28,565 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:28,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:54:28,565 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:28,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:28,565 INFO L85 PathProgramCache]: Analyzing trace with hash -338353743, now seen corresponding path program 1 times [2025-01-08 23:54:28,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:28,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730791124] [2025-01-08 23:54:28,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:28,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:28,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-01-08 23:54:28,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-01-08 23:54:28,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:28,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:29,748 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 316 proven. 110 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-08 23:54:29,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:29,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730791124] [2025-01-08 23:54:29,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730791124] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:54:29,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190648863] [2025-01-08 23:54:29,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:29,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:54:29,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:54:29,751 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:54:29,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 23:54:29,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-01-08 23:54:29,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-01-08 23:54:29,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:29,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:29,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:54:29,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:54:29,948 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2025-01-08 23:54:29,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:54:29,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190648863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:29,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:54:29,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:54:29,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161063370] [2025-01-08 23:54:29,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:29,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:29,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:29,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:29,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:54:29,949 INFO L87 Difference]: Start difference. First operand 172084 states and 188606 transitions. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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:54:33,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:33,513 INFO L93 Difference]: Finished difference Result 342595 states and 375617 transitions. [2025-01-08 23:54:33,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:33,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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 623 [2025-01-08 23:54:33,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:33,737 INFO L225 Difference]: With dead ends: 342595 [2025-01-08 23:54:33,737 INFO L226 Difference]: Without dead ends: 171300 [2025-01-08 23:54:33,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 622 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:54:33,851 INFO L435 NwaCegarLoop]: 1694 mSDtfsCounter, 830 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2457 mSolverCounterSat, 608 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 1830 SdHoareTripleChecker+Invalid, 3065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 608 IncrementalHoareTripleChecker+Valid, 2457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:33,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 1830 Invalid, 3065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [608 Valid, 2457 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:54:33,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171300 states. [2025-01-08 23:54:35,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171300 to 165775. [2025-01-08 23:54:35,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165775 states, 165774 states have (on average 1.0753978307816665) internal successors, (178273), 165774 states have internal predecessors, (178273), 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:54:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165775 states to 165775 states and 178273 transitions. [2025-01-08 23:54:35,699 INFO L78 Accepts]: Start accepts. Automaton has 165775 states and 178273 transitions. Word has length 623 [2025-01-08 23:54:35,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:35,699 INFO L471 AbstractCegarLoop]: Abstraction has 165775 states and 178273 transitions. [2025-01-08 23:54:35,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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:54:35,700 INFO L276 IsEmpty]: Start isEmpty. Operand 165775 states and 178273 transitions. [2025-01-08 23:54:35,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2025-01-08 23:54:35,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:35,725 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:54:35,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 23:54:35,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:54:35,927 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:35,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:35,927 INFO L85 PathProgramCache]: Analyzing trace with hash -81798588, now seen corresponding path program 1 times [2025-01-08 23:54:35,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:35,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954602317] [2025-01-08 23:54:35,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:35,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:36,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 655 statements into 1 equivalence classes. [2025-01-08 23:54:36,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 655 of 655 statements. [2025-01-08 23:54:36,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:36,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 589 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-01-08 23:54:36,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:36,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954602317] [2025-01-08 23:54:36,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954602317] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:36,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:36,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:54:36,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712590884] [2025-01-08 23:54:36,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:36,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:36,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:36,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:36,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:36,372 INFO L87 Difference]: Start difference. First operand 165775 states and 178273 transitions. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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:54:39,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:39,579 INFO L93 Difference]: Finished difference Result 315653 states and 338628 transitions. [2025-01-08 23:54:39,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:39,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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 655 [2025-01-08 23:54:39,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:39,732 INFO L225 Difference]: With dead ends: 315653 [2025-01-08 23:54:39,732 INFO L226 Difference]: Without dead ends: 139641 [2025-01-08 23:54:39,799 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:54:39,800 INFO L435 NwaCegarLoop]: 1453 mSDtfsCounter, 990 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 2320 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:39,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 1576 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2320 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:54:39,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139641 states. [2025-01-08 23:54:40,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139641 to 133339. [2025-01-08 23:54:40,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133339 states, 133338 states have (on average 1.0514631987880425) internal successors, (140200), 133338 states have internal predecessors, (140200), 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:54:41,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133339 states to 133339 states and 140200 transitions. [2025-01-08 23:54:41,374 INFO L78 Accepts]: Start accepts. Automaton has 133339 states and 140200 transitions. Word has length 655 [2025-01-08 23:54:41,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:41,374 INFO L471 AbstractCegarLoop]: Abstraction has 133339 states and 140200 transitions. [2025-01-08 23:54:41,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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:54:41,377 INFO L276 IsEmpty]: Start isEmpty. Operand 133339 states and 140200 transitions. [2025-01-08 23:54:41,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2025-01-08 23:54:41,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:41,428 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:54:41,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 23:54:41,429 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:41,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:41,429 INFO L85 PathProgramCache]: Analyzing trace with hash -846793796, now seen corresponding path program 1 times [2025-01-08 23:54:41,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:41,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48405027] [2025-01-08 23:54:41,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:41,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:41,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 736 statements into 1 equivalence classes. [2025-01-08 23:54:41,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 736 of 736 statements. [2025-01-08 23:54:41,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:41,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:42,005 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 610 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-01-08 23:54:42,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:42,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48405027] [2025-01-08 23:54:42,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48405027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:42,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:42,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:54:42,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984906370] [2025-01-08 23:54:42,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:42,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:42,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:42,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:42,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:42,011 INFO L87 Difference]: Start difference. First operand 133339 states and 140200 transitions. Second operand has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 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:54:46,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:46,235 INFO L93 Difference]: Finished difference Result 327394 states and 344170 transitions. [2025-01-08 23:54:46,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:46,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 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 736 [2025-01-08 23:54:46,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:46,415 INFO L225 Difference]: With dead ends: 327394 [2025-01-08 23:54:46,416 INFO L226 Difference]: Without dead ends: 194844 [2025-01-08 23:54:46,449 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:54:46,450 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 825 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 2879 mSolverCounterSat, 524 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 3403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 524 IncrementalHoareTripleChecker+Valid, 2879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:46,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 797 Invalid, 3403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [524 Valid, 2879 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-08 23:54:46,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194844 states.