./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label46.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/Problem19_label46.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 8cf4f28b762443394edafed0f3ab08c0ba6ed0f26d824c46d396477f011c5356 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:27:35,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:27:35,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:27:35,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:27:35,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:27:35,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:27:35,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:27:35,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:27:35,831 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:27:35,831 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:27:35,831 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:27:35,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:27:35,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:27:35,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:27:35,831 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:27:35,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:27:35,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:27:35,832 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:27:35,832 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:27:35,832 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:27:35,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:27:35,832 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:27:35,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:27:35,832 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:27:35,832 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:27:35,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:27:35,836 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:27:35,837 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:27:35,837 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:27:35,837 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:27:35,837 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:27:35,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:27:35,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:27:35,837 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:27:35,837 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:27:35,837 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:27:35,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:27:35,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:27:35,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:27:35,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:27:35,837 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:27:35,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:27:35,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:27:35,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:27:35,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:27:35,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:27:35,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:27:35,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:27:35,837 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 -> 8cf4f28b762443394edafed0f3ab08c0ba6ed0f26d824c46d396477f011c5356 [2025-01-09 00:27:36,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:27:36,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:27:36,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:27:36,144 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:27:36,144 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:27:36,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label46.c [2025-01-09 00:27:37,428 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/413a64723/5c1ca3052b7f45548446e2711a81d16a/FLAG8e17eb846 [2025-01-09 00:27:37,992 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:27:37,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label46.c [2025-01-09 00:27:38,034 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/413a64723/5c1ca3052b7f45548446e2711a81d16a/FLAG8e17eb846 [2025-01-09 00:27:38,048 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/413a64723/5c1ca3052b7f45548446e2711a81d16a [2025-01-09 00:27:38,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:27:38,051 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:27:38,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:27:38,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:27:38,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:27:38,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:27:38" (1/1) ... [2025-01-09 00:27:38,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1863095e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:38, skipping insertion in model container [2025-01-09 00:27:38,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:27:38" (1/1) ... [2025-01-09 00:27:38,172 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:27:38,498 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/Problem19_label46.c[4445,4458] [2025-01-09 00:27:39,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:27:39,380 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:27:39,397 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/Problem19_label46.c[4445,4458] [2025-01-09 00:27:39,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:27:39,879 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:27:39,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:39 WrapperNode [2025-01-09 00:27:39,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:27:39,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:27:39,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:27:39,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:27:39,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:39" (1/1) ... [2025-01-09 00:27:39,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:39" (1/1) ... [2025-01-09 00:27:40,574 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-01-09 00:27:40,575 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:27:40,576 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:27:40,576 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:27:40,576 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:27:40,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:39" (1/1) ... [2025-01-09 00:27:40,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:39" (1/1) ... [2025-01-09 00:27:40,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:39" (1/1) ... [2025-01-09 00:27:41,106 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 00:27:41,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:39" (1/1) ... [2025-01-09 00:27:41,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:39" (1/1) ... [2025-01-09 00:27:41,405 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:39" (1/1) ... [2025-01-09 00:27:41,427 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:39" (1/1) ... [2025-01-09 00:27:41,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:39" (1/1) ... [2025-01-09 00:27:41,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:39" (1/1) ... [2025-01-09 00:27:41,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:39" (1/1) ... [2025-01-09 00:27:41,637 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:27:41,640 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:27:41,640 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:27:41,640 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:27:41,641 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:39" (1/1) ... [2025-01-09 00:27:41,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:27:41,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:27:41,662 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:27:41,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:27:41,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:27:41,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:27:41,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:27:41,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:27:41,734 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:27:41,735 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:27:47,583 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-01-09 00:27:47,584 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:27:47,620 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:27:47,620 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:27:47,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:27:47 BoogieIcfgContainer [2025-01-09 00:27:47,621 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:27:47,622 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:27:47,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:27:47,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:27:47,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:27:38" (1/3) ... [2025-01-09 00:27:47,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db7b0fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:27:47, skipping insertion in model container [2025-01-09 00:27:47,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:39" (2/3) ... [2025-01-09 00:27:47,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db7b0fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:27:47, skipping insertion in model container [2025-01-09 00:27:47,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:27:47" (3/3) ... [2025-01-09 00:27:47,631 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label46.c [2025-01-09 00:27:47,642 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:27:47,643 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label46.c that has 1 procedures, 1748 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:27:47,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:27:47,744 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;@21f7dc7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:27:47,748 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:27:47,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:27:47,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 00:27:47,772 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:27:47,772 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] [2025-01-09 00:27:47,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:27:47,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:27:47,781 INFO L85 PathProgramCache]: Analyzing trace with hash 771715890, now seen corresponding path program 1 times [2025-01-09 00:27:47,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:27:47,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479665590] [2025-01-09 00:27:47,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:27:47,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:27:47,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 00:27:47,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 00:27:47,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:27:47,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:27:48,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:27:48,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:27:48,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479665590] [2025-01-09 00:27:48,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479665590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:27:48,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:27:48,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:27:48,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196626086] [2025-01-09 00:27:48,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:27:48,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:27:48,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:27:48,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:27:48,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:27:48,097 INFO L87 Difference]: Start difference. First operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:27:54,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:27:54,299 INFO L93 Difference]: Finished difference Result 4957 states and 9395 transitions. [2025-01-09 00:27:54,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:27:54,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2025-01-09 00:27:54,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:27:54,324 INFO L225 Difference]: With dead ends: 4957 [2025-01-09 00:27:54,326 INFO L226 Difference]: Without dead ends: 3129 [2025-01-09 00:27:54,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:27:54,339 INFO L435 NwaCegarLoop]: 1377 mSDtfsCounter, 1594 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 4344 mSolverCounterSat, 1517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 5861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1517 IncrementalHoareTripleChecker+Valid, 4344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:27:54,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1594 Valid, 1599 Invalid, 5861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1517 Valid, 4344 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-01-09 00:27:54,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3129 states. [2025-01-09 00:27:54,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3129 to 3108. [2025-01-09 00:27:54,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3108 states, 3107 states have (on average 1.6012230447376892) internal successors, (4975), 3107 states have internal predecessors, (4975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:27:54,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 4975 transitions. [2025-01-09 00:27:54,479 INFO L78 Accepts]: Start accepts. Automaton has 3108 states and 4975 transitions. Word has length 32 [2025-01-09 00:27:54,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:27:54,480 INFO L471 AbstractCegarLoop]: Abstraction has 3108 states and 4975 transitions. [2025-01-09 00:27:54,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:27:54,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 4975 transitions. [2025-01-09 00:27:54,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 00:27:54,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:27:54,483 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:27:54,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:27:54,484 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:27:54,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:27:54,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1139336239, now seen corresponding path program 1 times [2025-01-09 00:27:54,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:27:54,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926218376] [2025-01-09 00:27:54,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:27:54,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:27:54,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 00:27:54,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 00:27:54,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:27:54,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:27:54,849 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:27:54,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:27:54,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926218376] [2025-01-09 00:27:54,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926218376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:27:54,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:27:54,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:27:54,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334916509] [2025-01-09 00:27:54,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:27:54,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:27:54,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:27:54,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:27:54,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:27:54,852 INFO L87 Difference]: Start difference. First operand 3108 states and 4975 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:03,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:28:03,923 INFO L93 Difference]: Finished difference Result 10359 states and 16187 transitions. [2025-01-09 00:28:03,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:28:03,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-09 00:28:03,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:28:03,966 INFO L225 Difference]: With dead ends: 10359 [2025-01-09 00:28:03,966 INFO L226 Difference]: Without dead ends: 7253 [2025-01-09 00:28:03,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:28:03,980 INFO L435 NwaCegarLoop]: 1027 mSDtfsCounter, 4323 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 9504 mSolverCounterSat, 1498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4323 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 11002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1498 IncrementalHoareTripleChecker+Valid, 9504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:28:03,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4323 Valid, 1298 Invalid, 11002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1498 Valid, 9504 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2025-01-09 00:28:03,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7253 states. [2025-01-09 00:28:04,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7253 to 7249. [2025-01-09 00:28:04,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7249 states, 7248 states have (on average 1.4503311258278146) internal successors, (10512), 7248 states have internal predecessors, (10512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:04,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7249 states to 7249 states and 10512 transitions. [2025-01-09 00:28:04,125 INFO L78 Accepts]: Start accepts. Automaton has 7249 states and 10512 transitions. Word has length 99 [2025-01-09 00:28:04,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:28:04,125 INFO L471 AbstractCegarLoop]: Abstraction has 7249 states and 10512 transitions. [2025-01-09 00:28:04,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:04,125 INFO L276 IsEmpty]: Start isEmpty. Operand 7249 states and 10512 transitions. [2025-01-09 00:28:04,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-01-09 00:28:04,131 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:28:04,131 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:28:04,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:28:04,131 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:28:04,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:28:04,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1078593577, now seen corresponding path program 1 times [2025-01-09 00:28:04,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:28:04,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457738388] [2025-01-09 00:28:04,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:28:04,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:28:04,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-01-09 00:28:04,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-01-09 00:28:04,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:28:04,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:28:05,086 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 00:28:05,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:28:05,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457738388] [2025-01-09 00:28:05,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457738388] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:28:05,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:28:05,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:28:05,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204179390] [2025-01-09 00:28:05,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:28:05,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:28:05,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:28:05,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:28:05,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:28:05,087 INFO L87 Difference]: Start difference. First operand 7249 states and 10512 transitions. Second operand has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:12,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:28:12,907 INFO L93 Difference]: Finished difference Result 17269 states and 24867 transitions. [2025-01-09 00:28:12,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:28:12,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 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 306 [2025-01-09 00:28:12,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:28:12,962 INFO L225 Difference]: With dead ends: 17269 [2025-01-09 00:28:12,962 INFO L226 Difference]: Without dead ends: 11387 [2025-01-09 00:28:12,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:28:12,982 INFO L435 NwaCegarLoop]: 1804 mSDtfsCounter, 3756 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 9455 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3756 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 9885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 9455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:28:12,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3756 Valid, 2159 Invalid, 9885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 9455 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2025-01-09 00:28:13,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11387 states. [2025-01-09 00:28:13,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11387 to 11367. [2025-01-09 00:28:13,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11367 states, 11366 states have (on average 1.3286116487770543) internal successors, (15101), 11366 states have internal predecessors, (15101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11367 states to 11367 states and 15101 transitions. [2025-01-09 00:28:13,381 INFO L78 Accepts]: Start accepts. Automaton has 11367 states and 15101 transitions. Word has length 306 [2025-01-09 00:28:13,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:28:13,385 INFO L471 AbstractCegarLoop]: Abstraction has 11367 states and 15101 transitions. [2025-01-09 00:28:13,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:13,386 INFO L276 IsEmpty]: Start isEmpty. Operand 11367 states and 15101 transitions. [2025-01-09 00:28:13,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-01-09 00:28:13,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:28:13,388 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:28:13,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:28:13,388 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:28:13,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:28:13,389 INFO L85 PathProgramCache]: Analyzing trace with hash 862688253, now seen corresponding path program 1 times [2025-01-09 00:28:13,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:28:13,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308322141] [2025-01-09 00:28:13,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:28:13,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:28:13,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-01-09 00:28:13,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-01-09 00:28:13,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:28:13,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:28:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 00:28:13,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:28:13,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308322141] [2025-01-09 00:28:13,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308322141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:28:13,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:28:13,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:28:13,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265919733] [2025-01-09 00:28:13,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:28:13,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:28:13,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:28:13,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:28:13,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:28:13,947 INFO L87 Difference]: Start difference. First operand 11367 states and 15101 transitions. Second operand has 4 states, 4 states have (on average 82.75) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:18,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:28:18,863 INFO L93 Difference]: Finished difference Result 20033 states and 27483 transitions. [2025-01-09 00:28:18,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:28:18,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 334 [2025-01-09 00:28:18,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:28:18,884 INFO L225 Difference]: With dead ends: 20033 [2025-01-09 00:28:18,884 INFO L226 Difference]: Without dead ends: 11367 [2025-01-09 00:28:18,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:28:18,892 INFO L435 NwaCegarLoop]: 1775 mSDtfsCounter, 1138 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 7325 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 7333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:28:18,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2117 Invalid, 7333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7325 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-01-09 00:28:18,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11367 states. [2025-01-09 00:28:19,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11367 to 11367. [2025-01-09 00:28:19,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11367 states, 11366 states have (on average 1.3274678866795706) internal successors, (15088), 11366 states have internal predecessors, (15088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:19,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11367 states to 11367 states and 15088 transitions. [2025-01-09 00:28:19,045 INFO L78 Accepts]: Start accepts. Automaton has 11367 states and 15088 transitions. Word has length 334 [2025-01-09 00:28:19,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:28:19,045 INFO L471 AbstractCegarLoop]: Abstraction has 11367 states and 15088 transitions. [2025-01-09 00:28:19,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:19,046 INFO L276 IsEmpty]: Start isEmpty. Operand 11367 states and 15088 transitions. [2025-01-09 00:28:19,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-01-09 00:28:19,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:28:19,051 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:28:19,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:28:19,051 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:28:19,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:28:19,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1084776895, now seen corresponding path program 1 times [2025-01-09 00:28:19,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:28:19,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155798828] [2025-01-09 00:28:19,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:28:19,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:28:19,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-01-09 00:28:19,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-01-09 00:28:19,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:28:19,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:28:19,470 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:28:19,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:28:19,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155798828] [2025-01-09 00:28:19,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155798828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:28:19,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:28:19,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:28:19,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383265525] [2025-01-09 00:28:19,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:28:19,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:28:19,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:28:19,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:28:19,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:28:19,473 INFO L87 Difference]: Start difference. First operand 11367 states and 15088 transitions. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:24,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:28:24,759 INFO L93 Difference]: Finished difference Result 25557 states and 36131 transitions. [2025-01-09 00:28:24,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:28:24,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 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 519 [2025-01-09 00:28:24,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:28:24,783 INFO L225 Difference]: With dead ends: 25557 [2025-01-09 00:28:24,784 INFO L226 Difference]: Without dead ends: 16922 [2025-01-09 00:28:24,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:28:24,791 INFO L435 NwaCegarLoop]: 2756 mSDtfsCounter, 1489 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 4068 mSolverCounterSat, 1816 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 2933 SdHoareTripleChecker+Invalid, 5884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1816 IncrementalHoareTripleChecker+Valid, 4068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:28:24,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1489 Valid, 2933 Invalid, 5884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1816 Valid, 4068 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-01-09 00:28:24,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16922 states. [2025-01-09 00:28:24,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16922 to 16876. [2025-01-09 00:28:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16876 states, 16875 states have (on average 1.2959407407407408) internal successors, (21869), 16875 states have internal predecessors, (21869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:24,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16876 states to 16876 states and 21869 transitions. [2025-01-09 00:28:24,937 INFO L78 Accepts]: Start accepts. Automaton has 16876 states and 21869 transitions. Word has length 519 [2025-01-09 00:28:24,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:28:24,937 INFO L471 AbstractCegarLoop]: Abstraction has 16876 states and 21869 transitions. [2025-01-09 00:28:24,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:24,938 INFO L276 IsEmpty]: Start isEmpty. Operand 16876 states and 21869 transitions. [2025-01-09 00:28:24,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2025-01-09 00:28:24,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:28:24,944 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:28:24,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:28:24,944 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:28:24,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:28:24,945 INFO L85 PathProgramCache]: Analyzing trace with hash -728999592, now seen corresponding path program 1 times [2025-01-09 00:28:24,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:28:24,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742070601] [2025-01-09 00:28:24,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:28:24,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:28:24,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 588 statements into 1 equivalence classes. [2025-01-09 00:28:25,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 588 of 588 statements. [2025-01-09 00:28:25,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:28:25,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:28:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 81 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:28:25,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:28:25,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742070601] [2025-01-09 00:28:25,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742070601] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:28:25,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874396706] [2025-01-09 00:28:25,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:28:25,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:28:25,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:28:25,692 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:28:25,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:28:25,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 588 statements into 1 equivalence classes. [2025-01-09 00:28:25,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 588 of 588 statements. [2025-01-09 00:28:25,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:28:25,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:28:25,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:28:25,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:28:25,979 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:28:25,979 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:28:25,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874396706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:28:25,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:28:25,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:28:25,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505960236] [2025-01-09 00:28:25,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:28:25,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:28:25,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:28:25,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:28:25,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:28:25,981 INFO L87 Difference]: Start difference. First operand 16876 states and 21869 transitions. Second operand has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:31,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:28:31,446 INFO L93 Difference]: Finished difference Result 43303 states and 57896 transitions. [2025-01-09 00:28:31,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:28:31,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 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 588 [2025-01-09 00:28:31,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:28:31,500 INFO L225 Difference]: With dead ends: 43303 [2025-01-09 00:28:31,500 INFO L226 Difference]: Without dead ends: 29159 [2025-01-09 00:28:31,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 587 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:28:31,518 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 2533 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4054 mSolverCounterSat, 1472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2533 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 5526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1472 IncrementalHoareTripleChecker+Valid, 4054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:28:31,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2533 Valid, 814 Invalid, 5526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1472 Valid, 4054 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-01-09 00:28:31,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29159 states. [2025-01-09 00:28:31,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29159 to 29155. [2025-01-09 00:28:31,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29155 states, 29154 states have (on average 1.297592097139329) internal successors, (37830), 29154 states have internal predecessors, (37830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:31,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29155 states to 29155 states and 37830 transitions. [2025-01-09 00:28:31,914 INFO L78 Accepts]: Start accepts. Automaton has 29155 states and 37830 transitions. Word has length 588 [2025-01-09 00:28:31,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:28:31,915 INFO L471 AbstractCegarLoop]: Abstraction has 29155 states and 37830 transitions. [2025-01-09 00:28:31,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:31,915 INFO L276 IsEmpty]: Start isEmpty. Operand 29155 states and 37830 transitions. [2025-01-09 00:28:31,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-01-09 00:28:31,923 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:28:31,924 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:28:31,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 00:28:32,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:28:32,125 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:28:32,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:28:32,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1928633097, now seen corresponding path program 1 times [2025-01-09 00:28:32,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:28:32,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014443576] [2025-01-09 00:28:32,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:28:32,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:28:32,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-01-09 00:28:32,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-01-09 00:28:32,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:28:32,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:28:33,169 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 59 proven. 40 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-01-09 00:28:33,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:28:33,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014443576] [2025-01-09 00:28:33,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014443576] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:28:33,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474324177] [2025-01-09 00:28:33,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:28:33,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:28:33,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:28:33,173 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:28:33,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 00:28:33,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-01-09 00:28:33,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-01-09 00:28:33,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:28:33,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:28:33,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:28:33,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:28:33,459 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:28:33,459 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:28:33,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474324177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:28:33,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:28:33,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:28:33,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077626183] [2025-01-09 00:28:33,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:28:33,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:28:33,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:28:33,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:28:33,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:28:33,461 INFO L87 Difference]: Start difference. First operand 29155 states and 37830 transitions. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:38,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:28:38,509 INFO L93 Difference]: Finished difference Result 77415 states and 102356 transitions. [2025-01-09 00:28:38,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:28:38,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 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 641 [2025-01-09 00:28:38,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:28:38,582 INFO L225 Difference]: With dead ends: 77415 [2025-01-09 00:28:38,582 INFO L226 Difference]: Without dead ends: 50992 [2025-01-09 00:28:38,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 640 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:28:38,610 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 1544 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 3903 mSolverCounterSat, 1728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1544 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 5631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1728 IncrementalHoareTripleChecker+Valid, 3903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:28:38,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1544 Valid, 1671 Invalid, 5631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1728 Valid, 3903 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-01-09 00:28:38,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50992 states. [2025-01-09 00:28:38,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50992 to 46896. [2025-01-09 00:28:39,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46896 states, 46895 states have (on average 1.2159505277748162) internal successors, (57022), 46895 states have internal predecessors, (57022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:39,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46896 states to 46896 states and 57022 transitions. [2025-01-09 00:28:39,044 INFO L78 Accepts]: Start accepts. Automaton has 46896 states and 57022 transitions. Word has length 641 [2025-01-09 00:28:39,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:28:39,045 INFO L471 AbstractCegarLoop]: Abstraction has 46896 states and 57022 transitions. [2025-01-09 00:28:39,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:39,045 INFO L276 IsEmpty]: Start isEmpty. Operand 46896 states and 57022 transitions. [2025-01-09 00:28:39,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2025-01-09 00:28:39,053 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:28:39,054 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:28:39,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 00:28:39,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:28:39,254 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:28:39,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:28:39,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1146741673, now seen corresponding path program 1 times [2025-01-09 00:28:39,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:28:39,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195956384] [2025-01-09 00:28:39,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:28:39,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:28:39,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-01-09 00:28:39,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-01-09 00:28:39,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:28:39,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:28:39,626 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-01-09 00:28:39,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:28:39,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195956384] [2025-01-09 00:28:39,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195956384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:28:39,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:28:39,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:28:39,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512127211] [2025-01-09 00:28:39,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:28:39,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:28:39,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:28:39,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:28:39,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:28:39,628 INFO L87 Difference]: Start difference. First operand 46896 states and 57022 transitions. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:44,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:28:44,991 INFO L93 Difference]: Finished difference Result 108820 states and 133070 transitions. [2025-01-09 00:28:44,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:28:44,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 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 731 [2025-01-09 00:28:44,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:28:45,056 INFO L225 Difference]: With dead ends: 108820 [2025-01-09 00:28:45,056 INFO L226 Difference]: Without dead ends: 64656 [2025-01-09 00:28:45,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:28:45,079 INFO L435 NwaCegarLoop]: 3065 mSDtfsCounter, 1379 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 4589 mSolverCounterSat, 915 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1379 SdHoareTripleChecker+Valid, 3251 SdHoareTripleChecker+Invalid, 5504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 915 IncrementalHoareTripleChecker+Valid, 4589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:28:45,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1379 Valid, 3251 Invalid, 5504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [915 Valid, 4589 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-01-09 00:28:45,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64656 states. [2025-01-09 00:28:45,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64656 to 56459. [2025-01-09 00:28:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56459 states, 56458 states have (on average 1.190566438768642) internal successors, (67217), 56458 states have internal predecessors, (67217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:45,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56459 states to 56459 states and 67217 transitions. [2025-01-09 00:28:45,628 INFO L78 Accepts]: Start accepts. Automaton has 56459 states and 67217 transitions. Word has length 731 [2025-01-09 00:28:45,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:28:45,629 INFO L471 AbstractCegarLoop]: Abstraction has 56459 states and 67217 transitions. [2025-01-09 00:28:45,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:45,629 INFO L276 IsEmpty]: Start isEmpty. Operand 56459 states and 67217 transitions. [2025-01-09 00:28:45,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 739 [2025-01-09 00:28:45,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:28:45,633 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:28:45,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:28:45,634 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:28:45,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:28:45,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1767339679, now seen corresponding path program 1 times [2025-01-09 00:28:45,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:28:45,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983656325] [2025-01-09 00:28:45,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:28:45,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:28:45,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 738 statements into 1 equivalence classes. [2025-01-09 00:28:45,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 738 of 738 statements. [2025-01-09 00:28:45,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:28:45,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:28:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 81 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:28:46,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:28:46,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983656325] [2025-01-09 00:28:46,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983656325] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:28:46,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62347553] [2025-01-09 00:28:46,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:28:46,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:28:46,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:28:46,785 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:28:46,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 00:28:46,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 738 statements into 1 equivalence classes. [2025-01-09 00:28:46,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 738 of 738 statements. [2025-01-09 00:28:46,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:28:46,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:28:46,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:28:46,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:28:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-01-09 00:28:47,030 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:28:47,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62347553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:28:47,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:28:47,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:28:47,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353062412] [2025-01-09 00:28:47,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:28:47,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:28:47,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:28:47,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:28:47,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:28:47,032 INFO L87 Difference]: Start difference. First operand 56459 states and 67217 transitions. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:52,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:28:52,600 INFO L93 Difference]: Finished difference Result 138928 states and 167694 transitions. [2025-01-09 00:28:52,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:28:52,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 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 738 [2025-01-09 00:28:52,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:28:52,712 INFO L225 Difference]: With dead ends: 138928 [2025-01-09 00:28:52,712 INFO L226 Difference]: Without dead ends: 85201 [2025-01-09 00:28:52,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 737 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:28:52,768 INFO L435 NwaCegarLoop]: 3073 mSDtfsCounter, 1447 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 4993 mSolverCounterSat, 990 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1447 SdHoareTripleChecker+Valid, 3244 SdHoareTripleChecker+Invalid, 5983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 990 IncrementalHoareTripleChecker+Valid, 4993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:28:52,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1447 Valid, 3244 Invalid, 5983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [990 Valid, 4993 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-01-09 00:28:52,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85201 states. [2025-01-09 00:28:53,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85201 to 85137. [2025-01-09 00:28:53,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85137 states, 85136 states have (on average 1.1609424920127795) internal successors, (98838), 85136 states have internal predecessors, (98838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85137 states to 85137 states and 98838 transitions. [2025-01-09 00:28:53,667 INFO L78 Accepts]: Start accepts. Automaton has 85137 states and 98838 transitions. Word has length 738 [2025-01-09 00:28:53,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:28:53,667 INFO L471 AbstractCegarLoop]: Abstraction has 85137 states and 98838 transitions. [2025-01-09 00:28:53,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:53,668 INFO L276 IsEmpty]: Start isEmpty. Operand 85137 states and 98838 transitions. [2025-01-09 00:28:53,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 826 [2025-01-09 00:28:53,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:28:53,673 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:28:53,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 00:28:53,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:28:53,874 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:28:53,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:28:53,875 INFO L85 PathProgramCache]: Analyzing trace with hash -789081500, now seen corresponding path program 1 times [2025-01-09 00:28:53,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:28:53,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721440389] [2025-01-09 00:28:53,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:28:53,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:28:53,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 825 statements into 1 equivalence classes. [2025-01-09 00:28:53,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 825 of 825 statements. [2025-01-09 00:28:53,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:28:53,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:28:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-01-09 00:28:54,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:28:54,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721440389] [2025-01-09 00:28:54,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721440389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:28:54,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:28:54,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:28:54,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532360383] [2025-01-09 00:28:54,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:28:54,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:28:54,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:28:54,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:28:54,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:28:54,121 INFO L87 Difference]: Start difference. First operand 85137 states and 98838 transitions. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:59,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:28:59,666 INFO L93 Difference]: Finished difference Result 193497 states and 228460 transitions. [2025-01-09 00:28:59,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:28:59,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 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 825 [2025-01-09 00:28:59,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:28:59,819 INFO L225 Difference]: With dead ends: 193497 [2025-01-09 00:28:59,819 INFO L226 Difference]: Without dead ends: 111092 [2025-01-09 00:28:59,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:28:59,869 INFO L435 NwaCegarLoop]: 1475 mSDtfsCounter, 1521 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 4024 mSolverCounterSat, 1697 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 5721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1697 IncrementalHoareTripleChecker+Valid, 4024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:28:59,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1663 Invalid, 5721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1697 Valid, 4024 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-01-09 00:28:59,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111092 states. [2025-01-09 00:29:00,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111092 to 86455. [2025-01-09 00:29:00,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86455 states, 86454 states have (on average 1.1588243458949268) internal successors, (100185), 86454 states have internal predecessors, (100185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:29:00,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86455 states to 86455 states and 100185 transitions. [2025-01-09 00:29:00,935 INFO L78 Accepts]: Start accepts. Automaton has 86455 states and 100185 transitions. Word has length 825 [2025-01-09 00:29:00,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:29:00,935 INFO L471 AbstractCegarLoop]: Abstraction has 86455 states and 100185 transitions. [2025-01-09 00:29:00,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:29:00,935 INFO L276 IsEmpty]: Start isEmpty. Operand 86455 states and 100185 transitions. [2025-01-09 00:29:00,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 892 [2025-01-09 00:29:00,948 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:29:00,949 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:29:00,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:29:00,949 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:29:00,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:29:00,950 INFO L85 PathProgramCache]: Analyzing trace with hash 824973962, now seen corresponding path program 1 times [2025-01-09 00:29:00,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:29:00,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943826566] [2025-01-09 00:29:00,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:29:00,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:29:01,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 891 statements into 1 equivalence classes. [2025-01-09 00:29:01,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 891 of 891 statements. [2025-01-09 00:29:01,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:29:01,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:29:01,856 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 408 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-01-09 00:29:01,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:29:01,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943826566] [2025-01-09 00:29:01,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943826566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:29:01,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:29:01,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:29:01,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823933190] [2025-01-09 00:29:01,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:29:01,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:29:01,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:29:01,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:29:01,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:29:01,862 INFO L87 Difference]: Start difference. First operand 86455 states and 100185 transitions. Second operand has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)