./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label29.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label29.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f598b1db7f2b2cd1017a328f20419506fd47df23c7e336ea67891b462314c30 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:44:18,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:44:18,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:44:18,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:44:18,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:44:18,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:44:18,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:44:18,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:44:18,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:44:18,232 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:44:18,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:44:18,232 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:44:18,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:44:18,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:44:18,233 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:44:18,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:44:18,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:44:18,233 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:44:18,234 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:44:18,234 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:44:18,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:44:18,234 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:44:18,234 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:44:18,234 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:44:18,234 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:44:18,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:44:18,235 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:44:18,235 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:44:18,235 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:44:18,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:44:18,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:44:18,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:44:18,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:44:18,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:44:18,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:44:18,236 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:44:18,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:44:18,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:44:18,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:44:18,236 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:44:18,236 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:44:18,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:44:18,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:44:18,237 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 -> 8f598b1db7f2b2cd1017a328f20419506fd47df23c7e336ea67891b462314c30 [2025-02-05 11:44:18,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:44:18,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:44:18,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:44:18,500 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:44:18,500 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:44:18,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label29.c [2025-02-05 11:44:19,780 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/838a09976/484448bc85734514acc61f945216ade7/FLAGf19a63c23 [2025-02-05 11:44:20,466 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:44:20,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label29.c [2025-02-05 11:44:20,506 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/838a09976/484448bc85734514acc61f945216ade7/FLAGf19a63c23 [2025-02-05 11:44:20,522 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/838a09976/484448bc85734514acc61f945216ade7 [2025-02-05 11:44:20,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:44:20,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:44:20,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:44:20,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:44:20,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:44:20,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:44:20" (1/1) ... [2025-02-05 11:44:20,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54c292c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:20, skipping insertion in model container [2025-02-05 11:44:20,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:44:20" (1/1) ... [2025-02-05 11:44:20,649 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:44:20,929 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label29.c[2333,2346] [2025-02-05 11:44:21,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:44:21,704 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:44:21,720 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label29.c[2333,2346] [2025-02-05 11:44:22,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:44:22,153 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:44:22,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:22 WrapperNode [2025-02-05 11:44:22,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:44:22,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:44:22,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:44:22,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:44:22,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:22" (1/1) ... [2025-02-05 11:44:22,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:22" (1/1) ... [2025-02-05 11:44:22,750 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-02-05 11:44:22,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:44:22,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:44:22,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:44:22,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:44:22,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:22" (1/1) ... [2025-02-05 11:44:22,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:22" (1/1) ... [2025-02-05 11:44:22,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:22" (1/1) ... [2025-02-05 11:44:23,098 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 11:44:23,099 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:22" (1/1) ... [2025-02-05 11:44:23,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:22" (1/1) ... [2025-02-05 11:44:23,349 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:22" (1/1) ... [2025-02-05 11:44:23,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:22" (1/1) ... [2025-02-05 11:44:23,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:22" (1/1) ... [2025-02-05 11:44:23,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:22" (1/1) ... [2025-02-05 11:44:23,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:44:23,622 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:44:23,623 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:44:23,623 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:44:23,624 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:22" (1/1) ... [2025-02-05 11:44:23,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:44:23,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:44:23,690 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 11:44:23,700 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 11:44:23,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:44:23,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:44:23,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:44:23,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:44:23,804 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:44:23,806 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:44:29,012 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-02-05 11:44:29,012 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-02-05 11:44:29,013 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-02-05 11:44:29,329 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-02-05 11:44:29,329 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:44:29,377 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:44:29,377 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:44:29,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:44:29 BoogieIcfgContainer [2025-02-05 11:44:29,377 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:44:29,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:44:29,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:44:29,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:44:29,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:44:20" (1/3) ... [2025-02-05 11:44:29,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1cb9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:44:29, skipping insertion in model container [2025-02-05 11:44:29,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:22" (2/3) ... [2025-02-05 11:44:29,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1cb9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:44:29, skipping insertion in model container [2025-02-05 11:44:29,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:44:29" (3/3) ... [2025-02-05 11:44:29,388 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label29.c [2025-02-05 11:44:29,403 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:44:29,404 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label29.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:44:29,496 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:44:29,507 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;@33d1acbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:44:29,509 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:44:29,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:29,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 11:44:29,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:29,525 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:44:29,526 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:29,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:29,531 INFO L85 PathProgramCache]: Analyzing trace with hash 349013650, now seen corresponding path program 1 times [2025-02-05 11:44:29,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:29,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645219997] [2025-02-05 11:44:29,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:29,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:29,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 11:44:29,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 11:44:29,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:29,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:29,770 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 11:44:29,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:29,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645219997] [2025-02-05 11:44:29,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645219997] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:29,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:29,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:44:29,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401484393] [2025-02-05 11:44:29,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:29,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:29,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:29,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:29,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:29,803 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 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 11:44:33,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:33,478 INFO L93 Difference]: Finished difference Result 3082 states and 5686 transitions. [2025-02-05 11:44:33,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:33,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 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 14 [2025-02-05 11:44:33,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:33,497 INFO L225 Difference]: With dead ends: 3082 [2025-02-05 11:44:33,497 INFO L226 Difference]: Without dead ends: 1899 [2025-02-05 11:44:33,502 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 11:44:33,504 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 1025 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 2955 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 3554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 2955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:33,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 646 Invalid, 3554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 2955 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-02-05 11:44:33,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2025-02-05 11:44:33,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1894. [2025-02-05 11:44:33,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1893 states have (on average 1.7374537770734284) internal successors, (3289), 1893 states have internal predecessors, (3289), 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 11:44:33,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 3289 transitions. [2025-02-05 11:44:33,635 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 3289 transitions. Word has length 14 [2025-02-05 11:44:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:33,635 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 3289 transitions. [2025-02-05 11:44:33,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 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 11:44:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 3289 transitions. [2025-02-05 11:44:33,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 11:44:33,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:33,638 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 11:44:33,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:44:33,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:33,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:33,640 INFO L85 PathProgramCache]: Analyzing trace with hash -562131541, now seen corresponding path program 1 times [2025-02-05 11:44:33,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:33,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404660442] [2025-02-05 11:44:33,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:33,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:33,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 11:44:33,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 11:44:33,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:33,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:34,138 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:44:34,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:34,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404660442] [2025-02-05 11:44:34,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404660442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:34,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:34,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:44:34,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760973722] [2025-02-05 11:44:34,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:34,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:34,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:34,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:34,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:34,143 INFO L87 Difference]: Start difference. First operand 1894 states and 3289 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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 11:44:38,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:38,091 INFO L93 Difference]: Finished difference Result 5437 states and 9566 transitions. [2025-02-05 11:44:38,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:38,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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 79 [2025-02-05 11:44:38,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:38,108 INFO L225 Difference]: With dead ends: 5437 [2025-02-05 11:44:38,108 INFO L226 Difference]: Without dead ends: 3545 [2025-02-05 11:44:38,112 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 11:44:38,114 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 815 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3127 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 3488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 3127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:38,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 881 Invalid, 3488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 3127 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-02-05 11:44:38,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3545 states. [2025-02-05 11:44:38,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3545 to 3484. [2025-02-05 11:44:38,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 3483 states have (on average 1.5865633074935401) internal successors, (5526), 3483 states have internal predecessors, (5526), 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 11:44:38,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 5526 transitions. [2025-02-05 11:44:38,197 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 5526 transitions. Word has length 79 [2025-02-05 11:44:38,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:38,198 INFO L471 AbstractCegarLoop]: Abstraction has 3484 states and 5526 transitions. [2025-02-05 11:44:38,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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 11:44:38,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 5526 transitions. [2025-02-05 11:44:38,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 11:44:38,201 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:38,201 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 11:44:38,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:44:38,202 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:38,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:38,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1035125831, now seen corresponding path program 1 times [2025-02-05 11:44:38,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:38,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554928742] [2025-02-05 11:44:38,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:38,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:38,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 11:44:38,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 11:44:38,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:38,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:38,375 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:44:38,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:38,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554928742] [2025-02-05 11:44:38,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554928742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:38,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:38,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:44:38,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118297878] [2025-02-05 11:44:38,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:38,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:38,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:38,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:38,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:38,377 INFO L87 Difference]: Start difference. First operand 3484 states and 5526 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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 11:44:41,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:41,607 INFO L93 Difference]: Finished difference Result 10138 states and 16134 transitions. [2025-02-05 11:44:41,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:41,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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 80 [2025-02-05 11:44:41,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:41,635 INFO L225 Difference]: With dead ends: 10138 [2025-02-05 11:44:41,635 INFO L226 Difference]: Without dead ends: 6656 [2025-02-05 11:44:41,642 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 11:44:41,643 INFO L435 NwaCegarLoop]: 983 mSDtfsCounter, 871 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 3256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:41,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1136 Invalid, 3256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 11:44:41,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6656 states. [2025-02-05 11:44:41,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6656 to 6655. [2025-02-05 11:44:41,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6655 states, 6654 states have (on average 1.4171926660655245) internal successors, (9430), 6654 states have internal predecessors, (9430), 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 11:44:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6655 states to 6655 states and 9430 transitions. [2025-02-05 11:44:41,794 INFO L78 Accepts]: Start accepts. Automaton has 6655 states and 9430 transitions. Word has length 80 [2025-02-05 11:44:41,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:41,797 INFO L471 AbstractCegarLoop]: Abstraction has 6655 states and 9430 transitions. [2025-02-05 11:44:41,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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 11:44:41,797 INFO L276 IsEmpty]: Start isEmpty. Operand 6655 states and 9430 transitions. [2025-02-05 11:44:41,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 11:44:41,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:41,799 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 11:44:41,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:44:41,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:41,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:41,802 INFO L85 PathProgramCache]: Analyzing trace with hash -983222751, now seen corresponding path program 1 times [2025-02-05 11:44:41,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:41,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537728518] [2025-02-05 11:44:41,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:41,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:41,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 11:44:41,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 11:44:41,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:41,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:44:41,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:41,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537728518] [2025-02-05 11:44:41,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537728518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:41,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:41,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:44:41,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037274283] [2025-02-05 11:44:41,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:41,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:41,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:41,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:41,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:41,950 INFO L87 Difference]: Start difference. First operand 6655 states and 9430 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 11:44:45,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:45,087 INFO L93 Difference]: Finished difference Result 14120 states and 20673 transitions. [2025-02-05 11:44:45,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:45,088 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 11:44:45,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:45,105 INFO L225 Difference]: With dead ends: 14120 [2025-02-05 11:44:45,105 INFO L226 Difference]: Without dead ends: 7467 [2025-02-05 11:44:45,113 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 11:44:45,114 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 872 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2662 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 3381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:45,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1176 Invalid, 3381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2662 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-05 11:44:45,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2025-02-05 11:44:45,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 7456. [2025-02-05 11:44:45,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7456 states, 7455 states have (on average 1.3389671361502347) internal successors, (9982), 7455 states have internal predecessors, (9982), 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 11:44:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7456 states to 7456 states and 9982 transitions. [2025-02-05 11:44:45,276 INFO L78 Accepts]: Start accepts. Automaton has 7456 states and 9982 transitions. Word has length 83 [2025-02-05 11:44:45,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:45,277 INFO L471 AbstractCegarLoop]: Abstraction has 7456 states and 9982 transitions. [2025-02-05 11:44:45,278 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 11:44:45,278 INFO L276 IsEmpty]: Start isEmpty. Operand 7456 states and 9982 transitions. [2025-02-05 11:44:45,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 11:44:45,282 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:45,282 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 11:44:45,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:44:45,283 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:45,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:45,284 INFO L85 PathProgramCache]: Analyzing trace with hash -903958704, now seen corresponding path program 1 times [2025-02-05 11:44:45,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:45,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915212318] [2025-02-05 11:44:45,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:45,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:45,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 11:44:45,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 11:44:45,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:45,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:45,443 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:44:45,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:45,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915212318] [2025-02-05 11:44:45,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915212318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:45,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:45,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:44:45,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885941905] [2025-02-05 11:44:45,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:45,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:45,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:45,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:45,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:45,447 INFO L87 Difference]: Start difference. First operand 7456 states and 9982 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 11:44:48,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:48,890 INFO L93 Difference]: Finished difference Result 20416 states and 27818 transitions. [2025-02-05 11:44:48,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:48,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 125 [2025-02-05 11:44:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:48,924 INFO L225 Difference]: With dead ends: 20416 [2025-02-05 11:44:48,924 INFO L226 Difference]: Without dead ends: 13749 [2025-02-05 11:44:48,932 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 11:44:48,933 INFO L435 NwaCegarLoop]: 1867 mSDtfsCounter, 920 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 807 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 3292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 807 IncrementalHoareTripleChecker+Valid, 2485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:48,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 2007 Invalid, 3292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [807 Valid, 2485 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 11:44:48,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13749 states. [2025-02-05 11:44:49,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13749 to 13744. [2025-02-05 11:44:49,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13744 states, 13743 states have (on average 1.2587499090446046) internal successors, (17299), 13743 states have internal predecessors, (17299), 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 11:44:49,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13744 states to 13744 states and 17299 transitions. [2025-02-05 11:44:49,239 INFO L78 Accepts]: Start accepts. Automaton has 13744 states and 17299 transitions. Word has length 125 [2025-02-05 11:44:49,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:49,240 INFO L471 AbstractCegarLoop]: Abstraction has 13744 states and 17299 transitions. [2025-02-05 11:44:49,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 11:44:49,241 INFO L276 IsEmpty]: Start isEmpty. Operand 13744 states and 17299 transitions. [2025-02-05 11:44:49,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 11:44:49,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:49,247 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:44:49,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:44:49,247 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:49,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:49,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1849708061, now seen corresponding path program 1 times [2025-02-05 11:44:49,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:49,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076464171] [2025-02-05 11:44:49,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:49,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:49,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 11:44:49,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 11:44:49,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:49,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:49,410 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 11:44:49,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:49,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076464171] [2025-02-05 11:44:49,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076464171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:49,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:49,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:44:49,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353842317] [2025-02-05 11:44:49,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:49,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:49,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:49,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:49,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:49,415 INFO L87 Difference]: Start difference. First operand 13744 states and 17299 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 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 11:44:52,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:52,478 INFO L93 Difference]: Finished difference Result 36950 states and 47247 transitions. [2025-02-05 11:44:52,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:52,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 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 154 [2025-02-05 11:44:52,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:52,526 INFO L225 Difference]: With dead ends: 36950 [2025-02-05 11:44:52,526 INFO L226 Difference]: Without dead ends: 23995 [2025-02-05 11:44:52,537 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 11:44:52,538 INFO L435 NwaCegarLoop]: 1026 mSDtfsCounter, 796 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 2496 mSolverCounterSat, 780 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 3276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 780 IncrementalHoareTripleChecker+Valid, 2496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:52,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 1172 Invalid, 3276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [780 Valid, 2496 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 11:44:52,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23995 states. [2025-02-05 11:44:52,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23995 to 23191. [2025-02-05 11:44:52,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23191 states, 23190 states have (on average 1.1879689521345407) internal successors, (27549), 23190 states have internal predecessors, (27549), 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 11:44:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23191 states to 23191 states and 27549 transitions. [2025-02-05 11:44:52,799 INFO L78 Accepts]: Start accepts. Automaton has 23191 states and 27549 transitions. Word has length 154 [2025-02-05 11:44:52,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:52,800 INFO L471 AbstractCegarLoop]: Abstraction has 23191 states and 27549 transitions. [2025-02-05 11:44:52,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 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 11:44:52,800 INFO L276 IsEmpty]: Start isEmpty. Operand 23191 states and 27549 transitions. [2025-02-05 11:44:52,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-05 11:44:52,802 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:52,803 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:44:52,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:44:52,803 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:52,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:52,804 INFO L85 PathProgramCache]: Analyzing trace with hash 284184951, now seen corresponding path program 1 times [2025-02-05 11:44:52,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:52,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652431066] [2025-02-05 11:44:52,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:52,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:52,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-05 11:44:52,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-05 11:44:52,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:52,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:53,230 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 11:44:53,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:53,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652431066] [2025-02-05 11:44:53,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652431066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:53,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:53,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:44:53,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295374364] [2025-02-05 11:44:53,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:53,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:53,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:53,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:53,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:53,232 INFO L87 Difference]: Start difference. First operand 23191 states and 27549 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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 11:44:56,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:56,116 INFO L93 Difference]: Finished difference Result 45593 states and 54299 transitions. [2025-02-05 11:44:56,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:56,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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 219 [2025-02-05 11:44:56,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:56,169 INFO L225 Difference]: With dead ends: 45593 [2025-02-05 11:44:56,169 INFO L226 Difference]: Without dead ends: 23191 [2025-02-05 11:44:56,190 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 11:44:56,191 INFO L435 NwaCegarLoop]: 1067 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2504 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 2508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:56,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1196 Invalid, 2508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2504 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:44:56,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23191 states. [2025-02-05 11:44:56,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23191 to 23191. [2025-02-05 11:44:56,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23191 states, 23190 states have (on average 1.1877533419577404) internal successors, (27544), 23190 states have internal predecessors, (27544), 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 11:44:56,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23191 states to 23191 states and 27544 transitions. [2025-02-05 11:44:56,469 INFO L78 Accepts]: Start accepts. Automaton has 23191 states and 27544 transitions. Word has length 219 [2025-02-05 11:44:56,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:56,469 INFO L471 AbstractCegarLoop]: Abstraction has 23191 states and 27544 transitions. [2025-02-05 11:44:56,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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 11:44:56,470 INFO L276 IsEmpty]: Start isEmpty. Operand 23191 states and 27544 transitions. [2025-02-05 11:44:56,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-02-05 11:44:56,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:56,477 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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 11:44:56,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:44:56,477 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:56,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:56,478 INFO L85 PathProgramCache]: Analyzing trace with hash -466233101, now seen corresponding path program 1 times [2025-02-05 11:44:56,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:56,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141165129] [2025-02-05 11:44:56,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:56,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:56,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-02-05 11:44:56,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-02-05 11:44:56,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:56,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:56,804 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:44:56,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:56,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141165129] [2025-02-05 11:44:56,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141165129] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:56,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:56,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:44:56,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721787671] [2025-02-05 11:44:56,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:56,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:56,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:56,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:56,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:56,806 INFO L87 Difference]: Start difference. First operand 23191 states and 27544 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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 11:45:00,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:00,099 INFO L93 Difference]: Finished difference Result 56636 states and 68611 transitions. [2025-02-05 11:45:00,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:00,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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 226 [2025-02-05 11:45:00,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:00,155 INFO L225 Difference]: With dead ends: 56636 [2025-02-05 11:45:00,156 INFO L226 Difference]: Without dead ends: 32656 [2025-02-05 11:45:00,174 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 11:45:00,175 INFO L435 NwaCegarLoop]: 1756 mSDtfsCounter, 767 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 2541 mSolverCounterSat, 713 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 3254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 713 IncrementalHoareTripleChecker+Valid, 2541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:00,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1897 Invalid, 3254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [713 Valid, 2541 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 11:45:00,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32656 states. [2025-02-05 11:45:00,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32656 to 31844. [2025-02-05 11:45:00,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31844 states, 31843 states have (on average 1.1618252049115976) internal successors, (36996), 31843 states have internal predecessors, (36996), 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 11:45:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31844 states to 31844 states and 36996 transitions. [2025-02-05 11:45:00,526 INFO L78 Accepts]: Start accepts. Automaton has 31844 states and 36996 transitions. Word has length 226 [2025-02-05 11:45:00,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:00,527 INFO L471 AbstractCegarLoop]: Abstraction has 31844 states and 36996 transitions. [2025-02-05 11:45:00,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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 11:45:00,528 INFO L276 IsEmpty]: Start isEmpty. Operand 31844 states and 36996 transitions. [2025-02-05 11:45:00,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-02-05 11:45:00,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:00,539 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:00,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:45:00,539 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:00,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:00,541 INFO L85 PathProgramCache]: Analyzing trace with hash -557682645, now seen corresponding path program 1 times [2025-02-05 11:45:00,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:00,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191890557] [2025-02-05 11:45:00,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:00,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:00,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-05 11:45:00,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-05 11:45:00,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:00,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-05 11:45:00,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:00,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191890557] [2025-02-05 11:45:00,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191890557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:00,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:00,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:00,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796984456] [2025-02-05 11:45:00,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:00,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:00,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:00,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:00,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:00,749 INFO L87 Difference]: Start difference. First operand 31844 states and 36996 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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 11:45:04,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:04,108 INFO L93 Difference]: Finished difference Result 74712 states and 88427 transitions. [2025-02-05 11:45:04,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:04,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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 305 [2025-02-05 11:45:04,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:04,169 INFO L225 Difference]: With dead ends: 74712 [2025-02-05 11:45:04,169 INFO L226 Difference]: Without dead ends: 43657 [2025-02-05 11:45:04,198 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 11:45:04,199 INFO L435 NwaCegarLoop]: 1803 mSDtfsCounter, 850 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 2542 mSolverCounterSat, 721 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 3263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 721 IncrementalHoareTripleChecker+Valid, 2542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:04,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 1947 Invalid, 3263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [721 Valid, 2542 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 11:45:04,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43657 states. [2025-02-05 11:45:04,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43657 to 42866. [2025-02-05 11:45:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42866 states, 42865 states have (on average 1.1408375131225943) internal successors, (48902), 42865 states have internal predecessors, (48902), 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 11:45:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42866 states to 42866 states and 48902 transitions. [2025-02-05 11:45:04,807 INFO L78 Accepts]: Start accepts. Automaton has 42866 states and 48902 transitions. Word has length 305 [2025-02-05 11:45:04,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:04,807 INFO L471 AbstractCegarLoop]: Abstraction has 42866 states and 48902 transitions. [2025-02-05 11:45:04,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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 11:45:04,808 INFO L276 IsEmpty]: Start isEmpty. Operand 42866 states and 48902 transitions. [2025-02-05 11:45:04,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-02-05 11:45:04,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:04,813 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:45:04,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:45:04,813 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:04,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:04,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1415349609, now seen corresponding path program 1 times [2025-02-05 11:45:04,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:04,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714679984] [2025-02-05 11:45:04,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:04,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:04,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-02-05 11:45:04,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-02-05 11:45:04,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:04,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:06,594 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 152 proven. 113 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 11:45:06,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:06,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714679984] [2025-02-05 11:45:06,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714679984] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:45:06,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054727226] [2025-02-05 11:45:06,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:06,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:45:06,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:45:06,600 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:45:06,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 11:45:06,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-02-05 11:45:06,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-02-05 11:45:06,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:06,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:06,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:45:06,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:45:06,901 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-02-05 11:45:06,901 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:45:06,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054727226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:06,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:45:06,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-02-05 11:45:06,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854458499] [2025-02-05 11:45:06,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:06,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:06,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:06,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:06,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:45:06,904 INFO L87 Difference]: Start difference. First operand 42866 states and 48902 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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 11:45:09,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:09,841 INFO L93 Difference]: Finished difference Result 84934 states and 97002 transitions. [2025-02-05 11:45:09,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:09,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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 320 [2025-02-05 11:45:09,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:09,893 INFO L225 Difference]: With dead ends: 84934 [2025-02-05 11:45:09,893 INFO L226 Difference]: Without dead ends: 42857 [2025-02-05 11:45:09,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:45:09,925 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 1076 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 2915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:09,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 803 Invalid, 2915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 2389 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:45:09,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42857 states. [2025-02-05 11:45:10,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42857 to 42856. [2025-02-05 11:45:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42856 states, 42855 states have (on average 1.1046318982615797) internal successors, (47339), 42855 states have internal predecessors, (47339), 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 11:45:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42856 states to 42856 states and 47339 transitions. [2025-02-05 11:45:10,487 INFO L78 Accepts]: Start accepts. Automaton has 42856 states and 47339 transitions. Word has length 320 [2025-02-05 11:45:10,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:10,487 INFO L471 AbstractCegarLoop]: Abstraction has 42856 states and 47339 transitions. [2025-02-05 11:45:10,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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 11:45:10,487 INFO L276 IsEmpty]: Start isEmpty. Operand 42856 states and 47339 transitions. [2025-02-05 11:45:10,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-02-05 11:45:10,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:10,492 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:10,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 11:45:10,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 11:45:10,693 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:10,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:10,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1015902777, now seen corresponding path program 1 times [2025-02-05 11:45:10,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:10,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749698150] [2025-02-05 11:45:10,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:10,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:10,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-02-05 11:45:10,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-02-05 11:45:10,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:10,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:11,301 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-02-05 11:45:11,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:11,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749698150] [2025-02-05 11:45:11,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749698150] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:11,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:11,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:11,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433434641] [2025-02-05 11:45:11,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:11,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:11,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:11,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:11,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:11,304 INFO L87 Difference]: Start difference. First operand 42856 states and 47339 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 11:45:14,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:14,794 INFO L93 Difference]: Finished difference Result 84921 states and 93883 transitions. [2025-02-05 11:45:14,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:14,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 339 [2025-02-05 11:45:14,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:14,845 INFO L225 Difference]: With dead ends: 84921 [2025-02-05 11:45:14,845 INFO L226 Difference]: Without dead ends: 42854 [2025-02-05 11:45:14,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 11:45:14,875 INFO L435 NwaCegarLoop]: 1342 mSDtfsCounter, 1188 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:14,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 1420 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-05 11:45:15,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42854 states. [2025-02-05 11:45:15,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42854 to 42853. [2025-02-05 11:45:15,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42853 states, 42852 states have (on average 1.0796695603472417) internal successors, (46266), 42852 states have internal predecessors, (46266), 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 11:45:15,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42853 states to 42853 states and 46266 transitions. [2025-02-05 11:45:15,348 INFO L78 Accepts]: Start accepts. Automaton has 42853 states and 46266 transitions. Word has length 339 [2025-02-05 11:45:15,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:15,349 INFO L471 AbstractCegarLoop]: Abstraction has 42853 states and 46266 transitions. [2025-02-05 11:45:15,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 11:45:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 42853 states and 46266 transitions. [2025-02-05 11:45:15,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-02-05 11:45:15,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:15,355 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:15,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:45:15,355 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:15,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:15,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1536138279, now seen corresponding path program 1 times [2025-02-05 11:45:15,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:15,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765102023] [2025-02-05 11:45:15,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:15,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:15,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-02-05 11:45:15,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-02-05 11:45:15,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:15,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-02-05 11:45:15,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:15,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765102023] [2025-02-05 11:45:15,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765102023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:15,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:15,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:15,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122981649] [2025-02-05 11:45:15,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:15,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:45:15,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:15,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:45:15,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:45:15,597 INFO L87 Difference]: Start difference. First operand 42853 states and 46266 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 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 11:45:21,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:21,441 INFO L93 Difference]: Finished difference Result 147301 states and 159289 transitions. [2025-02-05 11:45:21,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:45:21,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 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 362 [2025-02-05 11:45:21,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:21,552 INFO L225 Difference]: With dead ends: 147301 [2025-02-05 11:45:21,552 INFO L226 Difference]: Without dead ends: 105237 [2025-02-05 11:45:21,588 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 11:45:21,589 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 1702 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 6593 mSolverCounterSat, 1030 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 7623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1030 IncrementalHoareTripleChecker+Valid, 6593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:21,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1702 Valid, 788 Invalid, 7623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1030 Valid, 6593 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-02-05 11:45:21,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105237 states. [2025-02-05 11:45:22,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105237 to 102743. [2025-02-05 11:45:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102743 states, 102742 states have (on average 1.0723559985205662) internal successors, (110176), 102742 states have internal predecessors, (110176), 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 11:45:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102743 states to 102743 states and 110176 transitions. [2025-02-05 11:45:22,616 INFO L78 Accepts]: Start accepts. Automaton has 102743 states and 110176 transitions. Word has length 362 [2025-02-05 11:45:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:22,617 INFO L471 AbstractCegarLoop]: Abstraction has 102743 states and 110176 transitions. [2025-02-05 11:45:22,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 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 11:45:22,617 INFO L276 IsEmpty]: Start isEmpty. Operand 102743 states and 110176 transitions. [2025-02-05 11:45:22,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-02-05 11:45:22,624 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:22,624 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:22,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:45:22,624 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:22,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:22,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1155628812, now seen corresponding path program 1 times [2025-02-05 11:45:22,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:22,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341051651] [2025-02-05 11:45:22,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:22,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:22,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-02-05 11:45:22,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-02-05 11:45:22,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:22,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:24,057 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 321 proven. 113 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-02-05 11:45:24,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:24,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341051651] [2025-02-05 11:45:24,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341051651] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:45:24,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804577206] [2025-02-05 11:45:24,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:24,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:45:24,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:45:24,060 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:45:24,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 11:45:24,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-02-05 11:45:24,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-02-05 11:45:24,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:24,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:24,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:45:24,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:45:25,009 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-02-05 11:45:25,010 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:45:25,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804577206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:25,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:45:25,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2025-02-05 11:45:25,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029386555] [2025-02-05 11:45:25,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:25,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:25,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:25,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:25,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:45:25,012 INFO L87 Difference]: Start difference. First operand 102743 states and 110176 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 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 11:45:28,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:28,206 INFO L93 Difference]: Finished difference Result 197618 states and 212237 transitions. [2025-02-05 11:45:28,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:28,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 405 [2025-02-05 11:45:28,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:28,342 INFO L225 Difference]: With dead ends: 197618 [2025-02-05 11:45:28,342 INFO L226 Difference]: Without dead ends: 106689 [2025-02-05 11:45:28,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:45:28,405 INFO L435 NwaCegarLoop]: 1026 mSDtfsCounter, 683 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2456 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:28,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 1160 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2456 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:45:28,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106689 states. [2025-02-05 11:45:29,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106689 to 105105. [2025-02-05 11:45:29,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105105 states, 105104 states have (on average 1.0656016897549094) internal successors, (111999), 105104 states have internal predecessors, (111999), 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 11:45:29,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105105 states to 105105 states and 111999 transitions. [2025-02-05 11:45:29,796 INFO L78 Accepts]: Start accepts. Automaton has 105105 states and 111999 transitions. Word has length 405 [2025-02-05 11:45:29,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:29,796 INFO L471 AbstractCegarLoop]: Abstraction has 105105 states and 111999 transitions. [2025-02-05 11:45:29,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 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 11:45:29,796 INFO L276 IsEmpty]: Start isEmpty. Operand 105105 states and 111999 transitions. [2025-02-05 11:45:29,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-02-05 11:45:29,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:29,807 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:29,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 11:45:30,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:45:30,007 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:30,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:30,008 INFO L85 PathProgramCache]: Analyzing trace with hash 543745944, now seen corresponding path program 1 times [2025-02-05 11:45:30,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:30,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480613667] [2025-02-05 11:45:30,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:30,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:30,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-02-05 11:45:30,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-02-05 11:45:30,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:30,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:30,261 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 664 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-02-05 11:45:30,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:30,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480613667] [2025-02-05 11:45:30,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480613667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:30,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:30,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:30,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313610606] [2025-02-05 11:45:30,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:30,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:30,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:30,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:30,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:30,264 INFO L87 Difference]: Start difference. First operand 105105 states and 111999 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 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 11:45:33,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:33,414 INFO L93 Difference]: Finished difference Result 208632 states and 222344 transitions. [2025-02-05 11:45:33,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:33,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 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 451 [2025-02-05 11:45:33,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:33,553 INFO L225 Difference]: With dead ends: 208632 [2025-02-05 11:45:33,553 INFO L226 Difference]: Without dead ends: 104316 [2025-02-05 11:45:33,624 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 11:45:33,624 INFO L435 NwaCegarLoop]: 1346 mSDtfsCounter, 938 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 2975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:33,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 1429 Invalid, 2975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:45:33,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104316 states.