./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label39.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label39.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 458d694afbb3bfd6aed28352ce176f8d7e28b3da8c081e4ca83ee27f62e7ab73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:54:29,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:54:29,678 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:54:29,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:54:29,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:54:29,720 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:54:29,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:54:29,721 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:54:29,721 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:54:29,721 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:54:29,722 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:54:29,722 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:54:29,723 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:54:29,723 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:54:29,723 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:54:29,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:54:29,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:54:29,724 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:54:29,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:54:29,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:54:29,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:54:29,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:54:29,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:54:29,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:54:29,725 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:54:29,725 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:54:29,725 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:54:29,725 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:54:29,725 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:54:29,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:54:29,725 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:54:29,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:54:29,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:54:29,725 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:54:29,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:54:29,725 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:54:29,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:54:29,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:54:29,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:54:29,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:54:29,726 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:54:29,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:54:29,726 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:54:29,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:54:29,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:54:29,726 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:54:29,726 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:54:29,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:54:29,726 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 -> 458d694afbb3bfd6aed28352ce176f8d7e28b3da8c081e4ca83ee27f62e7ab73 [2025-01-08 23:54:29,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:54:29,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:54:29,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:54:29,989 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:54:29,989 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:54:29,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label39.c [2025-01-08 23:54:31,247 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a58b5fc2e/791395e42c6646b6a00b2b57ade97620/FLAG8432fb7d6 [2025-01-08 23:54:31,907 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:54:31,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label39.c [2025-01-08 23:54:31,942 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a58b5fc2e/791395e42c6646b6a00b2b57ade97620/FLAG8432fb7d6 [2025-01-08 23:54:31,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a58b5fc2e/791395e42c6646b6a00b2b57ade97620 [2025-01-08 23:54:31,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:54:31,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:54:31,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:54:31,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:54:31,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:54:31,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:54:31" (1/1) ... [2025-01-08 23:54:31,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5385ba79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:31, skipping insertion in model container [2025-01-08 23:54:31,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:54:31" (1/1) ... [2025-01-08 23:54:32,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:54:32,331 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label39.c[7279,7292] [2025-01-08 23:54:33,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:54:33,056 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:54:33,081 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label39.c[7279,7292] [2025-01-08 23:54:33,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:54:33,509 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:54:33,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:33 WrapperNode [2025-01-08 23:54:33,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:54:33,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:54:33,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:54:33,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:54:33,520 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:54:33" (1/1) ... [2025-01-08 23:54:33,585 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:54:33" (1/1) ... [2025-01-08 23:54:34,079 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-01-08 23:54:34,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:54:34,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:54:34,082 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:54:34,082 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:54:34,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:33" (1/1) ... [2025-01-08 23:54:34,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:33" (1/1) ... [2025-01-08 23:54:34,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:33" (1/1) ... [2025-01-08 23:54:34,438 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:54:34,439 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:33" (1/1) ... [2025-01-08 23:54:34,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:33" (1/1) ... [2025-01-08 23:54:34,756 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:33" (1/1) ... [2025-01-08 23:54:34,781 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:33" (1/1) ... [2025-01-08 23:54:34,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:33" (1/1) ... [2025-01-08 23:54:34,849 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:33" (1/1) ... [2025-01-08 23:54:34,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:33" (1/1) ... [2025-01-08 23:54:34,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:54:34,938 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:54:34,938 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:54:34,938 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:54:34,939 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:33" (1/1) ... [2025-01-08 23:54:34,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:54:34,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:54:34,972 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:54:34,975 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:54:34,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:54:34,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:54:34,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:54:34,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:54:35,068 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:54:35,069 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:54:40,135 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-01-08 23:54:40,135 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:54:40,181 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:54:40,184 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:54:40,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:54:40 BoogieIcfgContainer [2025-01-08 23:54:40,185 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:54:40,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:54:40,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:54:40,191 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:54:40,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:54:31" (1/3) ... [2025-01-08 23:54:40,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c10ca0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:54:40, skipping insertion in model container [2025-01-08 23:54:40,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:33" (2/3) ... [2025-01-08 23:54:40,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c10ca0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:54:40, skipping insertion in model container [2025-01-08 23:54:40,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:54:40" (3/3) ... [2025-01-08 23:54:40,193 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label39.c [2025-01-08 23:54:40,205 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:54:40,209 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label39.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:54:40,304 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:54:40,315 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;@51744e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:54:40,316 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:54:40,324 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:40,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-08 23:54:40,331 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:40,331 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] [2025-01-08 23:54:40,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:40,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:40,336 INFO L85 PathProgramCache]: Analyzing trace with hash -700415300, now seen corresponding path program 1 times [2025-01-08 23:54:40,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:40,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070394181] [2025-01-08 23:54:40,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:40,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:40,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-08 23:54:40,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-08 23:54:40,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:40,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:40,707 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:54:40,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:40,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070394181] [2025-01-08 23:54:40,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070394181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:40,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:40,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:54:40,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248600608] [2025-01-08 23:54:40,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:40,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:40,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:40,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:40,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:40,736 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:44,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:44,985 INFO L93 Difference]: Finished difference Result 3160 states and 5840 transitions. [2025-01-08 23:54:44,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:44,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-01-08 23:54:44,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:45,008 INFO L225 Difference]: With dead ends: 3160 [2025-01-08 23:54:45,009 INFO L226 Difference]: Without dead ends: 1983 [2025-01-08 23:54:45,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:45,019 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 1052 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3030 mSolverCounterSat, 974 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 4004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 974 IncrementalHoareTripleChecker+Valid, 3030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:45,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 345 Invalid, 4004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [974 Valid, 3030 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-01-08 23:54:45,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2025-01-08 23:54:45,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1930. [2025-01-08 23:54:45,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1929 states have (on average 1.7973043027475375) internal successors, (3467), 1929 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:45,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 3467 transitions. [2025-01-08 23:54:45,150 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 3467 transitions. Word has length 51 [2025-01-08 23:54:45,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:45,151 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 3467 transitions. [2025-01-08 23:54:45,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:45,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3467 transitions. [2025-01-08 23:54:45,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-08 23:54:45,154 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:45,154 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:54:45,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:54:45,154 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:45,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:45,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1117933370, now seen corresponding path program 1 times [2025-01-08 23:54:45,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:45,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984903651] [2025-01-08 23:54:45,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:45,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:45,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-08 23:54:45,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-08 23:54:45,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:45,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:54:45,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:45,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984903651] [2025-01-08 23:54:45,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984903651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:45,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:45,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:54:45,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143794436] [2025-01-08 23:54:45,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:45,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:45,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:45,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:45,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:45,637 INFO L87 Difference]: Start difference. First operand 1930 states and 3467 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:48,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:48,857 INFO L93 Difference]: Finished difference Result 5456 states and 9917 transitions. [2025-01-08 23:54:48,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:48,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2025-01-08 23:54:48,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:48,871 INFO L225 Difference]: With dead ends: 5456 [2025-01-08 23:54:48,871 INFO L226 Difference]: Without dead ends: 3528 [2025-01-08 23:54:48,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:48,874 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 923 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 3187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:48,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1010 Invalid, 3187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-08 23:54:48,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2025-01-08 23:54:48,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 3526. [2025-01-08 23:54:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3526 states, 3525 states have (on average 1.5670921985815602) internal successors, (5524), 3525 states have internal predecessors, (5524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 5524 transitions. [2025-01-08 23:54:48,950 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 5524 transitions. Word has length 116 [2025-01-08 23:54:48,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:48,952 INFO L471 AbstractCegarLoop]: Abstraction has 3526 states and 5524 transitions. [2025-01-08 23:54:48,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:48,952 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 5524 transitions. [2025-01-08 23:54:48,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-08 23:54:48,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:48,954 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:54:48,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:54:48,954 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:48,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:48,957 INFO L85 PathProgramCache]: Analyzing trace with hash 2012898921, now seen corresponding path program 1 times [2025-01-08 23:54:48,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:48,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745497826] [2025-01-08 23:54:48,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:48,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:48,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-08 23:54:48,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-08 23:54:48,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:48,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:49,123 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:54:49,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:49,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745497826] [2025-01-08 23:54:49,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745497826] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:49,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:49,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:54:49,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661894963] [2025-01-08 23:54:49,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:49,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:49,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:49,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:49,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:49,131 INFO L87 Difference]: Start difference. First operand 3526 states and 5524 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:52,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:52,266 INFO L93 Difference]: Finished difference Result 10234 states and 16098 transitions. [2025-01-08 23:54:52,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:52,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2025-01-08 23:54:52,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:52,295 INFO L225 Difference]: With dead ends: 10234 [2025-01-08 23:54:52,295 INFO L226 Difference]: Without dead ends: 6710 [2025-01-08 23:54:52,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:52,302 INFO L435 NwaCegarLoop]: 1006 mSDtfsCounter, 870 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2635 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 3358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 2635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:52,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 1140 Invalid, 3358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 2635 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-08 23:54:52,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6710 states. [2025-01-08 23:54:52,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6710 to 6700. [2025-01-08 23:54:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6700 states, 6699 states have (on average 1.413046723391551) internal successors, (9466), 6699 states have internal predecessors, (9466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6700 states to 6700 states and 9466 transitions. [2025-01-08 23:54:52,438 INFO L78 Accepts]: Start accepts. Automaton has 6700 states and 9466 transitions. Word has length 122 [2025-01-08 23:54:52,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:52,439 INFO L471 AbstractCegarLoop]: Abstraction has 6700 states and 9466 transitions. [2025-01-08 23:54:52,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:52,439 INFO L276 IsEmpty]: Start isEmpty. Operand 6700 states and 9466 transitions. [2025-01-08 23:54:52,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-08 23:54:52,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:52,441 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:54:52,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:54:52,442 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:52,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:52,442 INFO L85 PathProgramCache]: Analyzing trace with hash -611823020, now seen corresponding path program 1 times [2025-01-08 23:54:52,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:52,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113152973] [2025-01-08 23:54:52,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:52,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:52,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-08 23:54:52,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-08 23:54:52,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:52,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:54:52,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:52,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113152973] [2025-01-08 23:54:52,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113152973] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:52,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:52,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:54:52,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476787617] [2025-01-08 23:54:52,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:52,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:52,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:52,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:52,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:52,673 INFO L87 Difference]: Start difference. First operand 6700 states and 9466 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:56,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:56,147 INFO L93 Difference]: Finished difference Result 17443 states and 24479 transitions. [2025-01-08 23:54:56,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:56,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2025-01-08 23:54:56,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:56,171 INFO L225 Difference]: With dead ends: 17443 [2025-01-08 23:54:56,171 INFO L226 Difference]: Without dead ends: 10745 [2025-01-08 23:54:56,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:56,180 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 851 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 3121 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 3613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 3121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:56,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 686 Invalid, 3613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 3121 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-08 23:54:56,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10745 states. [2025-01-08 23:54:56,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10745 to 10669. [2025-01-08 23:54:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10669 states, 10668 states have (on average 1.3562992125984252) internal successors, (14469), 10668 states have internal predecessors, (14469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:56,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10669 states to 10669 states and 14469 transitions. [2025-01-08 23:54:56,357 INFO L78 Accepts]: Start accepts. Automaton has 10669 states and 14469 transitions. Word has length 152 [2025-01-08 23:54:56,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:56,358 INFO L471 AbstractCegarLoop]: Abstraction has 10669 states and 14469 transitions. [2025-01-08 23:54:56,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:56,359 INFO L276 IsEmpty]: Start isEmpty. Operand 10669 states and 14469 transitions. [2025-01-08 23:54:56,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-08 23:54:56,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:56,362 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:54:56,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:54:56,363 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:56,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:56,363 INFO L85 PathProgramCache]: Analyzing trace with hash -2077094195, now seen corresponding path program 1 times [2025-01-08 23:54:56,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:56,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964166812] [2025-01-08 23:54:56,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:56,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:56,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-08 23:54:56,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-08 23:54:56,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:56,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:56,824 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:54:56,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:56,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964166812] [2025-01-08 23:54:56,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964166812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:56,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:56,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:54:56,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036354015] [2025-01-08 23:54:56,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:56,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:56,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:56,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:56,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:56,828 INFO L87 Difference]: Start difference. First operand 10669 states and 14469 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:59,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:59,358 INFO L93 Difference]: Finished difference Result 20549 states and 28119 transitions. [2025-01-08 23:54:59,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:59,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-01-08 23:54:59,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:59,443 INFO L225 Difference]: With dead ends: 20549 [2025-01-08 23:54:59,443 INFO L226 Difference]: Without dead ends: 10669 [2025-01-08 23:54:59,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:59,453 INFO L435 NwaCegarLoop]: 1083 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:59,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1212 Invalid, 2544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:54:59,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10669 states. [2025-01-08 23:54:59,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10669 to 10669. [2025-01-08 23:54:59,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10669 states, 10668 states have (on average 1.3539557555305586) internal successors, (14444), 10668 states have internal predecessors, (14444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10669 states to 10669 states and 14444 transitions. [2025-01-08 23:54:59,603 INFO L78 Accepts]: Start accepts. Automaton has 10669 states and 14444 transitions. Word has length 162 [2025-01-08 23:54:59,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:59,604 INFO L471 AbstractCegarLoop]: Abstraction has 10669 states and 14444 transitions. [2025-01-08 23:54:59,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 10669 states and 14444 transitions. [2025-01-08 23:54:59,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-08 23:54:59,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:59,607 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:54:59,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:54:59,607 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:59,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:59,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1645628183, now seen corresponding path program 1 times [2025-01-08 23:54:59,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:59,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361151488] [2025-01-08 23:54:59,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:59,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:59,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-08 23:54:59,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-08 23:54:59,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:59,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:59,881 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:54:59,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:59,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361151488] [2025-01-08 23:54:59,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361151488] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:54:59,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673595655] [2025-01-08 23:54:59,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:59,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:54:59,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:54:59,889 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:54:59,890 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:54:59,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-08 23:54:59,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-08 23:54:59,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:59,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:59,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:54:59,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:55:00,280 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:55:00,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:55:01,760 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:55:01,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673595655] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:55:01,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:55:01,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-08 23:55:01,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173281071] [2025-01-08 23:55:01,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:55:01,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 23:55:01,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:01,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 23:55:01,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:55:01,764 INFO L87 Difference]: Start difference. First operand 10669 states and 14444 transitions. Second operand has 6 states, 6 states have (on average 58.5) internal successors, (351), 5 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:12,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:12,952 INFO L93 Difference]: Finished difference Result 57154 states and 77638 transitions. [2025-01-08 23:55:12,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-08 23:55:12,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 5 states have internal predecessors, (351), 0 states have call successors, (0), 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 176 [2025-01-08 23:55:12,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:13,061 INFO L225 Difference]: With dead ends: 57154 [2025-01-08 23:55:13,062 INFO L226 Difference]: Without dead ends: 47274 [2025-01-08 23:55:13,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-08 23:55:13,081 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 6979 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 9975 mSolverCounterSat, 4014 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6979 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 13989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4014 IncrementalHoareTripleChecker+Valid, 9975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:13,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6979 Valid, 1114 Invalid, 13989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4014 Valid, 9975 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2025-01-08 23:55:13,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47274 states. [2025-01-08 23:55:13,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47274 to 24091. [2025-01-08 23:55:13,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24091 states, 24090 states have (on average 1.2878372768783728) internal successors, (31024), 24090 states have internal predecessors, (31024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:13,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24091 states to 24091 states and 31024 transitions. [2025-01-08 23:55:13,511 INFO L78 Accepts]: Start accepts. Automaton has 24091 states and 31024 transitions. Word has length 176 [2025-01-08 23:55:13,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:13,511 INFO L471 AbstractCegarLoop]: Abstraction has 24091 states and 31024 transitions. [2025-01-08 23:55:13,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 5 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:13,511 INFO L276 IsEmpty]: Start isEmpty. Operand 24091 states and 31024 transitions. [2025-01-08 23:55:13,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-01-08 23:55:13,519 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:13,519 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:55:13,529 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:55:13,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:55:13,721 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:13,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:13,721 INFO L85 PathProgramCache]: Analyzing trace with hash 326978902, now seen corresponding path program 1 times [2025-01-08 23:55:13,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:13,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958018635] [2025-01-08 23:55:13,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:13,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:13,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-01-08 23:55:13,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-01-08 23:55:13,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:13,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:55:13,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:13,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958018635] [2025-01-08 23:55:13,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958018635] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:13,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:13,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:55:13,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465109633] [2025-01-08 23:55:13,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:13,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:55:13,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:13,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:55:13,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:55:13,976 INFO L87 Difference]: Start difference. First operand 24091 states and 31024 transitions. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:20,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:20,050 INFO L93 Difference]: Finished difference Result 66524 states and 87195 transitions. [2025-01-08 23:55:20,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:55:20,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 248 [2025-01-08 23:55:20,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:20,110 INFO L225 Difference]: With dead ends: 66524 [2025-01-08 23:55:20,110 INFO L226 Difference]: Without dead ends: 43222 [2025-01-08 23:55:20,135 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:55:20,136 INFO L435 NwaCegarLoop]: 1020 mSDtfsCounter, 1727 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 6224 mSolverCounterSat, 994 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1727 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 7218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 994 IncrementalHoareTripleChecker+Valid, 6224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:20,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1727 Valid, 1223 Invalid, 7218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [994 Valid, 6224 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2025-01-08 23:55:20,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43222 states. [2025-01-08 23:55:20,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43222 to 31196. [2025-01-08 23:55:20,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31196 states, 31195 states have (on average 1.263888443660843) internal successors, (39427), 31195 states have internal predecessors, (39427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:20,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31196 states to 31196 states and 39427 transitions. [2025-01-08 23:55:20,551 INFO L78 Accepts]: Start accepts. Automaton has 31196 states and 39427 transitions. Word has length 248 [2025-01-08 23:55:20,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:20,552 INFO L471 AbstractCegarLoop]: Abstraction has 31196 states and 39427 transitions. [2025-01-08 23:55:20,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:20,552 INFO L276 IsEmpty]: Start isEmpty. Operand 31196 states and 39427 transitions. [2025-01-08 23:55:20,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-01-08 23:55:20,555 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:20,555 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:55:20,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:55:20,556 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:20,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:20,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1389300855, now seen corresponding path program 1 times [2025-01-08 23:55:20,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:20,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127423189] [2025-01-08 23:55:20,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:20,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:20,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-01-08 23:55:20,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-01-08 23:55:20,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:20,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:21,349 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 167 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:55:21,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:21,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127423189] [2025-01-08 23:55:21,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127423189] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:55:21,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869088168] [2025-01-08 23:55:21,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:21,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:55:21,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:55:21,352 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:55:21,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:55:21,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-01-08 23:55:21,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-01-08 23:55:21,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:21,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:21,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:55:21,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:55:21,545 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-01-08 23:55:21,545 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:55:21,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869088168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:21,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:55:21,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:55:21,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636376717] [2025-01-08 23:55:21,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:21,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:21,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:21,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:21,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:55:21,547 INFO L87 Difference]: Start difference. First operand 31196 states and 39427 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:24,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:24,543 INFO L93 Difference]: Finished difference Result 61602 states and 78060 transitions. [2025-01-08 23:55:24,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:24,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 263 [2025-01-08 23:55:24,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:24,590 INFO L225 Difference]: With dead ends: 61602 [2025-01-08 23:55:24,590 INFO L226 Difference]: Without dead ends: 31195 [2025-01-08 23:55:24,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:55:24,618 INFO L435 NwaCegarLoop]: 1371 mSDtfsCounter, 1162 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 451 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 2922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 451 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:24,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 1455 Invalid, 2922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [451 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:55:24,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31195 states. [2025-01-08 23:55:24,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31195 to 31193. [2025-01-08 23:55:24,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31193 states, 31192 states have (on average 1.2048922800718134) internal successors, (37583), 31192 states have internal predecessors, (37583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:25,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31193 states to 31193 states and 37583 transitions. [2025-01-08 23:55:25,041 INFO L78 Accepts]: Start accepts. Automaton has 31193 states and 37583 transitions. Word has length 263 [2025-01-08 23:55:25,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:25,042 INFO L471 AbstractCegarLoop]: Abstraction has 31193 states and 37583 transitions. [2025-01-08 23:55:25,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:25,042 INFO L276 IsEmpty]: Start isEmpty. Operand 31193 states and 37583 transitions. [2025-01-08 23:55:25,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-01-08 23:55:25,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:25,048 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:55:25,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 23:55:25,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:55:25,249 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:25,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:25,250 INFO L85 PathProgramCache]: Analyzing trace with hash 914802577, now seen corresponding path program 1 times [2025-01-08 23:55:25,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:25,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447764034] [2025-01-08 23:55:25,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:25,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:25,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-01-08 23:55:25,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-01-08 23:55:25,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:25,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:55:25,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:25,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447764034] [2025-01-08 23:55:25,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447764034] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:25,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:25,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:55:25,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744892179] [2025-01-08 23:55:25,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:25,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:25,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:25,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:25,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:25,499 INFO L87 Difference]: Start difference. First operand 31193 states and 37583 transitions. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:28,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:28,992 INFO L93 Difference]: Finished difference Result 88369 states and 107119 transitions. [2025-01-08 23:55:28,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:28,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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 323 [2025-01-08 23:55:28,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:29,095 INFO L225 Difference]: With dead ends: 88369 [2025-01-08 23:55:29,095 INFO L226 Difference]: Without dead ends: 57965 [2025-01-08 23:55:29,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:29,126 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 767 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2420 mSolverCounterSat, 879 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 879 IncrementalHoareTripleChecker+Valid, 2420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:29,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1013 Invalid, 3299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [879 Valid, 2420 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-08 23:55:29,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57965 states. [2025-01-08 23:55:29,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57965 to 56376. [2025-01-08 23:55:29,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56376 states, 56375 states have (on average 1.16109977827051) internal successors, (65457), 56375 states have internal predecessors, (65457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:29,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56376 states to 56376 states and 65457 transitions. [2025-01-08 23:55:29,856 INFO L78 Accepts]: Start accepts. Automaton has 56376 states and 65457 transitions. Word has length 323 [2025-01-08 23:55:29,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:29,857 INFO L471 AbstractCegarLoop]: Abstraction has 56376 states and 65457 transitions. [2025-01-08 23:55:29,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:29,857 INFO L276 IsEmpty]: Start isEmpty. Operand 56376 states and 65457 transitions. [2025-01-08 23:55:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-01-08 23:55:29,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:29,863 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:55:29,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:55:29,863 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:29,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:29,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1144832664, now seen corresponding path program 1 times [2025-01-08 23:55:29,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:29,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164234723] [2025-01-08 23:55:29,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:29,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:29,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-01-08 23:55:29,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-01-08 23:55:29,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:29,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-01-08 23:55:30,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:30,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164234723] [2025-01-08 23:55:30,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164234723] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:30,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:30,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:55:30,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734947627] [2025-01-08 23:55:30,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:30,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:30,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:30,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:30,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:30,053 INFO L87 Difference]: Start difference. First operand 56376 states and 65457 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:33,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:33,214 INFO L93 Difference]: Finished difference Result 113546 states and 131721 transitions. [2025-01-08 23:55:33,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:33,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 337 [2025-01-08 23:55:33,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:33,281 INFO L225 Difference]: With dead ends: 113546 [2025-01-08 23:55:33,282 INFO L226 Difference]: Without dead ends: 57959 [2025-01-08 23:55:33,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:33,316 INFO L435 NwaCegarLoop]: 1430 mSDtfsCounter, 942 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 2497 mSolverCounterSat, 605 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 3102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 605 IncrementalHoareTripleChecker+Valid, 2497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:33,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 1524 Invalid, 3102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [605 Valid, 2497 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:55:33,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57959 states. [2025-01-08 23:55:33,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57959 to 56370. [2025-01-08 23:55:33,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56370 states, 56369 states have (on average 1.1254058081569658) internal successors, (63438), 56369 states have internal predecessors, (63438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56370 states to 56370 states and 63438 transitions. [2025-01-08 23:55:33,992 INFO L78 Accepts]: Start accepts. Automaton has 56370 states and 63438 transitions. Word has length 337 [2025-01-08 23:55:33,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:33,993 INFO L471 AbstractCegarLoop]: Abstraction has 56370 states and 63438 transitions. [2025-01-08 23:55:33,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:33,993 INFO L276 IsEmpty]: Start isEmpty. Operand 56370 states and 63438 transitions. [2025-01-08 23:55:33,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2025-01-08 23:55:33,999 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:33,999 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:55:33,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:55:33,999 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:34,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:34,000 INFO L85 PathProgramCache]: Analyzing trace with hash 985883155, now seen corresponding path program 1 times [2025-01-08 23:55:34,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:34,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220337998] [2025-01-08 23:55:34,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:34,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:34,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-01-08 23:55:34,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-01-08 23:55:34,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:34,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:34,191 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-01-08 23:55:34,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:34,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220337998] [2025-01-08 23:55:34,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220337998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:34,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:34,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:55:34,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904947872] [2025-01-08 23:55:34,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:34,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:34,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:34,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:34,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:34,195 INFO L87 Difference]: Start difference. First operand 56370 states and 63438 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:37,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:37,175 INFO L93 Difference]: Finished difference Result 134018 states and 150788 transitions. [2025-01-08 23:55:37,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:37,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 380 [2025-01-08 23:55:37,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:37,254 INFO L225 Difference]: With dead ends: 134018 [2025-01-08 23:55:37,254 INFO L226 Difference]: Without dead ends: 78437 [2025-01-08 23:55:37,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:37,442 INFO L435 NwaCegarLoop]: 1357 mSDtfsCounter, 1047 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 2487 mSolverCounterSat, 691 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 3178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 691 IncrementalHoareTripleChecker+Valid, 2487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:37,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 1409 Invalid, 3178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [691 Valid, 2487 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:55:37,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78437 states. [2025-01-08 23:55:38,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78437 to 76046. [2025-01-08 23:55:38,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76046 states, 76045 states have (on average 1.1173910184759024) internal successors, (84972), 76045 states have internal predecessors, (84972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76046 states to 76046 states and 84972 transitions. [2025-01-08 23:55:38,170 INFO L78 Accepts]: Start accepts. Automaton has 76046 states and 84972 transitions. Word has length 380 [2025-01-08 23:55:38,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:38,171 INFO L471 AbstractCegarLoop]: Abstraction has 76046 states and 84972 transitions. [2025-01-08 23:55:38,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:38,171 INFO L276 IsEmpty]: Start isEmpty. Operand 76046 states and 84972 transitions. [2025-01-08 23:55:38,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-01-08 23:55:38,181 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:38,181 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:55:38,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:55:38,182 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:38,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:38,182 INFO L85 PathProgramCache]: Analyzing trace with hash -875464418, now seen corresponding path program 1 times [2025-01-08 23:55:38,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:38,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268793668] [2025-01-08 23:55:38,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:38,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:38,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-01-08 23:55:38,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-01-08 23:55:38,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:38,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-01-08 23:55:38,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:38,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268793668] [2025-01-08 23:55:38,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268793668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:38,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:38,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:55:38,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853373900] [2025-01-08 23:55:38,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:38,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:55:38,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:38,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:55:38,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:55:38,803 INFO L87 Difference]: Start difference. First operand 76046 states and 84972 transitions. Second operand has 4 states, 4 states have (on average 89.25) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:43,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:43,052 INFO L93 Difference]: Finished difference Result 145812 states and 163514 transitions. [2025-01-08 23:55:43,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:55:43,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.25) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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 405 [2025-01-08 23:55:43,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:43,126 INFO L225 Difference]: With dead ends: 145812 [2025-01-08 23:55:43,126 INFO L226 Difference]: Without dead ends: 80770 [2025-01-08 23:55:43,158 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:55:43,158 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 1441 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 4888 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1441 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 5329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 4888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:43,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1441 Valid, 1123 Invalid, 5329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 4888 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-01-08 23:55:43,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80770 states. [2025-01-08 23:55:43,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80770 to 79952. [2025-01-08 23:55:43,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79952 states, 79951 states have (on average 1.1063026103488387) internal successors, (88450), 79951 states have internal predecessors, (88450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:43,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79952 states to 79952 states and 88450 transitions. [2025-01-08 23:55:43,952 INFO L78 Accepts]: Start accepts. Automaton has 79952 states and 88450 transitions. Word has length 405 [2025-01-08 23:55:43,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:43,953 INFO L471 AbstractCegarLoop]: Abstraction has 79952 states and 88450 transitions. [2025-01-08 23:55:43,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.25) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:43,953 INFO L276 IsEmpty]: Start isEmpty. Operand 79952 states and 88450 transitions. [2025-01-08 23:55:43,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2025-01-08 23:55:43,958 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:43,959 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:55:43,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:55:43,959 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:43,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:43,959 INFO L85 PathProgramCache]: Analyzing trace with hash 180919012, now seen corresponding path program 1 times [2025-01-08 23:55:43,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:43,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189938281] [2025-01-08 23:55:43,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:43,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:43,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-01-08 23:55:44,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-01-08 23:55:44,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:44,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 575 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-01-08 23:55:44,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:44,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189938281] [2025-01-08 23:55:44,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189938281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:44,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:44,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:55:44,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458591850] [2025-01-08 23:55:44,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:44,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:44,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:44,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:44,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:44,308 INFO L87 Difference]: Start difference. First operand 79952 states and 88450 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)