./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label29.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem19_label29.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 53488701891f7957ccd87880d541113b96029e2bdccebffd97b079052b1e532d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:17:01,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:17:01,767 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 12:17:01,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:17:01,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:17:01,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:17:01,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:17:01,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:17:01,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:17:01,807 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:17:01,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:17:01,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:17:01,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:17:01,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:17:01,808 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:17:01,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:17:01,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:17:01,809 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:17:01,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:17:01,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:17:01,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:17:01,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:17:01,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:17:01,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:17:01,810 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:17:01,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:17:01,810 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:17:01,810 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:17:01,810 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:17:01,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:17:01,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:17:01,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:17:01,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:17:01,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:17:01,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:17:01,811 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:17:01,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:17:01,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:17:01,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:17:01,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:17:01,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:17:01,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:17:01,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:17:01,812 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 -> 53488701891f7957ccd87880d541113b96029e2bdccebffd97b079052b1e532d [2025-02-05 12:17:02,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:17:02,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:17:02,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:17:02,136 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:17:02,136 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:17:02,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label29.c [2025-02-05 12:17:03,488 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e2722c3e/77bf31d32d874b51a9dccf2e437cd234/FLAGa2e855c0a [2025-02-05 12:17:04,048 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:17:04,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label29.c [2025-02-05 12:17:04,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e2722c3e/77bf31d32d874b51a9dccf2e437cd234/FLAGa2e855c0a [2025-02-05 12:17:04,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e2722c3e/77bf31d32d874b51a9dccf2e437cd234 [2025-02-05 12:17:04,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:17:04,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:17:04,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:17:04,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:17:04,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:17:04,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:17:04" (1/1) ... [2025-02-05 12:17:04,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2459d059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:17:04, skipping insertion in model container [2025-02-05 12:17:04,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:17:04" (1/1) ... [2025-02-05 12:17:04,257 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:17:04,502 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label29.c[3135,3148] [2025-02-05 12:17:05,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:17:05,440 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:17:05,458 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label29.c[3135,3148] [2025-02-05 12:17:06,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:17:06,214 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:17:06,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:17:06 WrapperNode [2025-02-05 12:17:06,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:17:06,217 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:17:06,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:17:06,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:17:06,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:17:06" (1/1) ... [2025-02-05 12:17:06,316 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:17:06" (1/1) ... [2025-02-05 12:17:07,107 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-02-05 12:17:07,108 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:17:07,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:17:07,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:17:07,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:17:07,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:17:06" (1/1) ... [2025-02-05 12:17:07,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:17:06" (1/1) ... [2025-02-05 12:17:07,358 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:17:06" (1/1) ... [2025-02-05 12:17:07,685 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-02-05 12:17:07,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:17:06" (1/1) ... [2025-02-05 12:17:07,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:17:06" (1/1) ... [2025-02-05 12:17:07,949 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:17:06" (1/1) ... [2025-02-05 12:17:07,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:17:06" (1/1) ... [2025-02-05 12:17:08,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:17:06" (1/1) ... [2025-02-05 12:17:08,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:17:06" (1/1) ... [2025-02-05 12:17:08,188 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:17:08,190 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:17:08,190 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:17:08,191 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:17:08,192 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:17:06" (1/1) ... [2025-02-05 12:17:08,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:17:08,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:17:08,225 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-02-05 12:17:08,228 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-02-05 12:17:08,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:17:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:17:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:17:08,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:17:08,324 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:17:08,325 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:17:15,936 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2025-02-05 12:17:15,937 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2025-02-05 12:17:15,937 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2025-02-05 12:17:15,937 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2025-02-05 12:17:15,938 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2025-02-05 12:17:16,293 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-02-05 12:17:16,293 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:17:16,356 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:17:16,357 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:17:16,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:17:16 BoogieIcfgContainer [2025-02-05 12:17:16,358 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:17:16,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:17:16,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:17:16,365 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:17:16,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:17:04" (1/3) ... [2025-02-05 12:17:16,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aabc445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:17:16, skipping insertion in model container [2025-02-05 12:17:16,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:17:06" (2/3) ... [2025-02-05 12:17:16,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aabc445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:17:16, skipping insertion in model container [2025-02-05 12:17:16,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:17:16" (3/3) ... [2025-02-05 12:17:16,369 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label29.c [2025-02-05 12:17:16,383 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:17:16,385 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label29.c that has 1 procedures, 1748 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:17:16,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:17:16,509 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;@9bf022b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:17:16,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:17:16,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:17:16,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 12:17:16,529 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:17:16,530 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] [2025-02-05 12:17:16,530 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:17:16,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:17:16,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1671805994, now seen corresponding path program 1 times [2025-02-05 12:17:16,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:17:16,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617922423] [2025-02-05 12:17:16,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:17:16,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:17:16,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 12:17:16,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 12:17:16,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:17:16,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:17:16,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:17:16,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:17:16,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617922423] [2025-02-05 12:17:16,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617922423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:17:16,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:17:16,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:17:16,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184270117] [2025-02-05 12:17:16,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:17:16,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:17:16,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:17:16,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:17:16,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:17:16,845 INFO L87 Difference]: Start difference. First operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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-02-05 12:17:23,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:17:23,119 INFO L93 Difference]: Finished difference Result 4919 states and 9310 transitions. [2025-02-05 12:17:23,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:17:23,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-02-05 12:17:23,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:17:23,148 INFO L225 Difference]: With dead ends: 4919 [2025-02-05 12:17:23,149 INFO L226 Difference]: Without dead ends: 3107 [2025-02-05 12:17:23,158 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-02-05 12:17:23,160 INFO L435 NwaCegarLoop]: 1277 mSDtfsCounter, 1532 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 4638 mSolverCounterSat, 1110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 5748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1110 IncrementalHoareTripleChecker+Valid, 4638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:17:23,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 1458 Invalid, 5748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1110 Valid, 4638 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-02-05 12:17:23,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2025-02-05 12:17:23,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 3106. [2025-02-05 12:17:23,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3106 states, 3105 states have (on average 1.652818035426731) internal successors, (5132), 3105 states have internal predecessors, (5132), 0 states have call successors, (0), 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-02-05 12:17:23,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 5132 transitions. [2025-02-05 12:17:23,392 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 5132 transitions. Word has length 21 [2025-02-05 12:17:23,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:17:23,393 INFO L471 AbstractCegarLoop]: Abstraction has 3106 states and 5132 transitions. [2025-02-05 12:17:23,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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-02-05 12:17:23,394 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 5132 transitions. [2025-02-05 12:17:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 12:17:23,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:17:23,397 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 12:17:23,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:17:23,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:17:23,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:17:23,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1464008889, now seen corresponding path program 1 times [2025-02-05 12:17:23,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:17:23,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968572998] [2025-02-05 12:17:23,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:17:23,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:17:23,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 12:17:23,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 12:17:23,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:17:23,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:17:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:17:23,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:17:23,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968572998] [2025-02-05 12:17:23,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968572998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:17:23,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:17:23,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:17:23,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105371147] [2025-02-05 12:17:23,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:17:23,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:17:23,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:17:23,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:17:23,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:17:23,704 INFO L87 Difference]: Start difference. First operand 3106 states and 5132 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 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-02-05 12:17:29,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:17:29,651 INFO L93 Difference]: Finished difference Result 9097 states and 15084 transitions. [2025-02-05 12:17:29,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:17:29,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-02-05 12:17:29,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:17:29,677 INFO L225 Difference]: With dead ends: 9097 [2025-02-05 12:17:29,677 INFO L226 Difference]: Without dead ends: 5993 [2025-02-05 12:17:29,683 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-02-05 12:17:29,683 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 2533 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 5120 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2533 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 5554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:17:29,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2533 Valid, 990 Invalid, 5554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5120 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2025-02-05 12:17:29,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2025-02-05 12:17:29,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 5991. [2025-02-05 12:17:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5991 states, 5990 states have (on average 1.606176961602671) internal successors, (9621), 5990 states have internal predecessors, (9621), 0 states have call successors, (0), 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-02-05 12:17:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5991 states to 5991 states and 9621 transitions. [2025-02-05 12:17:29,807 INFO L78 Accepts]: Start accepts. Automaton has 5991 states and 9621 transitions. Word has length 90 [2025-02-05 12:17:29,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:17:29,808 INFO L471 AbstractCegarLoop]: Abstraction has 5991 states and 9621 transitions. [2025-02-05 12:17:29,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 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-02-05 12:17:29,808 INFO L276 IsEmpty]: Start isEmpty. Operand 5991 states and 9621 transitions. [2025-02-05 12:17:29,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 12:17:29,812 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:17:29,812 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:17:29,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:17:29,813 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:17:29,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:17:29,816 INFO L85 PathProgramCache]: Analyzing trace with hash -2063850593, now seen corresponding path program 1 times [2025-02-05 12:17:29,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:17:29,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660670159] [2025-02-05 12:17:29,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:17:29,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:17:29,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 12:17:29,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 12:17:29,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:17:29,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:17:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:17:30,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:17:30,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660670159] [2025-02-05 12:17:30,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660670159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:17:30,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:17:30,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:17:30,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270551008] [2025-02-05 12:17:30,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:17:30,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:17:30,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:17:30,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:17:30,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:17:30,051 INFO L87 Difference]: Start difference. First operand 5991 states and 9621 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 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-02-05 12:17:35,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:17:35,577 INFO L93 Difference]: Finished difference Result 17559 states and 28308 transitions. [2025-02-05 12:17:35,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:17:35,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-02-05 12:17:35,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:17:35,616 INFO L225 Difference]: With dead ends: 17559 [2025-02-05 12:17:35,617 INFO L226 Difference]: Without dead ends: 11570 [2025-02-05 12:17:35,627 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-02-05 12:17:35,628 INFO L435 NwaCegarLoop]: 1564 mSDtfsCounter, 1445 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 4825 mSolverCounterSat, 1045 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1445 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 5870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1045 IncrementalHoareTripleChecker+Valid, 4825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:17:35,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1445 Valid, 1732 Invalid, 5870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1045 Valid, 4825 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-02-05 12:17:35,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11570 states. [2025-02-05 12:17:35,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11570 to 11517. [2025-02-05 12:17:35,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11517 states, 11516 states have (on average 1.4296630774574506) internal successors, (16464), 11516 states have internal predecessors, (16464), 0 states have call successors, (0), 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-02-05 12:17:35,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11517 states to 11517 states and 16464 transitions. [2025-02-05 12:17:35,835 INFO L78 Accepts]: Start accepts. Automaton has 11517 states and 16464 transitions. Word has length 95 [2025-02-05 12:17:35,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:17:35,837 INFO L471 AbstractCegarLoop]: Abstraction has 11517 states and 16464 transitions. [2025-02-05 12:17:35,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 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-02-05 12:17:35,838 INFO L276 IsEmpty]: Start isEmpty. Operand 11517 states and 16464 transitions. [2025-02-05 12:17:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 12:17:35,843 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:17:35,843 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:17:35,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:17:35,843 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:17:35,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:17:35,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1691654273, now seen corresponding path program 1 times [2025-02-05 12:17:35,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:17:35,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516458483] [2025-02-05 12:17:35,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:17:35,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:17:35,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 12:17:35,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 12:17:35,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:17:35,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:17:36,038 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:17:36,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:17:36,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516458483] [2025-02-05 12:17:36,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516458483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:17:36,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:17:36,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:17:36,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396225048] [2025-02-05 12:17:36,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:17:36,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:17:36,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:17:36,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:17:36,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:17:36,042 INFO L87 Difference]: Start difference. First operand 11517 states and 16464 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 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-02-05 12:17:41,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:17:41,503 INFO L93 Difference]: Finished difference Result 34168 states and 48911 transitions. [2025-02-05 12:17:41,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:17:41,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-02-05 12:17:41,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:17:41,561 INFO L225 Difference]: With dead ends: 34168 [2025-02-05 12:17:41,561 INFO L226 Difference]: Without dead ends: 22653 [2025-02-05 12:17:41,575 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-02-05 12:17:41,576 INFO L435 NwaCegarLoop]: 1804 mSDtfsCounter, 1748 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 4312 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 2076 SdHoareTripleChecker+Invalid, 5742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:17:41,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 2076 Invalid, 5742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4312 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-02-05 12:17:41,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22653 states. [2025-02-05 12:17:41,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22653 to 21271. [2025-02-05 12:17:41,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21271 states, 21270 states have (on average 1.2866478608368594) internal successors, (27367), 21270 states have internal predecessors, (27367), 0 states have call successors, (0), 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-02-05 12:17:41,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21271 states to 21271 states and 27367 transitions. [2025-02-05 12:17:41,927 INFO L78 Accepts]: Start accepts. Automaton has 21271 states and 27367 transitions. Word has length 118 [2025-02-05 12:17:41,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:17:41,927 INFO L471 AbstractCegarLoop]: Abstraction has 21271 states and 27367 transitions. [2025-02-05 12:17:41,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 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-02-05 12:17:41,928 INFO L276 IsEmpty]: Start isEmpty. Operand 21271 states and 27367 transitions. [2025-02-05 12:17:41,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 12:17:41,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:17:41,929 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:17:41,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 12:17:41,931 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:17:41,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:17:41,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1797829839, now seen corresponding path program 1 times [2025-02-05 12:17:41,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:17:41,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627769764] [2025-02-05 12:17:41,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:17:41,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:17:41,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 12:17:41,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 12:17:41,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:17:41,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:17:42,144 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:17:42,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:17:42,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627769764] [2025-02-05 12:17:42,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627769764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:17:42,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:17:42,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:17:42,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445146701] [2025-02-05 12:17:42,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:17:42,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:17:42,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:17:42,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:17:42,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:17:42,149 INFO L87 Difference]: Start difference. First operand 21271 states and 27367 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 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-02-05 12:17:47,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:17:47,936 INFO L93 Difference]: Finished difference Result 63157 states and 81268 transitions. [2025-02-05 12:17:47,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:17:47,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2025-02-05 12:17:47,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:17:48,042 INFO L225 Difference]: With dead ends: 63157 [2025-02-05 12:17:48,042 INFO L226 Difference]: Without dead ends: 41888 [2025-02-05 12:17:48,075 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-02-05 12:17:48,078 INFO L435 NwaCegarLoop]: 1668 mSDtfsCounter, 1467 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 4395 mSolverCounterSat, 1425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 5820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1425 IncrementalHoareTripleChecker+Valid, 4395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:17:48,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 1887 Invalid, 5820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1425 Valid, 4395 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-02-05 12:17:48,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41888 states. [2025-02-05 12:17:48,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41888 to 40473. [2025-02-05 12:17:48,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40473 states, 40472 states have (on average 1.1933188377149635) internal successors, (48296), 40472 states have internal predecessors, (48296), 0 states have call successors, (0), 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-02-05 12:17:48,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40473 states to 40473 states and 48296 transitions. [2025-02-05 12:17:48,704 INFO L78 Accepts]: Start accepts. Automaton has 40473 states and 48296 transitions. Word has length 159 [2025-02-05 12:17:48,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:17:48,704 INFO L471 AbstractCegarLoop]: Abstraction has 40473 states and 48296 transitions. [2025-02-05 12:17:48,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 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-02-05 12:17:48,705 INFO L276 IsEmpty]: Start isEmpty. Operand 40473 states and 48296 transitions. [2025-02-05 12:17:48,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-02-05 12:17:48,712 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:17:48,712 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 12:17:48,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 12:17:48,713 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:17:48,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:17:48,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1806295367, now seen corresponding path program 1 times [2025-02-05 12:17:48,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:17:48,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424778320] [2025-02-05 12:17:48,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:17:48,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:17:48,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-05 12:17:48,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-05 12:17:48,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:17:48,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:17:49,962 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 12:17:49,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:17:49,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424778320] [2025-02-05 12:17:49,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424778320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:17:49,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:17:49,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:17:49,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276246591] [2025-02-05 12:17:49,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:17:49,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:17:49,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:17:49,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:17:49,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:17:49,964 INFO L87 Difference]: Start difference. First operand 40473 states and 48296 transitions. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 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-02-05 12:17:57,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:17:57,966 INFO L93 Difference]: Finished difference Result 100135 states and 117552 transitions. [2025-02-05 12:17:57,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:17:57,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 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 388 [2025-02-05 12:17:57,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:17:58,064 INFO L225 Difference]: With dead ends: 100135 [2025-02-05 12:17:58,064 INFO L226 Difference]: Without dead ends: 59664 [2025-02-05 12:17:58,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:17:58,102 INFO L435 NwaCegarLoop]: 1802 mSDtfsCounter, 3756 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 9446 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3756 SdHoareTripleChecker+Valid, 2158 SdHoareTripleChecker+Invalid, 9690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 9446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:17:58,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3756 Valid, 2158 Invalid, 9690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 9446 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2025-02-05 12:17:58,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59664 states. [2025-02-05 12:17:58,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59664 to 56892. [2025-02-05 12:17:58,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56892 states, 56891 states have (on average 1.154470830184036) internal successors, (65679), 56891 states have internal predecessors, (65679), 0 states have call successors, (0), 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-02-05 12:17:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56892 states to 56892 states and 65679 transitions. [2025-02-05 12:17:58,852 INFO L78 Accepts]: Start accepts. Automaton has 56892 states and 65679 transitions. Word has length 388 [2025-02-05 12:17:58,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:17:58,853 INFO L471 AbstractCegarLoop]: Abstraction has 56892 states and 65679 transitions. [2025-02-05 12:17:58,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 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-02-05 12:17:58,853 INFO L276 IsEmpty]: Start isEmpty. Operand 56892 states and 65679 transitions. [2025-02-05 12:17:58,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2025-02-05 12:17:58,862 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:17:58,863 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 12:17:58,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 12:17:58,864 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:17:58,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:17:58,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1668674585, now seen corresponding path program 1 times [2025-02-05 12:17:58,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:17:58,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458912683] [2025-02-05 12:17:58,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:17:58,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:17:58,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-02-05 12:17:58,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-02-05 12:17:58,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:17:58,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:18:00,184 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:18:00,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:18:00,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458912683] [2025-02-05 12:18:00,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458912683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:18:00,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:18:00,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:18:00,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853560215] [2025-02-05 12:18:00,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:18:00,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:18:00,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:18:00,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:18:00,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:18:00,189 INFO L87 Difference]: Start difference. First operand 56892 states and 65679 transitions. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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-02-05 12:18:06,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:18:06,113 INFO L93 Difference]: Finished difference Result 116543 states and 134135 transitions. [2025-02-05 12:18:06,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:18:06,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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 416 [2025-02-05 12:18:06,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:18:06,215 INFO L225 Difference]: With dead ends: 116543 [2025-02-05 12:18:06,215 INFO L226 Difference]: Without dead ends: 59622 [2025-02-05 12:18:06,240 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-02-05 12:18:06,242 INFO L435 NwaCegarLoop]: 1772 mSDtfsCounter, 1138 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 7319 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2114 SdHoareTripleChecker+Invalid, 7327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:18:06,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2114 Invalid, 7327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7319 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-02-05 12:18:06,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59622 states. [2025-02-05 12:18:06,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59622 to 59622. [2025-02-05 12:18:06,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59622 states, 59621 states have (on average 1.1474815920564903) internal successors, (68414), 59621 states have internal predecessors, (68414), 0 states have call successors, (0), 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-02-05 12:18:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59622 states to 59622 states and 68414 transitions. [2025-02-05 12:18:06,807 INFO L78 Accepts]: Start accepts. Automaton has 59622 states and 68414 transitions. Word has length 416 [2025-02-05 12:18:06,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:18:06,808 INFO L471 AbstractCegarLoop]: Abstraction has 59622 states and 68414 transitions. [2025-02-05 12:18:06,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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-02-05 12:18:06,808 INFO L276 IsEmpty]: Start isEmpty. Operand 59622 states and 68414 transitions. [2025-02-05 12:18:06,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2025-02-05 12:18:06,818 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:18:06,818 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 12:18:06,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 12:18:06,819 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:18:06,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:18:06,820 INFO L85 PathProgramCache]: Analyzing trace with hash -911474104, now seen corresponding path program 1 times [2025-02-05 12:18:06,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:18:06,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842356783] [2025-02-05 12:18:06,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:18:06,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:18:06,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 582 statements into 1 equivalence classes. [2025-02-05 12:18:06,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 582 of 582 statements. [2025-02-05 12:18:06,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:18:06,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:18:07,682 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:18:07,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:18:07,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842356783] [2025-02-05 12:18:07,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842356783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:18:07,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:18:07,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:18:07,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987951005] [2025-02-05 12:18:07,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:18:07,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:18:07,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:18:07,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:18:07,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:18:07,690 INFO L87 Difference]: Start difference. First operand 59622 states and 68414 transitions. Second operand has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 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-02-05 12:18:13,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:18:13,448 INFO L93 Difference]: Finished difference Result 135757 states and 158848 transitions. [2025-02-05 12:18:13,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:18:13,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 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 582 [2025-02-05 12:18:13,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:18:13,520 INFO L225 Difference]: With dead ends: 135757 [2025-02-05 12:18:13,520 INFO L226 Difference]: Without dead ends: 78867 [2025-02-05 12:18:13,554 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-02-05 12:18:13,555 INFO L435 NwaCegarLoop]: 2830 mSDtfsCounter, 1455 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4116 mSolverCounterSat, 1789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 3008 SdHoareTripleChecker+Invalid, 5905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1789 IncrementalHoareTripleChecker+Valid, 4116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:18:13,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1455 Valid, 3008 Invalid, 5905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1789 Valid, 4116 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-02-05 12:18:13,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78867 states. [2025-02-05 12:18:14,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78867 to 78762. [2025-02-05 12:18:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78762 states, 78761 states have (on average 1.1383806706364825) internal successors, (89660), 78761 states have internal predecessors, (89660), 0 states have call successors, (0), 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-02-05 12:18:14,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78762 states to 78762 states and 89660 transitions. [2025-02-05 12:18:14,344 INFO L78 Accepts]: Start accepts. Automaton has 78762 states and 89660 transitions. Word has length 582 [2025-02-05 12:18:14,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:18:14,345 INFO L471 AbstractCegarLoop]: Abstraction has 78762 states and 89660 transitions. [2025-02-05 12:18:14,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 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-02-05 12:18:14,346 INFO L276 IsEmpty]: Start isEmpty. Operand 78762 states and 89660 transitions. [2025-02-05 12:18:14,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 716 [2025-02-05 12:18:14,351 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:18:14,351 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 12:18:14,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 12:18:14,352 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:18:14,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:18:14,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1030858955, now seen corresponding path program 1 times [2025-02-05 12:18:14,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:18:14,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143034329] [2025-02-05 12:18:14,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:18:14,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:18:14,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 715 statements into 1 equivalence classes. [2025-02-05 12:18:14,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 715 of 715 statements. [2025-02-05 12:18:14,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:18:14,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:18:15,460 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2025-02-05 12:18:15,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:18:15,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143034329] [2025-02-05 12:18:15,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143034329] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:18:15,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:18:15,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:18:15,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170677851] [2025-02-05 12:18:15,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:18:15,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:18:15,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:18:15,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:18:15,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:18:15,467 INFO L87 Difference]: Start difference. First operand 78762 states and 89660 transitions. Second operand has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)