./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label42.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_label42.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 07b24adb8d1690a690440be2a1429dd427e8718e8ee7383841282dfd2e0d0b82 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:18:20,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:18:20,183 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:18:20,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:18:20,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:18:20,214 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:18:20,215 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:18:20,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:18:20,216 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:18:20,216 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:18:20,217 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:18:20,217 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:18:20,217 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:18:20,218 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:18:20,218 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:18:20,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:18:20,218 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:18:20,218 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:18:20,219 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:18:20,219 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:18:20,219 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:18:20,219 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:18:20,219 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:18:20,219 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:18:20,219 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:18:20,219 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:18:20,219 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:18:20,220 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:18:20,220 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:18:20,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:18:20,220 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:18:20,220 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:18:20,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:18:20,220 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:18:20,220 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:18:20,221 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:18:20,221 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:18:20,221 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:18:20,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:18:20,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:18:20,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:18:20,221 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:18:20,221 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:18:20,221 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 -> 07b24adb8d1690a690440be2a1429dd427e8718e8ee7383841282dfd2e0d0b82 [2025-02-05 12:18:20,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:18:20,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:18:20,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:18:20,495 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:18:20,495 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:18:20,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label42.c [2025-02-05 12:18:21,778 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d108c137/69c649191b704c7c9541428fc597f0e2/FLAG741f4ac05 [2025-02-05 12:18:22,522 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:18:22,524 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label42.c [2025-02-05 12:18:22,581 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d108c137/69c649191b704c7c9541428fc597f0e2/FLAG741f4ac05 [2025-02-05 12:18:22,595 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d108c137/69c649191b704c7c9541428fc597f0e2 [2025-02-05 12:18:22,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:18:22,599 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:18:22,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:18:22,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:18:22,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:18:22,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:18:22" (1/1) ... [2025-02-05 12:18:22,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a665fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:22, skipping insertion in model container [2025-02-05 12:18:22,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:18:22" (1/1) ... [2025-02-05 12:18:22,754 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:18:23,028 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_label42.c[1692,1705] [2025-02-05 12:18:23,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:18:23,991 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:18:24,005 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_label42.c[1692,1705] [2025-02-05 12:18:24,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:18:24,605 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:18:24,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:24 WrapperNode [2025-02-05 12:18:24,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:18:24,609 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:18:24,609 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:18:24,609 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:18:24,615 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:18:24" (1/1) ... [2025-02-05 12:18:24,730 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:18:24" (1/1) ... [2025-02-05 12:18:25,430 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-02-05 12:18:25,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:18:25,435 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:18:25,435 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:18:25,435 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:18:25,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:24" (1/1) ... [2025-02-05 12:18:25,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:24" (1/1) ... [2025-02-05 12:18:25,833 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:24" (1/1) ... [2025-02-05 12:18:26,108 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:18:26,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:24" (1/1) ... [2025-02-05 12:18:26,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:24" (1/1) ... [2025-02-05 12:18:26,367 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:24" (1/1) ... [2025-02-05 12:18:26,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:24" (1/1) ... [2025-02-05 12:18:26,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:24" (1/1) ... [2025-02-05 12:18:26,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:24" (1/1) ... [2025-02-05 12:18:26,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:18:26,736 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:18:26,737 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:18:26,738 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:18:26,739 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:24" (1/1) ... [2025-02-05 12:18:26,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:18:26,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:18:26,772 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:18:26,776 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:18:26,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:18:26,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:18:26,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:18:26,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:18:26,871 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:18:26,873 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:18:34,388 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2025-02-05 12:18:34,389 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2025-02-05 12:18:34,389 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2025-02-05 12:18:34,389 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2025-02-05 12:18:34,389 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2025-02-05 12:18:34,799 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-02-05 12:18:34,800 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:18:34,867 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:18:34,867 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:18:34,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:18:34 BoogieIcfgContainer [2025-02-05 12:18:34,868 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:18:34,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:18:34,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:18:34,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:18:34,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:18:22" (1/3) ... [2025-02-05 12:18:34,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5a051b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:18:34, skipping insertion in model container [2025-02-05 12:18:34,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:18:24" (2/3) ... [2025-02-05 12:18:34,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5a051b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:18:34, skipping insertion in model container [2025-02-05 12:18:34,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:18:34" (3/3) ... [2025-02-05 12:18:34,879 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label42.c [2025-02-05 12:18:34,895 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:18:34,897 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label42.c that has 1 procedures, 1748 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:18:34,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:18:35,009 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;@3288a14f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:18:35,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:18:35,023 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:18:35,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-05 12:18:35,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:18:35,028 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:18:35,028 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:18:35,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:18:35,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1251554500, now seen corresponding path program 1 times [2025-02-05 12:18:35,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:18:35,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779061264] [2025-02-05 12:18:35,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:18:35,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:18:35,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-05 12:18:35,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-05 12:18:35,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:18:35,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:18:35,232 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:18:35,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:18:35,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779061264] [2025-02-05 12:18:35,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779061264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:18:35,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:18:35,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:18:35,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396203253] [2025-02-05 12:18:35,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:18:35,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:18:35,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:18:35,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:18:35,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:18:35,268 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 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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:41,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:18:41,586 INFO L93 Difference]: Finished difference Result 4919 states and 9310 transitions. [2025-02-05 12:18:41,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:18:41,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2025-02-05 12:18:41,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:18:41,624 INFO L225 Difference]: With dead ends: 4919 [2025-02-05 12:18:41,624 INFO L226 Difference]: Without dead ends: 3107 [2025-02-05 12:18:41,633 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:18:41,640 INFO L435 NwaCegarLoop]: 1277 mSDtfsCounter, 1544 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 4638 mSolverCounterSat, 1110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1544 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:18:41,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1544 Valid, 1458 Invalid, 5748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1110 Valid, 4638 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2025-02-05 12:18:41,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2025-02-05 12:18:41,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 3106. [2025-02-05 12:18:41,874 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:18:41,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 5132 transitions. [2025-02-05 12:18:41,891 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 5132 transitions. Word has length 9 [2025-02-05 12:18:41,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:18:41,892 INFO L471 AbstractCegarLoop]: Abstraction has 3106 states and 5132 transitions. [2025-02-05 12:18:41,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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:41,892 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 5132 transitions. [2025-02-05 12:18:41,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 12:18:41,894 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:18:41,894 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:18:41,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:18:41,895 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:18:41,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:18:41,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1238533863, now seen corresponding path program 1 times [2025-02-05 12:18:41,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:18:41,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939005262] [2025-02-05 12:18:41,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:18:41,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:18:41,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 12:18:41,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 12:18:41,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:18:41,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:18:42,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:18:42,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:18:42,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939005262] [2025-02-05 12:18:42,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939005262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:18:42,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:18:42,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:18:42,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625363478] [2025-02-05 12:18:42,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:18:42,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:18:42,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:18:42,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:18:42,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:18:42,203 INFO L87 Difference]: Start difference. First operand 3106 states and 5132 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 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:48,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:18:48,088 INFO L93 Difference]: Finished difference Result 9097 states and 15084 transitions. [2025-02-05 12:18:48,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:18:48,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 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 78 [2025-02-05 12:18:48,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:18:48,115 INFO L225 Difference]: With dead ends: 9097 [2025-02-05 12:18:48,115 INFO L226 Difference]: Without dead ends: 5993 [2025-02-05 12:18:48,122 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:18:48,123 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 2533 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 5120 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s 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.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:18:48,123 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.7s Time] [2025-02-05 12:18:48,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2025-02-05 12:18:48,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 5991. [2025-02-05 12:18:48,232 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:18:48,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5991 states to 5991 states and 9621 transitions. [2025-02-05 12:18:48,243 INFO L78 Accepts]: Start accepts. Automaton has 5991 states and 9621 transitions. Word has length 78 [2025-02-05 12:18:48,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:18:48,244 INFO L471 AbstractCegarLoop]: Abstraction has 5991 states and 9621 transitions. [2025-02-05 12:18:48,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 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:48,244 INFO L276 IsEmpty]: Start isEmpty. Operand 5991 states and 9621 transitions. [2025-02-05 12:18:48,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 12:18:48,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:18:48,248 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:18:48,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:18:48,248 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:18:48,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:18:48,248 INFO L85 PathProgramCache]: Analyzing trace with hash 769268465, now seen corresponding path program 1 times [2025-02-05 12:18:48,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:18:48,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056813658] [2025-02-05 12:18:48,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:18:48,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:18:48,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 12:18:48,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 12:18:48,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:18:48,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:18:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:18:48,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:18:48,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056813658] [2025-02-05 12:18:48,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056813658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:18:48,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:18:48,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:18:48,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396764124] [2025-02-05 12:18:48,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:18:48,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:18:48,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:18:48,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:18:48,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:18:48,436 INFO L87 Difference]: Start difference. First operand 5991 states and 9621 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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:53,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:18:53,595 INFO L93 Difference]: Finished difference Result 17559 states and 28308 transitions. [2025-02-05 12:18:53,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:18:53,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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 83 [2025-02-05 12:18:53,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:18:53,640 INFO L225 Difference]: With dead ends: 17559 [2025-02-05 12:18:53,640 INFO L226 Difference]: Without dead ends: 11570 [2025-02-05 12:18:53,652 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:18:53,653 INFO L435 NwaCegarLoop]: 1564 mSDtfsCounter, 1445 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 4825 mSolverCounterSat, 1045 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s 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.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:18:53,653 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.0s Time] [2025-02-05 12:18:53,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11570 states. [2025-02-05 12:18:53,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11570 to 11517. [2025-02-05 12:18:53,833 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:18:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11517 states to 11517 states and 16464 transitions. [2025-02-05 12:18:53,853 INFO L78 Accepts]: Start accepts. Automaton has 11517 states and 16464 transitions. Word has length 83 [2025-02-05 12:18:53,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:18:53,855 INFO L471 AbstractCegarLoop]: Abstraction has 11517 states and 16464 transitions. [2025-02-05 12:18:53,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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:53,856 INFO L276 IsEmpty]: Start isEmpty. Operand 11517 states and 16464 transitions. [2025-02-05 12:18:53,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 12:18:53,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:18:53,857 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 12:18:53,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:18:53,857 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:18:53,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:18:53,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1898854739, now seen corresponding path program 1 times [2025-02-05 12:18:53,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:18:53,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269801842] [2025-02-05 12:18:53,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:18:53,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:18:53,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 12:18:53,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 12:18:53,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:18:53,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:18:54,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:18:54,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:18:54,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269801842] [2025-02-05 12:18:54,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269801842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:18:54,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:18:54,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:18:54,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677252971] [2025-02-05 12:18:54,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:18:54,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:18:54,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:18:54,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:18:54,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:18:54,069 INFO L87 Difference]: Start difference. First operand 11517 states and 16464 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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:59,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:18:59,473 INFO L93 Difference]: Finished difference Result 34168 states and 48911 transitions. [2025-02-05 12:18:59,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:18:59,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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 106 [2025-02-05 12:18:59,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:18:59,532 INFO L225 Difference]: With dead ends: 34168 [2025-02-05 12:18:59,532 INFO L226 Difference]: Without dead ends: 22653 [2025-02-05 12:18:59,549 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:18:59,550 INFO L435 NwaCegarLoop]: 1804 mSDtfsCounter, 1748 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 4312 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s 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.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:18:59,550 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.2s Time] [2025-02-05 12:18:59,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22653 states. [2025-02-05 12:18:59,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22653 to 21271. [2025-02-05 12:18:59,835 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:18:59,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21271 states to 21271 states and 27367 transitions. [2025-02-05 12:18:59,863 INFO L78 Accepts]: Start accepts. Automaton has 21271 states and 27367 transitions. Word has length 106 [2025-02-05 12:18:59,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:18:59,864 INFO L471 AbstractCegarLoop]: Abstraction has 21271 states and 27367 transitions. [2025-02-05 12:18:59,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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:59,865 INFO L276 IsEmpty]: Start isEmpty. Operand 21271 states and 27367 transitions. [2025-02-05 12:18:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 12:18:59,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:18:59,866 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 12:18:59,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 12:18:59,866 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:18:59,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:18:59,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1364161149, now seen corresponding path program 1 times [2025-02-05 12:18:59,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:18:59,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28760665] [2025-02-05 12:18:59,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:18:59,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:18:59,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 12:18:59,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 12:18:59,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:18:59,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:19:00,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:19:00,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:19:00,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28760665] [2025-02-05 12:19:00,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28760665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:19:00,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:19:00,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:19:00,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856989161] [2025-02-05 12:19:00,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:19:00,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:19:00,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:19:00,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:19:00,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:19:00,090 INFO L87 Difference]: Start difference. First operand 21271 states and 27367 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 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:19:05,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:19:05,581 INFO L93 Difference]: Finished difference Result 63159 states and 81269 transitions. [2025-02-05 12:19:05,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:19:05,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 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 147 [2025-02-05 12:19:05,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:19:05,669 INFO L225 Difference]: With dead ends: 63159 [2025-02-05 12:19:05,670 INFO L226 Difference]: Without dead ends: 41890 [2025-02-05 12:19:05,700 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:19:05,702 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1469 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 4396 mSolverCounterSat, 1424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 5820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1424 IncrementalHoareTripleChecker+Valid, 4396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:19:05,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1469 Valid, 1886 Invalid, 5820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1424 Valid, 4396 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-02-05 12:19:05,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41890 states. [2025-02-05 12:19:06,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41890 to 41838. [2025-02-05 12:19:06,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41838 states, 41837 states have (on average 1.1881110022229127) internal successors, (49707), 41837 states have internal predecessors, (49707), 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:19:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41838 states to 41838 states and 49707 transitions. [2025-02-05 12:19:06,462 INFO L78 Accepts]: Start accepts. Automaton has 41838 states and 49707 transitions. Word has length 147 [2025-02-05 12:19:06,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:19:06,463 INFO L471 AbstractCegarLoop]: Abstraction has 41838 states and 49707 transitions. [2025-02-05 12:19:06,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 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:19:06,464 INFO L276 IsEmpty]: Start isEmpty. Operand 41838 states and 49707 transitions. [2025-02-05 12:19:06,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-02-05 12:19:06,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:19:06,471 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 12:19:06,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 12:19:06,471 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:19:06,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:19:06,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2073709350, now seen corresponding path program 1 times [2025-02-05 12:19:06,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:19:06,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528830126] [2025-02-05 12:19:06,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:19:06,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:19:06,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-05 12:19:06,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-05 12:19:06,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:19:06,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:19:06,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:19:06,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:19:06,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528830126] [2025-02-05 12:19:06,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528830126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:19:06,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:19:06,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:19:06,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256298750] [2025-02-05 12:19:06,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:19:06,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:19:06,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:19:06,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:19:06,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:19:06,742 INFO L87 Difference]: Start difference. First operand 41838 states and 49707 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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:19:12,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:19:12,179 INFO L93 Difference]: Finished difference Result 102810 states and 123628 transitions. [2025-02-05 12:19:12,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:19:12,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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 216 [2025-02-05 12:19:12,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:19:12,277 INFO L225 Difference]: With dead ends: 102810 [2025-02-05 12:19:12,278 INFO L226 Difference]: Without dead ends: 59607 [2025-02-05 12:19:12,314 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:19:12,316 INFO L435 NwaCegarLoop]: 3088 mSDtfsCounter, 1471 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 3732 mSolverCounterSat, 1895 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 3278 SdHoareTripleChecker+Invalid, 5627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1895 IncrementalHoareTripleChecker+Valid, 3732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:19:12,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1471 Valid, 3278 Invalid, 5627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1895 Valid, 3732 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-02-05 12:19:12,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59607 states. [2025-02-05 12:19:12,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59607 to 59596. [2025-02-05 12:19:12,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59596 states, 59595 states have (on average 1.1474452554744525) internal successors, (68382), 59595 states have internal predecessors, (68382), 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:19:13,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59596 states to 59596 states and 68382 transitions. [2025-02-05 12:19:13,023 INFO L78 Accepts]: Start accepts. Automaton has 59596 states and 68382 transitions. Word has length 216 [2025-02-05 12:19:13,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:19:13,023 INFO L471 AbstractCegarLoop]: Abstraction has 59596 states and 68382 transitions. [2025-02-05 12:19:13,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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:19:13,024 INFO L276 IsEmpty]: Start isEmpty. Operand 59596 states and 68382 transitions. [2025-02-05 12:19:13,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-02-05 12:19:13,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:19:13,030 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:19:13,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 12:19:13,031 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:19:13,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:19:13,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1952069760, now seen corresponding path program 1 times [2025-02-05 12:19:13,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:19:13,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853213256] [2025-02-05 12:19:13,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:19:13,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:19:13,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-02-05 12:19:13,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-02-05 12:19:13,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:19:13,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:19:14,464 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 12:19:14,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:19:14,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853213256] [2025-02-05 12:19:14,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853213256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:19:14,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:19:14,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:19:14,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522361791] [2025-02-05 12:19:14,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:19:14,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:19:14,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:19:14,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:19:14,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:19:14,467 INFO L87 Difference]: Start difference. First operand 59596 states and 68382 transitions. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 3 states have internal predecessors, (429), 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:19:22,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:19:22,565 INFO L93 Difference]: Finished difference Result 146572 states and 166170 transitions. [2025-02-05 12:19:22,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:19:22,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 3 states have internal predecessors, (429), 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 435 [2025-02-05 12:19:22,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:19:22,698 INFO L225 Difference]: With dead ends: 146572 [2025-02-05 12:19:22,698 INFO L226 Difference]: Without dead ends: 86978 [2025-02-05 12:19:22,745 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:19:22,746 INFO L435 NwaCegarLoop]: 1797 mSDtfsCounter, 3760 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 9421 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3760 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 9688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 9421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:19:22,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3760 Valid, 2153 Invalid, 9688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 9421 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2025-02-05 12:19:22,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86978 states. [2025-02-05 12:19:23,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86978 to 84203. [2025-02-05 12:19:23,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84203 states, 84202 states have (on average 1.1178950618750148) internal successors, (94129), 84202 states have internal predecessors, (94129), 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:19:23,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84203 states to 84203 states and 94129 transitions. [2025-02-05 12:19:23,843 INFO L78 Accepts]: Start accepts. Automaton has 84203 states and 94129 transitions. Word has length 435 [2025-02-05 12:19:23,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:19:23,844 INFO L471 AbstractCegarLoop]: Abstraction has 84203 states and 94129 transitions. [2025-02-05 12:19:23,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 3 states have internal predecessors, (429), 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:19:23,844 INFO L276 IsEmpty]: Start isEmpty. Operand 84203 states and 94129 transitions. [2025-02-05 12:19:23,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-02-05 12:19:23,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:19:23,855 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:19:23,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 12:19:23,856 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:19:23,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:19:23,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1546473326, now seen corresponding path program 1 times [2025-02-05 12:19:23,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:19:23,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634816008] [2025-02-05 12:19:23,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:19:23,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:19:23,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-02-05 12:19:23,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-02-05 12:19:23,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:19:23,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:19:24,793 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:19:24,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:19:24,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634816008] [2025-02-05 12:19:24,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634816008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:19:24,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:19:24,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:19:24,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336634336] [2025-02-05 12:19:24,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:19:24,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:19:24,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:19:24,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:19:24,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:19:24,797 INFO L87 Difference]: Start difference. First operand 84203 states and 94129 transitions. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 3 states have internal predecessors, (463), 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:19:30,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:19:30,204 INFO L93 Difference]: Finished difference Result 171165 states and 191035 transitions. [2025-02-05 12:19:30,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:19:30,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 3 states have internal predecessors, (463), 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 463 [2025-02-05 12:19:30,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:19:30,310 INFO L225 Difference]: With dead ends: 171165 [2025-02-05 12:19:30,310 INFO L226 Difference]: Without dead ends: 86933 [2025-02-05 12:19:30,349 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:19:30,350 INFO L435 NwaCegarLoop]: 1769 mSDtfsCounter, 1151 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 5709 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 5717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:19:30,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1948 Invalid, 5717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 5709 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-02-05 12:19:30,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86933 states. [2025-02-05 12:19:30,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86933 to 86933. [2025-02-05 12:19:31,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86933 states, 86932 states have (on average 1.1142502185616343) internal successors, (96864), 86932 states have internal predecessors, (96864), 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:19:31,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86933 states to 86933 states and 96864 transitions. [2025-02-05 12:19:31,109 INFO L78 Accepts]: Start accepts. Automaton has 86933 states and 96864 transitions. Word has length 463 [2025-02-05 12:19:31,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:19:31,110 INFO L471 AbstractCegarLoop]: Abstraction has 86933 states and 96864 transitions. [2025-02-05 12:19:31,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 3 states have internal predecessors, (463), 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:19:31,110 INFO L276 IsEmpty]: Start isEmpty. Operand 86933 states and 96864 transitions. [2025-02-05 12:19:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2025-02-05 12:19:31,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:19:31,113 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:31,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 12:19:31,113 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:19:31,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:19:31,114 INFO L85 PathProgramCache]: Analyzing trace with hash 806572908, now seen corresponding path program 1 times [2025-02-05 12:19:31,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:19:31,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159123853] [2025-02-05 12:19:31,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:19:31,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:19:31,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 581 statements into 1 equivalence classes. [2025-02-05 12:19:31,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 581 of 581 statements. [2025-02-05 12:19:31,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:19:31,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:19:31,724 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 12:19:31,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:19:31,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159123853] [2025-02-05 12:19:31,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159123853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:19:31,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:19:31,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:19:31,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889999208] [2025-02-05 12:19:31,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:19:31,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:19:31,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:19:31,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:19:31,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:19:31,728 INFO L87 Difference]: Start difference. First operand 86933 states and 96864 transitions. Second operand has 3 states, 3 states have (on average 166.0) internal successors, (498), 2 states have internal predecessors, (498), 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:19:36,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:19:36,901 INFO L93 Difference]: Finished difference Result 190273 states and 212624 transitions. [2025-02-05 12:19:36,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:19:36,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 2 states have internal predecessors, (498), 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 581 [2025-02-05 12:19:36,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:19:37,008 INFO L225 Difference]: With dead ends: 190273 [2025-02-05 12:19:37,008 INFO L226 Difference]: Without dead ends: 106072 [2025-02-05 12:19:37,056 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:19:37,057 INFO L435 NwaCegarLoop]: 701 mSDtfsCounter, 1386 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 3925 mSolverCounterSat, 1668 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1386 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 5593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1668 IncrementalHoareTripleChecker+Valid, 3925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:19:37,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1386 Valid, 751 Invalid, 5593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1668 Valid, 3925 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-02-05 12:19:37,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106072 states.