./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label59.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/Problem11_label59.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 b318f94936d789f3e225c0b031e22ed136ba6b0572610da57c85f0ad4ebaa0a1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:43:37,833 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:43:37,908 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:43:37,913 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:43:37,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:43:37,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:43:37,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:43:37,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:43:37,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:43:37,933 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:43:37,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:43:37,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:43:37,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:43:37,935 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:43:37,935 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:43:37,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:43:37,935 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:43:37,935 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:43:37,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:43:37,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:43:37,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:43:37,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:43:37,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:43:37,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:43:37,936 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:43:37,936 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:43:37,936 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:43:37,936 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:43:37,936 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:43:37,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:43:37,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:43:37,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:43:37,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:43:37,936 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:43:37,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:43:37,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:43:37,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:43:37,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:43:37,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:43:37,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:43:37,937 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:43:37,937 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:43:37,937 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:43:37,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:43:37,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:43:37,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:43:37,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:43:37,939 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:43:37,939 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 -> b318f94936d789f3e225c0b031e22ed136ba6b0572610da57c85f0ad4ebaa0a1 [2025-01-08 23:43:38,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:43:38,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:43:38,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:43:38,244 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:43:38,245 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:43:38,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label59.c [2025-01-08 23:43:39,483 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2386d4bdd/a35238e241f045e984db0963f64f5061/FLAGeae82b5a0 [2025-01-08 23:43:39,923 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:43:39,928 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label59.c [2025-01-08 23:43:39,944 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2386d4bdd/a35238e241f045e984db0963f64f5061/FLAGeae82b5a0 [2025-01-08 23:43:39,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2386d4bdd/a35238e241f045e984db0963f64f5061 [2025-01-08 23:43:39,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:43:39,968 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:43:39,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:43:39,971 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:43:39,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:43:39,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:43:39" (1/1) ... [2025-01-08 23:43:39,978 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8347b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:39, skipping insertion in model container [2025-01-08 23:43:39,978 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:43:39" (1/1) ... [2025-01-08 23:43:40,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:43:40,207 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/Problem11_label59.c[8515,8528] [2025-01-08 23:43:40,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:43:40,367 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:43:40,396 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/Problem11_label59.c[8515,8528] [2025-01-08 23:43:40,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:43:40,497 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:43:40,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:40 WrapperNode [2025-01-08 23:43:40,499 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:43:40,500 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:43:40,500 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:43:40,500 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:43:40,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:40" (1/1) ... [2025-01-08 23:43:40,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:40" (1/1) ... [2025-01-08 23:43:40,625 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-01-08 23:43:40,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:43:40,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:43:40,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:43:40,627 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:43:40,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:40" (1/1) ... [2025-01-08 23:43:40,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:40" (1/1) ... [2025-01-08 23:43:40,644 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:40" (1/1) ... [2025-01-08 23:43:40,731 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 23:43:40,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:40" (1/1) ... [2025-01-08 23:43:40,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:40" (1/1) ... [2025-01-08 23:43:40,778 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:40" (1/1) ... [2025-01-08 23:43:40,787 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:40" (1/1) ... [2025-01-08 23:43:40,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:40" (1/1) ... [2025-01-08 23:43:40,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:40" (1/1) ... [2025-01-08 23:43:40,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:40" (1/1) ... [2025-01-08 23:43:40,840 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:43:40,842 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:43:40,842 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:43:40,842 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:43:40,843 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:40" (1/1) ... [2025-01-08 23:43:40,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:43:40,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:43:40,872 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:43:40,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:43:40,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:43:40,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:43:40,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:43:40,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:43:40,954 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:43:40,955 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:43:42,339 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-01-08 23:43:42,340 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:43:42,357 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:43:42,357 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:43:42,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:43:42 BoogieIcfgContainer [2025-01-08 23:43:42,358 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:43:42,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:43:42,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:43:42,367 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:43:42,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:43:39" (1/3) ... [2025-01-08 23:43:42,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d12ac3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:43:42, skipping insertion in model container [2025-01-08 23:43:42,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:43:40" (2/3) ... [2025-01-08 23:43:42,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d12ac3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:43:42, skipping insertion in model container [2025-01-08 23:43:42,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:43:42" (3/3) ... [2025-01-08 23:43:42,371 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label59.c [2025-01-08 23:43:42,385 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:43:42,387 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label59.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:43:42,453 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:43:42,464 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;@47faea6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:43:42,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:43:42,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:42,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-08 23:43:42,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:42,478 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:42,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:42,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:42,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1707620900, now seen corresponding path program 1 times [2025-01-08 23:43:42,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:42,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969973598] [2025-01-08 23:43:42,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:42,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:42,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-08 23:43:42,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-08 23:43:42,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:42,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:42,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:42,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:42,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969973598] [2025-01-08 23:43:42,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969973598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:42,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:42,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:43:42,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658601892] [2025-01-08 23:43:42,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:42,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:42,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:42,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:42,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:42,900 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 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 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:44,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:44,043 INFO L93 Difference]: Finished difference Result 763 states and 1349 transitions. [2025-01-08 23:43:44,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:44,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-01-08 23:43:44,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:44,055 INFO L225 Difference]: With dead ends: 763 [2025-01-08 23:43:44,056 INFO L226 Difference]: Without dead ends: 416 [2025-01-08 23:43:44,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:44,065 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 214 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:44,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 87 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-08 23:43:44,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-01-08 23:43:44,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 408. [2025-01-08 23:43:44,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.6142506142506143) internal successors, (657), 407 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 657 transitions. [2025-01-08 23:43:44,131 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 657 transitions. Word has length 59 [2025-01-08 23:43:44,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:44,131 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 657 transitions. [2025-01-08 23:43:44,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:44,132 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 657 transitions. [2025-01-08 23:43:44,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-08 23:43:44,135 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:44,136 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:44,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:43:44,136 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:44,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:44,137 INFO L85 PathProgramCache]: Analyzing trace with hash 391402238, now seen corresponding path program 1 times [2025-01-08 23:43:44,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:44,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730104676] [2025-01-08 23:43:44,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:44,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:44,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-08 23:43:44,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-08 23:43:44,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:44,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:44,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:44,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730104676] [2025-01-08 23:43:44,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730104676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:44,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:44,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:43:44,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145116951] [2025-01-08 23:43:44,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:44,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:44,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:44,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:44,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:44,506 INFO L87 Difference]: Start difference. First operand 408 states and 657 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:45,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:45,317 INFO L93 Difference]: Finished difference Result 1011 states and 1633 transitions. [2025-01-08 23:43:45,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:45,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-01-08 23:43:45,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:45,323 INFO L225 Difference]: With dead ends: 1011 [2025-01-08 23:43:45,323 INFO L226 Difference]: Without dead ends: 605 [2025-01-08 23:43:45,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:45,328 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 147 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:45,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 119 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:43:45,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-01-08 23:43:45,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 595. [2025-01-08 23:43:45,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 1.4713804713804715) internal successors, (874), 594 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:45,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 874 transitions. [2025-01-08 23:43:45,364 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 874 transitions. Word has length 124 [2025-01-08 23:43:45,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:45,365 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 874 transitions. [2025-01-08 23:43:45,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:45,365 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 874 transitions. [2025-01-08 23:43:45,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-08 23:43:45,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:45,368 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:45,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:43:45,368 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:45,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:45,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1923407496, now seen corresponding path program 1 times [2025-01-08 23:43:45,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:45,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781970767] [2025-01-08 23:43:45,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:45,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:45,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-08 23:43:45,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-08 23:43:45,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:45,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:45,701 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:45,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:45,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781970767] [2025-01-08 23:43:45,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781970767] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:45,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:45,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:43:45,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593379584] [2025-01-08 23:43:45,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:45,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:45,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:45,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:45,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:45,704 INFO L87 Difference]: Start difference. First operand 595 states and 874 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:46,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:46,389 INFO L93 Difference]: Finished difference Result 1743 states and 2566 transitions. [2025-01-08 23:43:46,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:46,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-01-08 23:43:46,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:46,395 INFO L225 Difference]: With dead ends: 1743 [2025-01-08 23:43:46,395 INFO L226 Difference]: Without dead ends: 1150 [2025-01-08 23:43:46,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:46,397 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 122 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:46,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 193 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:43:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2025-01-08 23:43:46,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1148. [2025-01-08 23:43:46,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1147 states have (on average 1.2659110723626852) internal successors, (1452), 1147 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:46,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1452 transitions. [2025-01-08 23:43:46,435 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1452 transitions. Word has length 128 [2025-01-08 23:43:46,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:46,437 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1452 transitions. [2025-01-08 23:43:46,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:46,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1452 transitions. [2025-01-08 23:43:46,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-08 23:43:46,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:46,442 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:46,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:43:46,443 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:46,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:46,443 INFO L85 PathProgramCache]: Analyzing trace with hash 984009867, now seen corresponding path program 1 times [2025-01-08 23:43:46,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:46,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172136735] [2025-01-08 23:43:46,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:46,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:46,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-08 23:43:46,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-08 23:43:46,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:46,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:46,975 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:46,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:46,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172136735] [2025-01-08 23:43:46,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172136735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:46,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:46,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:46,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788918383] [2025-01-08 23:43:46,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:46,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:43:46,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:46,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:43:46,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:46,978 INFO L87 Difference]: Start difference. First operand 1148 states and 1452 transitions. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:48,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:48,303 INFO L93 Difference]: Finished difference Result 3421 states and 4575 transitions. [2025-01-08 23:43:48,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:43:48,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 202 [2025-01-08 23:43:48,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:48,313 INFO L225 Difference]: With dead ends: 3421 [2025-01-08 23:43:48,313 INFO L226 Difference]: Without dead ends: 2459 [2025-01-08 23:43:48,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:48,316 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 245 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:48,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 73 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-08 23:43:48,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2025-01-08 23:43:48,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2264. [2025-01-08 23:43:48,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2264 states, 2263 states have (on average 1.2823685373398144) internal successors, (2902), 2263 states have internal predecessors, (2902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:48,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 2902 transitions. [2025-01-08 23:43:48,359 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 2902 transitions. Word has length 202 [2025-01-08 23:43:48,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:48,360 INFO L471 AbstractCegarLoop]: Abstraction has 2264 states and 2902 transitions. [2025-01-08 23:43:48,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:48,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2902 transitions. [2025-01-08 23:43:48,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-01-08 23:43:48,364 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:48,364 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:43:48,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:43:48,364 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:48,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:48,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1107853819, now seen corresponding path program 1 times [2025-01-08 23:43:48,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:48,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423487324] [2025-01-08 23:43:48,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:48,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:48,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-08 23:43:48,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-08 23:43:48,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:48,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-08 23:43:48,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:48,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423487324] [2025-01-08 23:43:48,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423487324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:48,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:48,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:43:48,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431536854] [2025-01-08 23:43:48,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:48,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:48,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:48,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:48,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:48,577 INFO L87 Difference]: Start difference. First operand 2264 states and 2902 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:49,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:49,296 INFO L93 Difference]: Finished difference Result 5446 states and 7264 transitions. [2025-01-08 23:43:49,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:49,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 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 236 [2025-01-08 23:43:49,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:49,309 INFO L225 Difference]: With dead ends: 5446 [2025-01-08 23:43:49,309 INFO L226 Difference]: Without dead ends: 3552 [2025-01-08 23:43:49,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:49,312 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 127 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:49,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 154 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:43:49,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3552 states. [2025-01-08 23:43:49,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3552 to 3367. [2025-01-08 23:43:49,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3367 states, 3366 states have (on average 1.2507427213309565) internal successors, (4210), 3366 states have internal predecessors, (4210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:49,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3367 states to 3367 states and 4210 transitions. [2025-01-08 23:43:49,376 INFO L78 Accepts]: Start accepts. Automaton has 3367 states and 4210 transitions. Word has length 236 [2025-01-08 23:43:49,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:49,377 INFO L471 AbstractCegarLoop]: Abstraction has 3367 states and 4210 transitions. [2025-01-08 23:43:49,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:49,377 INFO L276 IsEmpty]: Start isEmpty. Operand 3367 states and 4210 transitions. [2025-01-08 23:43:49,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-01-08 23:43:49,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:49,380 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:43:49,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:43:49,381 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:49,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:49,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1499331878, now seen corresponding path program 1 times [2025-01-08 23:43:49,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:49,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723231013] [2025-01-08 23:43:49,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:49,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:49,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-01-08 23:43:49,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-01-08 23:43:49,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:49,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:49,620 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:49,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:49,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723231013] [2025-01-08 23:43:49,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723231013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:49,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:49,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:49,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616803466] [2025-01-08 23:43:49,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:49,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:49,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:49,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:49,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:49,623 INFO L87 Difference]: Start difference. First operand 3367 states and 4210 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:50,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:50,366 INFO L93 Difference]: Finished difference Result 7294 states and 9306 transitions. [2025-01-08 23:43:50,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:50,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 239 [2025-01-08 23:43:50,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:50,381 INFO L225 Difference]: With dead ends: 7294 [2025-01-08 23:43:50,382 INFO L226 Difference]: Without dead ends: 4297 [2025-01-08 23:43:50,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:50,387 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 135 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:50,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 331 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:43:50,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4297 states. [2025-01-08 23:43:50,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4297 to 4288. [2025-01-08 23:43:50,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4288 states, 4287 states have (on average 1.2346629344529974) internal successors, (5293), 4287 states have internal predecessors, (5293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:50,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4288 states to 4288 states and 5293 transitions. [2025-01-08 23:43:50,507 INFO L78 Accepts]: Start accepts. Automaton has 4288 states and 5293 transitions. Word has length 239 [2025-01-08 23:43:50,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:50,507 INFO L471 AbstractCegarLoop]: Abstraction has 4288 states and 5293 transitions. [2025-01-08 23:43:50,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:50,507 INFO L276 IsEmpty]: Start isEmpty. Operand 4288 states and 5293 transitions. [2025-01-08 23:43:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-01-08 23:43:50,510 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:50,511 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:43:50,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:43:50,511 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:50,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:50,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1182841083, now seen corresponding path program 1 times [2025-01-08 23:43:50,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:50,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313519440] [2025-01-08 23:43:50,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:50,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:50,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-01-08 23:43:50,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-01-08 23:43:50,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:50,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:50,744 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-08 23:43:50,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:50,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313519440] [2025-01-08 23:43:50,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313519440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:50,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:50,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:50,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957727582] [2025-01-08 23:43:50,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:50,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:50,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:50,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:50,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:50,746 INFO L87 Difference]: Start difference. First operand 4288 states and 5293 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:51,570 INFO L93 Difference]: Finished difference Result 11352 states and 14232 transitions. [2025-01-08 23:43:51,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:51,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 240 [2025-01-08 23:43:51,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:51,597 INFO L225 Difference]: With dead ends: 11352 [2025-01-08 23:43:51,597 INFO L226 Difference]: Without dead ends: 7248 [2025-01-08 23:43:51,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:51,605 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 167 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:51,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 330 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:43:51,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7248 states. [2025-01-08 23:43:51,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7248 to 6328. [2025-01-08 23:43:51,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6328 states, 6327 states have (on average 1.2299668089141773) internal successors, (7782), 6327 states have internal predecessors, (7782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:51,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6328 states to 6328 states and 7782 transitions. [2025-01-08 23:43:51,744 INFO L78 Accepts]: Start accepts. Automaton has 6328 states and 7782 transitions. Word has length 240 [2025-01-08 23:43:51,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:51,745 INFO L471 AbstractCegarLoop]: Abstraction has 6328 states and 7782 transitions. [2025-01-08 23:43:51,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:51,746 INFO L276 IsEmpty]: Start isEmpty. Operand 6328 states and 7782 transitions. [2025-01-08 23:43:51,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-01-08 23:43:51,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:51,750 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:43:51,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:43:51,750 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:51,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:51,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1589145882, now seen corresponding path program 1 times [2025-01-08 23:43:51,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:51,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768340963] [2025-01-08 23:43:51,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:51,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:51,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-01-08 23:43:51,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-01-08 23:43:51,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:51,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:52,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:52,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768340963] [2025-01-08 23:43:52,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768340963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:52,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:52,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:52,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835374266] [2025-01-08 23:43:52,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:52,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:43:52,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:52,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:43:52,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:52,121 INFO L87 Difference]: Start difference. First operand 6328 states and 7782 transitions. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:53,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:53,486 INFO L93 Difference]: Finished difference Result 14138 states and 17500 transitions. [2025-01-08 23:43:53,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:43:53,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 261 [2025-01-08 23:43:53,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:53,510 INFO L225 Difference]: With dead ends: 14138 [2025-01-08 23:43:53,510 INFO L226 Difference]: Without dead ends: 8179 [2025-01-08 23:43:53,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:53,518 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 226 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:53,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 147 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-08 23:43:53,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8179 states. [2025-01-08 23:43:53,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8179 to 7802. [2025-01-08 23:43:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7802 states, 7801 states have (on average 1.2108704012306115) internal successors, (9446), 7801 states have internal predecessors, (9446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:53,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7802 states to 7802 states and 9446 transitions. [2025-01-08 23:43:53,666 INFO L78 Accepts]: Start accepts. Automaton has 7802 states and 9446 transitions. Word has length 261 [2025-01-08 23:43:53,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:53,666 INFO L471 AbstractCegarLoop]: Abstraction has 7802 states and 9446 transitions. [2025-01-08 23:43:53,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:53,667 INFO L276 IsEmpty]: Start isEmpty. Operand 7802 states and 9446 transitions. [2025-01-08 23:43:53,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-01-08 23:43:53,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:53,673 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:43:53,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:43:53,674 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:53,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:53,675 INFO L85 PathProgramCache]: Analyzing trace with hash 2112748545, now seen corresponding path program 1 times [2025-01-08 23:43:53,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:53,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323753822] [2025-01-08 23:43:53,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:53,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:53,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-01-08 23:43:53,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-01-08 23:43:53,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:53,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:54,275 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 128 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:54,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:54,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323753822] [2025-01-08 23:43:54,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323753822] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:43:54,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333537695] [2025-01-08 23:43:54,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:54,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:43:54,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:43:54,280 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:43:54,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 23:43:54,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-01-08 23:43:54,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-01-08 23:43:54,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:54,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:54,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-08 23:43:54,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:43:54,720 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 128 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:43:54,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:43:54,898 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-08 23:43:54,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333537695] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 23:43:54,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 23:43:54,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 5 [2025-01-08 23:43:54,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589901842] [2025-01-08 23:43:54,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:54,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:54,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:54,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:54,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:43:54,902 INFO L87 Difference]: Start difference. First operand 7802 states and 9446 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:55,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:55,763 INFO L93 Difference]: Finished difference Result 14673 states and 17685 transitions. [2025-01-08 23:43:55,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:55,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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 313 [2025-01-08 23:43:55,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:55,784 INFO L225 Difference]: With dead ends: 14673 [2025-01-08 23:43:55,784 INFO L226 Difference]: Without dead ends: 7241 [2025-01-08 23:43:55,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:43:55,793 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 159 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:55,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 311 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:43:55,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7241 states. [2025-01-08 23:43:55,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7241 to 6502. [2025-01-08 23:43:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6502 states, 6501 states have (on average 1.1859713890170742) internal successors, (7710), 6501 states have internal predecessors, (7710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:55,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6502 states to 6502 states and 7710 transitions. [2025-01-08 23:43:55,907 INFO L78 Accepts]: Start accepts. Automaton has 6502 states and 7710 transitions. Word has length 313 [2025-01-08 23:43:55,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:55,907 INFO L471 AbstractCegarLoop]: Abstraction has 6502 states and 7710 transitions. [2025-01-08 23:43:55,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 6502 states and 7710 transitions. [2025-01-08 23:43:55,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-01-08 23:43:55,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:55,918 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:55,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 23:43:56,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:43:56,123 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:56,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:56,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1322690255, now seen corresponding path program 1 times [2025-01-08 23:43:56,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:56,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640356380] [2025-01-08 23:43:56,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:56,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:56,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-01-08 23:43:56,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-01-08 23:43:56,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:56,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:56,406 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-01-08 23:43:56,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:56,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640356380] [2025-01-08 23:43:56,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640356380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:56,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:56,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:56,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303619121] [2025-01-08 23:43:56,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:56,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:56,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:56,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:56,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:56,410 INFO L87 Difference]: Start difference. First operand 6502 states and 7710 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:57,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:57,135 INFO L93 Difference]: Finished difference Result 13927 states and 16578 transitions. [2025-01-08 23:43:57,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:57,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 381 [2025-01-08 23:43:57,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:57,151 INFO L225 Difference]: With dead ends: 13927 [2025-01-08 23:43:57,151 INFO L226 Difference]: Without dead ends: 7611 [2025-01-08 23:43:57,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:57,158 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 107 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:57,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 357 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:43:57,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7611 states. [2025-01-08 23:43:57,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7611 to 7422. [2025-01-08 23:43:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7422 states, 7421 states have (on average 1.178008354669182) internal successors, (8742), 7421 states have internal predecessors, (8742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:57,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7422 states to 7422 states and 8742 transitions. [2025-01-08 23:43:57,240 INFO L78 Accepts]: Start accepts. Automaton has 7422 states and 8742 transitions. Word has length 381 [2025-01-08 23:43:57,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:57,241 INFO L471 AbstractCegarLoop]: Abstraction has 7422 states and 8742 transitions. [2025-01-08 23:43:57,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:57,241 INFO L276 IsEmpty]: Start isEmpty. Operand 7422 states and 8742 transitions. [2025-01-08 23:43:57,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-01-08 23:43:57,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:57,252 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:57,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:43:57,252 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:57,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:57,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1753243126, now seen corresponding path program 1 times [2025-01-08 23:43:57,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:57,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262010945] [2025-01-08 23:43:57,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:57,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:57,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-01-08 23:43:57,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-01-08 23:43:57,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:57,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:57,444 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-01-08 23:43:57,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:57,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262010945] [2025-01-08 23:43:57,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262010945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:57,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:57,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:57,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929109997] [2025-01-08 23:43:57,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:57,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:57,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:57,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:57,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:57,446 INFO L87 Difference]: Start difference. First operand 7422 states and 8742 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:58,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:58,106 INFO L93 Difference]: Finished difference Result 14469 states and 17097 transitions. [2025-01-08 23:43:58,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:58,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 386 [2025-01-08 23:43:58,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:58,120 INFO L225 Difference]: With dead ends: 14469 [2025-01-08 23:43:58,120 INFO L226 Difference]: Without dead ends: 7419 [2025-01-08 23:43:58,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:58,128 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 173 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:58,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 299 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:43:58,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7419 states. [2025-01-08 23:43:58,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7419 to 7419. [2025-01-08 23:43:58,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7419 states, 7418 states have (on average 1.1540846589377192) internal successors, (8561), 7418 states have internal predecessors, (8561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:58,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7419 states to 7419 states and 8561 transitions. [2025-01-08 23:43:58,208 INFO L78 Accepts]: Start accepts. Automaton has 7419 states and 8561 transitions. Word has length 386 [2025-01-08 23:43:58,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:58,209 INFO L471 AbstractCegarLoop]: Abstraction has 7419 states and 8561 transitions. [2025-01-08 23:43:58,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:58,209 INFO L276 IsEmpty]: Start isEmpty. Operand 7419 states and 8561 transitions. [2025-01-08 23:43:58,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-01-08 23:43:58,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:58,221 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:58,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:43:58,221 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:58,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:58,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1803697868, now seen corresponding path program 1 times [2025-01-08 23:43:58,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:58,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394435406] [2025-01-08 23:43:58,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:58,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:58,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-01-08 23:43:58,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-01-08 23:43:58,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:58,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:58,524 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-01-08 23:43:58,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:58,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394435406] [2025-01-08 23:43:58,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394435406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:58,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:58,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:58,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77189283] [2025-01-08 23:43:58,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:58,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:58,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:58,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:58,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:58,527 INFO L87 Difference]: Start difference. First operand 7419 states and 8561 transitions. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:59,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:59,117 INFO L93 Difference]: Finished difference Result 16686 states and 19301 transitions. [2025-01-08 23:43:59,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:59,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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 401 [2025-01-08 23:43:59,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:59,137 INFO L225 Difference]: With dead ends: 16686 [2025-01-08 23:43:59,137 INFO L226 Difference]: Without dead ends: 9639 [2025-01-08 23:43:59,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:59,146 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 141 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:59,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 117 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:43:59,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9639 states. [2025-01-08 23:43:59,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9639 to 9268. [2025-01-08 23:43:59,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9268 states, 9267 states have (on average 1.1402827236430344) internal successors, (10567), 9267 states have internal predecessors, (10567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:59,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9268 states to 9268 states and 10567 transitions. [2025-01-08 23:43:59,254 INFO L78 Accepts]: Start accepts. Automaton has 9268 states and 10567 transitions. Word has length 401 [2025-01-08 23:43:59,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:59,255 INFO L471 AbstractCegarLoop]: Abstraction has 9268 states and 10567 transitions. [2025-01-08 23:43:59,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:59,255 INFO L276 IsEmpty]: Start isEmpty. Operand 9268 states and 10567 transitions. [2025-01-08 23:43:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-01-08 23:43:59,265 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:59,265 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:59,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:43:59,266 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:59,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:59,266 INFO L85 PathProgramCache]: Analyzing trace with hash 502741101, now seen corresponding path program 1 times [2025-01-08 23:43:59,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:59,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593639213] [2025-01-08 23:43:59,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:59,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:59,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-01-08 23:43:59,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-01-08 23:43:59,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:59,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:59,858 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-01-08 23:43:59,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:59,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593639213] [2025-01-08 23:43:59,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593639213] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:59,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:59,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:59,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923062330] [2025-01-08 23:43:59,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:59,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:59,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:59,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:59,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:59,861 INFO L87 Difference]: Start difference. First operand 9268 states and 10567 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:00,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:44:00,511 INFO L93 Difference]: Finished difference Result 20002 states and 22828 transitions. [2025-01-08 23:44:00,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:44:00,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 411 [2025-01-08 23:44:00,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:44:00,512 INFO L225 Difference]: With dead ends: 20002 [2025-01-08 23:44:00,513 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:44:00,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:00,527 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 157 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:44:00,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 322 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:44:00,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:44:00,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:44:00,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:00,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:44:00,528 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 411 [2025-01-08 23:44:00,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:44:00,529 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:44:00,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:00,529 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:44:00,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:44:00,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:44:00,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:44:00,535 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:44:00,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:44:01,220 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:44:01,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:44:01 BoogieIcfgContainer [2025-01-08 23:44:01,232 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:44:01,232 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:44:01,232 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:44:01,233 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:44:01,233 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:43:42" (3/4) ... [2025-01-08 23:44:01,235 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:44:01,261 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:44:01,265 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:44:01,266 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:44:01,267 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:44:01,418 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:44:01,418 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:44:01,418 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:44:01,419 INFO L158 Benchmark]: Toolchain (without parser) took 21451.51ms. Allocated memory was 142.6MB in the beginning and 620.8MB in the end (delta: 478.2MB). Free memory was 102.0MB in the beginning and 234.2MB in the end (delta: -132.2MB). Peak memory consumption was 345.3MB. Max. memory is 16.1GB. [2025-01-08 23:44:01,419 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:44:01,419 INFO L158 Benchmark]: CACSL2BoogieTranslator took 529.52ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 59.3MB in the end (delta: 42.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-08 23:44:01,420 INFO L158 Benchmark]: Boogie Procedure Inliner took 125.44ms. Allocated memory is still 142.6MB. Free memory was 59.3MB in the beginning and 42.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:44:01,420 INFO L158 Benchmark]: Boogie Preprocessor took 214.65ms. Allocated memory is still 142.6MB. Free memory was 42.6MB in the beginning and 78.2MB in the end (delta: -35.6MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2025-01-08 23:44:01,420 INFO L158 Benchmark]: RCFGBuilder took 1516.15ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 78.2MB in the beginning and 249.4MB in the end (delta: -171.2MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2025-01-08 23:44:01,421 INFO L158 Benchmark]: TraceAbstraction took 18869.12ms. Allocated memory was 302.0MB in the beginning and 620.8MB in the end (delta: 318.8MB). Free memory was 248.4MB in the beginning and 250.9MB in the end (delta: -2.5MB). Peak memory consumption was 321.2MB. Max. memory is 16.1GB. [2025-01-08 23:44:01,421 INFO L158 Benchmark]: Witness Printer took 186.04ms. Allocated memory is still 620.8MB. Free memory was 250.9MB in the beginning and 234.2MB in the end (delta: 16.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:44:01,422 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 529.52ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 59.3MB in the end (delta: 42.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 125.44ms. Allocated memory is still 142.6MB. Free memory was 59.3MB in the beginning and 42.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 214.65ms. Allocated memory is still 142.6MB. Free memory was 42.6MB in the beginning and 78.2MB in the end (delta: -35.6MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. * RCFGBuilder took 1516.15ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 78.2MB in the beginning and 249.4MB in the end (delta: -171.2MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. * TraceAbstraction took 18869.12ms. Allocated memory was 302.0MB in the beginning and 620.8MB in the end (delta: 318.8MB). Free memory was 248.4MB in the beginning and 250.9MB in the end (delta: -2.5MB). Peak memory consumption was 321.2MB. Max. memory is 16.1GB. * Witness Printer took 186.04ms. Allocated memory is still 620.8MB. Free memory was 250.9MB in the beginning and 234.2MB in the end (delta: 16.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 193]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.1s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2120 SdHoareTripleChecker+Valid, 10.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2120 mSDsluCounter, 2840 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 292 mSDsCounter, 1808 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8194 IncrementalHoareTripleChecker+Invalid, 10002 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1808 mSolverCounterUnsat, 2548 mSDtfsCounter, 8194 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 660 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9268occurred in iteration=12, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 3005 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 3694 NumberOfCodeBlocks, 3694 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3992 ConstructedInterpolants, 0 QuantifiedInterpolants, 7331 SizeOfPredicates, 1 NumberOfNonLiveVariables, 419 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 3131/3245 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((10 <= a25) && (a23 <= 266)) || (a25 == 12)) || ((260 <= a29) && (a23 <= 137))) || ((a23 <= 266) && (a29 <= 220))) || ((141 <= a29) && (a4 == 1))) || ((a29 <= 220) && (a25 == 10))) || ((10 <= a25) && (a4 == 1))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:44:01,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE