./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-back-serstep.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-back-serstep.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash cf781dc2288a00f369934df75df908cdb6dbb08527402be5afe46a5cc4e19cf1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 18:05:35,512 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 18:05:35,587 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 18:05:35,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 18:05:35,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 18:05:35,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 18:05:35,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 18:05:35,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 18:05:35,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 18:05:35,622 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 18:05:35,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 18:05:35,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 18:05:35,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 18:05:35,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 18:05:35,623 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 18:05:35,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 18:05:35,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 18:05:35,623 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 18:05:35,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 18:05:35,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 18:05:35,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 18:05:35,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 18:05:35,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 18:05:35,624 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 18:05:35,624 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 18:05:35,625 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 18:05:35,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 18:05:35,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 18:05:35,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 18:05:35,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:05:35,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 18:05:35,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 18:05:35,625 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 18:05:35,626 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 18:05:35,626 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 18:05:35,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 18:05:35,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 18:05:35,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 18:05:35,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 18:05:35,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 18:05:35,626 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cf781dc2288a00f369934df75df908cdb6dbb08527402be5afe46a5cc4e19cf1 [2025-02-05 18:05:35,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 18:05:35,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 18:05:35,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 18:05:35,942 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 18:05:35,942 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 18:05:35,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-back-serstep.c [2025-02-05 18:05:37,329 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5aba21da4/26bf6413f42a4822ab47953266f32984/FLAGdd1ddcf42 [2025-02-05 18:05:37,592 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 18:05:37,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-back-serstep.c [2025-02-05 18:05:37,604 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5aba21da4/26bf6413f42a4822ab47953266f32984/FLAGdd1ddcf42 [2025-02-05 18:05:37,617 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5aba21da4/26bf6413f42a4822ab47953266f32984 [2025-02-05 18:05:37,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 18:05:37,621 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 18:05:37,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 18:05:37,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 18:05:37,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 18:05:37,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:05:37" (1/1) ... [2025-02-05 18:05:37,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@248f082d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:37, skipping insertion in model container [2025-02-05 18:05:37,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:05:37" (1/1) ... [2025-02-05 18:05:37,653 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 18:05:37,786 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/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-back-serstep.c[1174,1187] [2025-02-05 18:05:37,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:05:37,965 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 18:05:37,974 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/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-back-serstep.c[1174,1187] [2025-02-05 18:05:38,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:05:38,059 INFO L204 MainTranslator]: Completed translation [2025-02-05 18:05:38,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:38 WrapperNode [2025-02-05 18:05:38,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 18:05:38,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 18:05:38,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 18:05:38,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 18:05:38,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:38" (1/1) ... [2025-02-05 18:05:38,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:38" (1/1) ... [2025-02-05 18:05:38,344 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1948 [2025-02-05 18:05:38,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 18:05:38,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 18:05:38,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 18:05:38,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 18:05:38,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:38" (1/1) ... [2025-02-05 18:05:38,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:38" (1/1) ... [2025-02-05 18:05:38,390 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:38" (1/1) ... [2025-02-05 18:05:38,446 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 18:05:38,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:38" (1/1) ... [2025-02-05 18:05:38,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:38" (1/1) ... [2025-02-05 18:05:38,492 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:38" (1/1) ... [2025-02-05 18:05:38,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:38" (1/1) ... [2025-02-05 18:05:38,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:38" (1/1) ... [2025-02-05 18:05:38,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:38" (1/1) ... [2025-02-05 18:05:38,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 18:05:38,555 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 18:05:38,555 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 18:05:38,555 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 18:05:38,556 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:38" (1/1) ... [2025-02-05 18:05:38,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:05:38,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:05:38,588 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 18:05:38,591 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 18:05:38,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 18:05:38,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 18:05:38,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 18:05:38,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 18:05:38,794 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 18:05:38,795 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 18:05:41,329 INFO L? ?]: Removed 993 outVars from TransFormulas that were not future-live. [2025-02-05 18:05:41,329 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 18:05:41,446 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 18:05:41,446 INFO L337 CfgBuilder]: Removed 4 assume(true) statements. [2025-02-05 18:05:41,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:05:41 BoogieIcfgContainer [2025-02-05 18:05:41,446 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 18:05:41,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 18:05:41,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 18:05:41,456 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 18:05:41,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 06:05:37" (1/3) ... [2025-02-05 18:05:41,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70856647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:05:41, skipping insertion in model container [2025-02-05 18:05:41,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:05:38" (2/3) ... [2025-02-05 18:05:41,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70856647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:05:41, skipping insertion in model container [2025-02-05 18:05:41,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:05:41" (3/3) ... [2025-02-05 18:05:41,458 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.2.prop1-back-serstep.c [2025-02-05 18:05:41,472 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 18:05:41,473 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.adding.2.prop1-back-serstep.c that has 1 procedures, 686 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 18:05:41,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 18:05:41,582 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;@74ce21ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 18:05:41,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 18:05:41,590 INFO L276 IsEmpty]: Start isEmpty. Operand has 686 states, 684 states have (on average 1.5014619883040936) internal successors, (1027), 685 states have internal predecessors, (1027), 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 18:05:41,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 18:05:41,599 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:41,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:41,601 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:41,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:41,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1723089930, now seen corresponding path program 1 times [2025-02-05 18:05:41,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:41,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129194855] [2025-02-05 18:05:41,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:41,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:41,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 18:05:41,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 18:05:41,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:41,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:42,494 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 18:05:42,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:42,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129194855] [2025-02-05 18:05:42,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129194855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:42,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:42,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:42,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535298378] [2025-02-05 18:05:42,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:42,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:42,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:42,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:42,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:42,525 INFO L87 Difference]: Start difference. First operand has 686 states, 684 states have (on average 1.5014619883040936) internal successors, (1027), 685 states have internal predecessors, (1027), 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 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 18:05:43,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:43,070 INFO L93 Difference]: Finished difference Result 1325 states and 1987 transitions. [2025-02-05 18:05:43,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:43,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 85 [2025-02-05 18:05:43,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:43,084 INFO L225 Difference]: With dead ends: 1325 [2025-02-05 18:05:43,084 INFO L226 Difference]: Without dead ends: 685 [2025-02-05 18:05:43,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:43,096 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 1697 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2548 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:43,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2548 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:05:43,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-02-05 18:05:43,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2025-02-05 18:05:43,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 684 states have (on average 1.4985380116959064) internal successors, (1025), 684 states have internal predecessors, (1025), 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 18:05:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1025 transitions. [2025-02-05 18:05:43,195 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1025 transitions. Word has length 85 [2025-02-05 18:05:43,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:43,196 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1025 transitions. [2025-02-05 18:05:43,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 18:05:43,196 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1025 transitions. [2025-02-05 18:05:43,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 18:05:43,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:43,202 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:43,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 18:05:43,203 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:43,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:43,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1880860329, now seen corresponding path program 1 times [2025-02-05 18:05:43,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:43,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952600662] [2025-02-05 18:05:43,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:43,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:43,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 18:05:43,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 18:05:43,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:43,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:43,518 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 18:05:43,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:43,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952600662] [2025-02-05 18:05:43,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952600662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:43,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:43,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:43,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995842855] [2025-02-05 18:05:43,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:43,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:43,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:43,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:43,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:43,524 INFO L87 Difference]: Start difference. First operand 685 states and 1025 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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 18:05:43,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:43,943 INFO L93 Difference]: Finished difference Result 1326 states and 1985 transitions. [2025-02-05 18:05:43,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:43,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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 86 [2025-02-05 18:05:43,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:43,948 INFO L225 Difference]: With dead ends: 1326 [2025-02-05 18:05:43,951 INFO L226 Difference]: Without dead ends: 687 [2025-02-05 18:05:43,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:43,954 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:43,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2545 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:05:43,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-02-05 18:05:43,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2025-02-05 18:05:43,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 686 states have (on average 1.4970845481049562) internal successors, (1027), 686 states have internal predecessors, (1027), 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 18:05:43,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1027 transitions. [2025-02-05 18:05:43,973 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1027 transitions. Word has length 86 [2025-02-05 18:05:43,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:43,974 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 1027 transitions. [2025-02-05 18:05:43,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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 18:05:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1027 transitions. [2025-02-05 18:05:43,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 18:05:43,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:43,976 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:43,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 18:05:43,976 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:43,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:43,977 INFO L85 PathProgramCache]: Analyzing trace with hash 108638181, now seen corresponding path program 1 times [2025-02-05 18:05:43,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:43,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211897327] [2025-02-05 18:05:43,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:43,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:44,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 18:05:44,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 18:05:44,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:44,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:44,277 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 18:05:44,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:44,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211897327] [2025-02-05 18:05:44,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211897327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:44,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:44,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:44,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161403943] [2025-02-05 18:05:44,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:44,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:44,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:44,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:44,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:44,280 INFO L87 Difference]: Start difference. First operand 687 states and 1027 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 18:05:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:44,640 INFO L93 Difference]: Finished difference Result 1330 states and 1989 transitions. [2025-02-05 18:05:44,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:44,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 87 [2025-02-05 18:05:44,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:44,647 INFO L225 Difference]: With dead ends: 1330 [2025-02-05 18:05:44,648 INFO L226 Difference]: Without dead ends: 689 [2025-02-05 18:05:44,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:44,650 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:44,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2545 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:44,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-02-05 18:05:44,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2025-02-05 18:05:44,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 688 states have (on average 1.495639534883721) internal successors, (1029), 688 states have internal predecessors, (1029), 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 18:05:44,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1029 transitions. [2025-02-05 18:05:44,675 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1029 transitions. Word has length 87 [2025-02-05 18:05:44,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:44,676 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1029 transitions. [2025-02-05 18:05:44,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 18:05:44,676 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1029 transitions. [2025-02-05 18:05:44,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 18:05:44,681 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:44,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:44,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 18:05:44,681 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:44,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:44,682 INFO L85 PathProgramCache]: Analyzing trace with hash 961179726, now seen corresponding path program 1 times [2025-02-05 18:05:44,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:44,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230817250] [2025-02-05 18:05:44,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:44,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:44,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 18:05:44,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 18:05:44,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:44,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:44,992 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 18:05:44,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:44,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230817250] [2025-02-05 18:05:44,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230817250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:44,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:44,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 18:05:44,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73560456] [2025-02-05 18:05:44,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:44,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:05:44,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:44,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:05:44,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:05:44,997 INFO L87 Difference]: Start difference. First operand 689 states and 1029 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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 18:05:45,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:45,685 INFO L93 Difference]: Finished difference Result 1961 states and 2932 transitions. [2025-02-05 18:05:45,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:05:45,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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 88 [2025-02-05 18:05:45,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:45,692 INFO L225 Difference]: With dead ends: 1961 [2025-02-05 18:05:45,692 INFO L226 Difference]: Without dead ends: 1318 [2025-02-05 18:05:45,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:05:45,694 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 927 mSDsluCounter, 3330 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 4179 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:45,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 4179 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 18:05:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2025-02-05 18:05:45,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 797. [2025-02-05 18:05:45,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 796 states have (on average 1.4962311557788945) internal successors, (1191), 796 states have internal predecessors, (1191), 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 18:05:45,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1191 transitions. [2025-02-05 18:05:45,740 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1191 transitions. Word has length 88 [2025-02-05 18:05:45,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:45,740 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1191 transitions. [2025-02-05 18:05:45,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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 18:05:45,741 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1191 transitions. [2025-02-05 18:05:45,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-02-05 18:05:45,750 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:45,751 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:05:45,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 18:05:45,751 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:45,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:45,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1710675479, now seen corresponding path program 1 times [2025-02-05 18:05:45,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:45,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436243071] [2025-02-05 18:05:45,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:45,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:45,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-02-05 18:05:46,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-02-05 18:05:46,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:46,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:05:46,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:46,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436243071] [2025-02-05 18:05:46,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436243071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:46,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:46,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 18:05:46,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958803815] [2025-02-05 18:05:46,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:46,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 18:05:46,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:46,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 18:05:46,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 18:05:46,767 INFO L87 Difference]: Start difference. First operand 797 states and 1191 transitions. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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 18:05:47,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:47,058 INFO L93 Difference]: Finished difference Result 1441 states and 2154 transitions. [2025-02-05 18:05:47,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 18:05:47,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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 393 [2025-02-05 18:05:47,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:47,065 INFO L225 Difference]: With dead ends: 1441 [2025-02-05 18:05:47,066 INFO L226 Difference]: Without dead ends: 798 [2025-02-05 18:05:47,067 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 18:05:47,068 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 0 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:47,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1699 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:47,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-02-05 18:05:47,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 798. [2025-02-05 18:05:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 797 states have (on average 1.4956085319949812) internal successors, (1192), 797 states have internal predecessors, (1192), 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 18:05:47,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1192 transitions. [2025-02-05 18:05:47,092 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1192 transitions. Word has length 393 [2025-02-05 18:05:47,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:47,092 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1192 transitions. [2025-02-05 18:05:47,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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 18:05:47,093 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1192 transitions. [2025-02-05 18:05:47,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-02-05 18:05:47,098 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:47,099 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:05:47,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 18:05:47,099 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:47,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:47,100 INFO L85 PathProgramCache]: Analyzing trace with hash 12830968, now seen corresponding path program 1 times [2025-02-05 18:05:47,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:47,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573297363] [2025-02-05 18:05:47,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:47,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:47,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-02-05 18:05:47,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-02-05 18:05:47,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:47,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:47,837 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:05:47,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:47,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573297363] [2025-02-05 18:05:47,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573297363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:47,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:47,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 18:05:47,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659829108] [2025-02-05 18:05:47,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:47,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 18:05:47,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:47,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 18:05:47,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 18:05:47,840 INFO L87 Difference]: Start difference. First operand 798 states and 1192 transitions. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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 18:05:48,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:48,131 INFO L93 Difference]: Finished difference Result 1443 states and 2156 transitions. [2025-02-05 18:05:48,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 18:05:48,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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 393 [2025-02-05 18:05:48,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:48,135 INFO L225 Difference]: With dead ends: 1443 [2025-02-05 18:05:48,135 INFO L226 Difference]: Without dead ends: 799 [2025-02-05 18:05:48,137 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 18:05:48,139 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 0 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:48,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1699 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:48,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-02-05 18:05:48,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2025-02-05 18:05:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 1.494987468671679) internal successors, (1193), 798 states have internal predecessors, (1193), 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 18:05:48,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1193 transitions. [2025-02-05 18:05:48,163 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1193 transitions. Word has length 393 [2025-02-05 18:05:48,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:48,164 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1193 transitions. [2025-02-05 18:05:48,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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 18:05:48,165 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1193 transitions. [2025-02-05 18:05:48,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-02-05 18:05:48,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:48,172 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:05:48,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 18:05:48,173 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:48,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:48,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1470923623, now seen corresponding path program 1 times [2025-02-05 18:05:48,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:48,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077002181] [2025-02-05 18:05:48,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:48,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:48,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-02-05 18:05:48,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-02-05 18:05:48,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:48,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:48,859 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:05:48,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:48,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077002181] [2025-02-05 18:05:48,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077002181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:48,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:48,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 18:05:48,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528967052] [2025-02-05 18:05:48,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:48,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 18:05:48,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:48,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 18:05:48,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 18:05:48,863 INFO L87 Difference]: Start difference. First operand 799 states and 1193 transitions. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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 18:05:49,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:49,122 INFO L93 Difference]: Finished difference Result 1445 states and 2158 transitions. [2025-02-05 18:05:49,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 18:05:49,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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 393 [2025-02-05 18:05:49,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:49,127 INFO L225 Difference]: With dead ends: 1445 [2025-02-05 18:05:49,127 INFO L226 Difference]: Without dead ends: 800 [2025-02-05 18:05:49,128 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 18:05:49,129 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 0 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:49,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1699 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:05:49,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-02-05 18:05:49,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2025-02-05 18:05:49,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 1.4943679599499373) internal successors, (1194), 799 states have internal predecessors, (1194), 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 18:05:49,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1194 transitions. [2025-02-05 18:05:49,148 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1194 transitions. Word has length 393 [2025-02-05 18:05:49,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:49,149 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1194 transitions. [2025-02-05 18:05:49,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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 18:05:49,149 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1194 transitions. [2025-02-05 18:05:49,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-02-05 18:05:49,154 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:49,154 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 18:05:49,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 18:05:49,155 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:49,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:49,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2098614790, now seen corresponding path program 1 times [2025-02-05 18:05:49,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:49,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147823150] [2025-02-05 18:05:49,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:49,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:49,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-02-05 18:05:49,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-02-05 18:05:49,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:49,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:50,014 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 18:05:50,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:50,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147823150] [2025-02-05 18:05:50,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147823150] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:50,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:50,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:50,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548991402] [2025-02-05 18:05:50,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:50,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:50,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:50,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:50,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:50,017 INFO L87 Difference]: Start difference. First operand 800 states and 1194 transitions. Second operand has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 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 18:05:50,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:50,331 INFO L93 Difference]: Finished difference Result 1452 states and 2167 transitions. [2025-02-05 18:05:50,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:50,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 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 393 [2025-02-05 18:05:50,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:50,335 INFO L225 Difference]: With dead ends: 1452 [2025-02-05 18:05:50,336 INFO L226 Difference]: Without dead ends: 804 [2025-02-05 18:05:50,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:50,337 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:50,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2545 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-02-05 18:05:50,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 802. [2025-02-05 18:05:50,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 801 states have (on average 1.4931335830212236) internal successors, (1196), 801 states have internal predecessors, (1196), 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 18:05:50,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1196 transitions. [2025-02-05 18:05:50,356 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1196 transitions. Word has length 393 [2025-02-05 18:05:50,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:50,357 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 1196 transitions. [2025-02-05 18:05:50,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 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 18:05:50,358 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1196 transitions. [2025-02-05 18:05:50,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-02-05 18:05:50,363 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:50,363 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:50,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 18:05:50,363 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:50,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:50,364 INFO L85 PathProgramCache]: Analyzing trace with hash 67249300, now seen corresponding path program 1 times [2025-02-05 18:05:50,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:50,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297896501] [2025-02-05 18:05:50,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:50,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:50,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-02-05 18:05:50,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-02-05 18:05:50,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:50,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:51,228 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-05 18:05:51,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:51,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297896501] [2025-02-05 18:05:51,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297896501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:51,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:51,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:05:51,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244130964] [2025-02-05 18:05:51,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:51,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:05:51,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:51,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:05:51,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:05:51,231 INFO L87 Difference]: Start difference. First operand 802 states and 1196 transitions. Second operand has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:05:51,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:51,592 INFO L93 Difference]: Finished difference Result 1460 states and 2177 transitions. [2025-02-05 18:05:51,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:51,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 394 [2025-02-05 18:05:51,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:51,597 INFO L225 Difference]: With dead ends: 1460 [2025-02-05 18:05:51,597 INFO L226 Difference]: Without dead ends: 806 [2025-02-05 18:05:51,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:05:51,599 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:51,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2545 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:51,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-02-05 18:05:51,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 804. [2025-02-05 18:05:51,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 803 states have (on average 1.4919053549190535) internal successors, (1198), 803 states have internal predecessors, (1198), 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 18:05:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1198 transitions. [2025-02-05 18:05:51,620 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1198 transitions. Word has length 394 [2025-02-05 18:05:51,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:51,621 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1198 transitions. [2025-02-05 18:05:51,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:05:51,621 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1198 transitions. [2025-02-05 18:05:51,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2025-02-05 18:05:51,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:51,628 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:51,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 18:05:51,629 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:51,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:51,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1953182623, now seen corresponding path program 1 times [2025-02-05 18:05:51,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:51,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967785649] [2025-02-05 18:05:51,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:51,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:51,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes. [2025-02-05 18:05:51,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements. [2025-02-05 18:05:51,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:51,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-05 18:05:52,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:52,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967785649] [2025-02-05 18:05:52,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967785649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:52,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:52,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:05:52,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136049095] [2025-02-05 18:05:52,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:52,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:05:52,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:52,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:05:52,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:05:52,381 INFO L87 Difference]: Start difference. First operand 804 states and 1198 transitions. Second operand has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 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 18:05:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:52,812 INFO L93 Difference]: Finished difference Result 1468 states and 2187 transitions. [2025-02-05 18:05:52,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:52,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 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 395 [2025-02-05 18:05:52,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:52,817 INFO L225 Difference]: With dead ends: 1468 [2025-02-05 18:05:52,817 INFO L226 Difference]: Without dead ends: 808 [2025-02-05 18:05:52,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:05:52,819 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 2540 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3391 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:52,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3391 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:05:52,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-02-05 18:05:52,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 806. [2025-02-05 18:05:52,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 805 states have (on average 1.4906832298136645) internal successors, (1200), 805 states have internal predecessors, (1200), 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 18:05:52,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1200 transitions. [2025-02-05 18:05:52,840 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1200 transitions. Word has length 395 [2025-02-05 18:05:52,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:52,840 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1200 transitions. [2025-02-05 18:05:52,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.6) internal successors, (348), 5 states have internal predecessors, (348), 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 18:05:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1200 transitions. [2025-02-05 18:05:52,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2025-02-05 18:05:52,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:52,847 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:52,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 18:05:52,848 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:52,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:52,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1500906129, now seen corresponding path program 1 times [2025-02-05 18:05:52,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:52,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974401146] [2025-02-05 18:05:52,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:52,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:52,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes. [2025-02-05 18:05:52,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements. [2025-02-05 18:05:52,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:52,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:53,550 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 18:05:53,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:53,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974401146] [2025-02-05 18:05:53,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974401146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:53,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:53,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:53,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239459807] [2025-02-05 18:05:53,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:53,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:53,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:53,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:53,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:53,554 INFO L87 Difference]: Start difference. First operand 806 states and 1200 transitions. Second operand has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:05:53,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:53,851 INFO L93 Difference]: Finished difference Result 1476 states and 2197 transitions. [2025-02-05 18:05:53,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:53,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 396 [2025-02-05 18:05:53,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:53,856 INFO L225 Difference]: With dead ends: 1476 [2025-02-05 18:05:53,856 INFO L226 Difference]: Without dead ends: 810 [2025-02-05 18:05:53,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:53,858 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2540 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:53,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2540 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:53,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2025-02-05 18:05:53,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 808. [2025-02-05 18:05:53,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 807 states have (on average 1.4894671623296158) internal successors, (1202), 807 states have internal predecessors, (1202), 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 18:05:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1202 transitions. [2025-02-05 18:05:53,876 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1202 transitions. Word has length 396 [2025-02-05 18:05:53,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:53,877 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1202 transitions. [2025-02-05 18:05:53,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:05:53,877 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1202 transitions. [2025-02-05 18:05:53,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2025-02-05 18:05:53,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:53,884 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:53,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 18:05:53,884 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:53,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:53,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1564409924, now seen corresponding path program 1 times [2025-02-05 18:05:53,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:53,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020217709] [2025-02-05 18:05:53,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:53,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:53,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 397 statements into 1 equivalence classes. [2025-02-05 18:05:54,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 397 of 397 statements. [2025-02-05 18:05:54,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:54,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:54,411 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-05 18:05:54,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:54,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020217709] [2025-02-05 18:05:54,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020217709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:54,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:54,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:54,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962706917] [2025-02-05 18:05:54,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:54,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:54,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:54,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:54,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:54,414 INFO L87 Difference]: Start difference. First operand 808 states and 1202 transitions. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 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 18:05:54,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:54,689 INFO L93 Difference]: Finished difference Result 1490 states and 2215 transitions. [2025-02-05 18:05:54,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:54,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 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 397 [2025-02-05 18:05:54,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:54,693 INFO L225 Difference]: With dead ends: 1490 [2025-02-05 18:05:54,693 INFO L226 Difference]: Without dead ends: 822 [2025-02-05 18:05:54,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:54,694 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 3 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:54,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2545 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:54,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2025-02-05 18:05:54,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 812. [2025-02-05 18:05:54,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 1.4895191122071516) internal successors, (1208), 811 states have internal predecessors, (1208), 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 18:05:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1208 transitions. [2025-02-05 18:05:54,710 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1208 transitions. Word has length 397 [2025-02-05 18:05:54,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:54,711 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1208 transitions. [2025-02-05 18:05:54,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 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 18:05:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1208 transitions. [2025-02-05 18:05:54,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-02-05 18:05:54,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:54,715 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:54,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 18:05:54,716 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:54,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:54,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1083803466, now seen corresponding path program 1 times [2025-02-05 18:05:54,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:54,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600412481] [2025-02-05 18:05:54,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:54,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:54,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 398 statements into 1 equivalence classes. [2025-02-05 18:05:54,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 398 of 398 statements. [2025-02-05 18:05:54,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:54,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:55,217 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 18:05:55,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:55,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600412481] [2025-02-05 18:05:55,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600412481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:55,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:55,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:55,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883723002] [2025-02-05 18:05:55,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:55,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:55,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:55,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:55,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:55,221 INFO L87 Difference]: Start difference. First operand 812 states and 1208 transitions. Second operand has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 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 18:05:55,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:55,525 INFO L93 Difference]: Finished difference Result 1504 states and 2237 transitions. [2025-02-05 18:05:55,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:55,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 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 398 [2025-02-05 18:05:55,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:55,531 INFO L225 Difference]: With dead ends: 1504 [2025-02-05 18:05:55,531 INFO L226 Difference]: Without dead ends: 824 [2025-02-05 18:05:55,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:55,533 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 4 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:55,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2545 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:55,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2025-02-05 18:05:55,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 818. [2025-02-05 18:05:55,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 817 states have (on average 1.4883720930232558) internal successors, (1216), 817 states have internal predecessors, (1216), 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 18:05:55,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1216 transitions. [2025-02-05 18:05:55,557 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1216 transitions. Word has length 398 [2025-02-05 18:05:55,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:55,558 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1216 transitions. [2025-02-05 18:05:55,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.75) internal successors, (359), 4 states have internal predecessors, (359), 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 18:05:55,558 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1216 transitions. [2025-02-05 18:05:55,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2025-02-05 18:05:55,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:55,567 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:55,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 18:05:55,567 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:55,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:55,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1386037646, now seen corresponding path program 1 times [2025-02-05 18:05:55,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:55,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547907752] [2025-02-05 18:05:55,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:55,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:55,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes. [2025-02-05 18:05:55,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements. [2025-02-05 18:05:55,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:55,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 18:05:56,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:56,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547907752] [2025-02-05 18:05:56,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547907752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:56,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:56,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:56,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810460533] [2025-02-05 18:05:56,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:56,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:56,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:56,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:56,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:56,274 INFO L87 Difference]: Start difference. First operand 818 states and 1216 transitions. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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 18:05:56,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:56,619 INFO L93 Difference]: Finished difference Result 1516 states and 2253 transitions. [2025-02-05 18:05:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:56,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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 399 [2025-02-05 18:05:56,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:56,624 INFO L225 Difference]: With dead ends: 1516 [2025-02-05 18:05:56,624 INFO L226 Difference]: Without dead ends: 822 [2025-02-05 18:05:56,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:56,627 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:56,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2545 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:56,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2025-02-05 18:05:56,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 820. [2025-02-05 18:05:56,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 819 states have (on average 1.4871794871794872) internal successors, (1218), 819 states have internal predecessors, (1218), 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 18:05:56,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1218 transitions. [2025-02-05 18:05:56,648 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1218 transitions. Word has length 399 [2025-02-05 18:05:56,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:56,648 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1218 transitions. [2025-02-05 18:05:56,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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 18:05:56,649 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1218 transitions. [2025-02-05 18:05:56,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2025-02-05 18:05:56,651 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:56,651 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:56,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 18:05:56,651 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:56,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:56,652 INFO L85 PathProgramCache]: Analyzing trace with hash 564564997, now seen corresponding path program 1 times [2025-02-05 18:05:56,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:56,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522468997] [2025-02-05 18:05:56,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:56,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:56,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes. [2025-02-05 18:05:56,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements. [2025-02-05 18:05:56,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:56,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:57,197 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 18:05:57,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:57,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522468997] [2025-02-05 18:05:57,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522468997] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:57,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:57,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:57,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419458890] [2025-02-05 18:05:57,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:57,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:57,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:57,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:57,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:57,200 INFO L87 Difference]: Start difference. First operand 820 states and 1218 transitions. Second operand has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 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 18:05:57,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:57,528 INFO L93 Difference]: Finished difference Result 1524 states and 2263 transitions. [2025-02-05 18:05:57,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:57,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 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 400 [2025-02-05 18:05:57,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:57,533 INFO L225 Difference]: With dead ends: 1524 [2025-02-05 18:05:57,533 INFO L226 Difference]: Without dead ends: 824 [2025-02-05 18:05:57,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:57,536 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2540 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:57,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2540 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:57,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2025-02-05 18:05:57,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 822. [2025-02-05 18:05:57,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 821 states have (on average 1.4859926918392206) internal successors, (1220), 821 states have internal predecessors, (1220), 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 18:05:57,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1220 transitions. [2025-02-05 18:05:57,558 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1220 transitions. Word has length 400 [2025-02-05 18:05:57,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:57,559 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1220 transitions. [2025-02-05 18:05:57,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 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 18:05:57,560 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1220 transitions. [2025-02-05 18:05:57,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-02-05 18:05:57,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:57,563 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:57,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 18:05:57,563 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:57,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:57,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1471799725, now seen corresponding path program 1 times [2025-02-05 18:05:57,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:57,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251750462] [2025-02-05 18:05:57,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:57,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:57,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-02-05 18:05:57,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-02-05 18:05:57,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:57,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 18:05:58,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:58,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251750462] [2025-02-05 18:05:58,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251750462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:58,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:58,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:05:58,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987164582] [2025-02-05 18:05:58,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:58,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:05:58,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:58,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:05:58,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:05:58,239 INFO L87 Difference]: Start difference. First operand 822 states and 1220 transitions. Second operand has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 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 18:05:58,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:58,561 INFO L93 Difference]: Finished difference Result 1538 states and 2281 transitions. [2025-02-05 18:05:58,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 18:05:58,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 401 [2025-02-05 18:05:58,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:58,566 INFO L225 Difference]: With dead ends: 1538 [2025-02-05 18:05:58,566 INFO L226 Difference]: Without dead ends: 836 [2025-02-05 18:05:58,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:05:58,568 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 4 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2541 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:58,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2541 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:58,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2025-02-05 18:05:58,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 826. [2025-02-05 18:05:58,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 825 states have (on average 1.486060606060606) internal successors, (1226), 825 states have internal predecessors, (1226), 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 18:05:58,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1226 transitions. [2025-02-05 18:05:58,586 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1226 transitions. Word has length 401 [2025-02-05 18:05:58,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:58,587 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 1226 transitions. [2025-02-05 18:05:58,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 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 18:05:58,587 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1226 transitions. [2025-02-05 18:05:58,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-02-05 18:05:58,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:58,590 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:58,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 18:05:58,591 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:58,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:58,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1998960192, now seen corresponding path program 1 times [2025-02-05 18:05:58,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:58,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700271284] [2025-02-05 18:05:58,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:58,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:58,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-02-05 18:05:58,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-02-05 18:05:58,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:58,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:05:59,085 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 18:05:59,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:05:59,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700271284] [2025-02-05 18:05:59,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700271284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:05:59,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:05:59,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:05:59,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034542328] [2025-02-05 18:05:59,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:05:59,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:05:59,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:05:59,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:05:59,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:59,089 INFO L87 Difference]: Start difference. First operand 826 states and 1226 transitions. Second operand has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 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 18:05:59,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:05:59,475 INFO L93 Difference]: Finished difference Result 1544 states and 2291 transitions. [2025-02-05 18:05:59,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:05:59,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 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 402 [2025-02-05 18:05:59,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:05:59,481 INFO L225 Difference]: With dead ends: 1544 [2025-02-05 18:05:59,481 INFO L226 Difference]: Without dead ends: 830 [2025-02-05 18:05:59,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:05:59,483 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2540 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:05:59,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2540 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:05:59,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2025-02-05 18:05:59,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 828. [2025-02-05 18:05:59,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 827 states have (on average 1.4848851269649335) internal successors, (1228), 827 states have internal predecessors, (1228), 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 18:05:59,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1228 transitions. [2025-02-05 18:05:59,499 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1228 transitions. Word has length 402 [2025-02-05 18:05:59,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:05:59,500 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1228 transitions. [2025-02-05 18:05:59,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 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 18:05:59,500 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1228 transitions. [2025-02-05 18:05:59,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-02-05 18:05:59,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:05:59,502 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:05:59,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 18:05:59,502 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:05:59,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:05:59,503 INFO L85 PathProgramCache]: Analyzing trace with hash 2036292120, now seen corresponding path program 1 times [2025-02-05 18:05:59,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:05:59,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910584597] [2025-02-05 18:05:59,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:05:59,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:05:59,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-02-05 18:05:59,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-02-05 18:05:59,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:05:59,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:00,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:00,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910584597] [2025-02-05 18:06:00,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910584597] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:06:00,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483946043] [2025-02-05 18:06:00,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:00,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:06:00,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:06:00,156 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 18:06:00,157 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 18:06:00,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-02-05 18:06:00,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-02-05 18:06:00,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:00,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:00,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 1703 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 18:06:00,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:06:01,665 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 28 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:01,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 18:06:02,466 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 28 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:02,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483946043] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 18:06:02,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 18:06:02,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2025-02-05 18:06:02,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059759493] [2025-02-05 18:06:02,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 18:06:02,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 18:06:02,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:02,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 18:06:02,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-02-05 18:06:02,470 INFO L87 Difference]: Start difference. First operand 828 states and 1228 transitions. Second operand has 15 states, 15 states have (on average 54.8) internal successors, (822), 15 states have internal predecessors, (822), 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 18:06:05,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:05,177 INFO L93 Difference]: Finished difference Result 6458 states and 9561 transitions. [2025-02-05 18:06:05,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-05 18:06:05,178 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 54.8) internal successors, (822), 15 states have internal predecessors, (822), 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 403 [2025-02-05 18:06:05,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:05,191 INFO L225 Difference]: With dead ends: 6458 [2025-02-05 18:06:05,192 INFO L226 Difference]: Without dead ends: 3718 [2025-02-05 18:06:05,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 801 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=391, Invalid=2365, Unknown=0, NotChecked=0, Total=2756 [2025-02-05 18:06:05,197 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 15783 mSDsluCounter, 8728 mSDsCounter, 0 mSdLazyCounter, 2907 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15783 SdHoareTripleChecker+Valid, 9561 SdHoareTripleChecker+Invalid, 3054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 2907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:05,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15783 Valid, 9561 Invalid, 3054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 2907 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 18:06:05,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2025-02-05 18:06:05,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 1596. [2025-02-05 18:06:05,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1595 states have (on average 1.484012539184953) internal successors, (2367), 1595 states have internal predecessors, (2367), 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 18:06:05,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2367 transitions. [2025-02-05 18:06:05,256 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2367 transitions. Word has length 403 [2025-02-05 18:06:05,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:05,256 INFO L471 AbstractCegarLoop]: Abstraction has 1596 states and 2367 transitions. [2025-02-05 18:06:05,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 54.8) internal successors, (822), 15 states have internal predecessors, (822), 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 18:06:05,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2367 transitions. [2025-02-05 18:06:05,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-02-05 18:06:05,261 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:05,261 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:05,277 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 18:06:05,465 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,SelfDestructingSolverStorable17 [2025-02-05 18:06:05,466 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:05,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:05,468 INFO L85 PathProgramCache]: Analyzing trace with hash 21784668, now seen corresponding path program 1 times [2025-02-05 18:06:05,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:05,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027959332] [2025-02-05 18:06:05,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:05,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:05,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-02-05 18:06:05,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-02-05 18:06:05,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:05,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 34 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:06,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:06,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027959332] [2025-02-05 18:06:06,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027959332] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:06:06,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436181964] [2025-02-05 18:06:06,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:06,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:06:06,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:06:06,114 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 18:06:06,125 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 18:06:06,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-02-05 18:06:06,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-02-05 18:06:06,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:06,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:06,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 1709 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 18:06:06,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:06:06,931 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 18:06:06,931 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 18:06:06,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436181964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:06,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 18:06:06,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-02-05 18:06:06,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016873445] [2025-02-05 18:06:06,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:06,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:06:06,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:06,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:06:06,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-02-05 18:06:06,934 INFO L87 Difference]: Start difference. First operand 1596 states and 2367 transitions. Second operand has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 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 18:06:07,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:07,627 INFO L93 Difference]: Finished difference Result 4148 states and 6148 transitions. [2025-02-05 18:06:07,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:06:07,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 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 18:06:07,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:07,635 INFO L225 Difference]: With dead ends: 4148 [2025-02-05 18:06:07,635 INFO L226 Difference]: Without dead ends: 2706 [2025-02-05 18:06:07,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-05 18:06:07,639 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 1746 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1746 SdHoareTripleChecker+Valid, 2936 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:07,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1746 Valid, 2936 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 18:06:07,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2706 states. [2025-02-05 18:06:07,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2706 to 1624. [2025-02-05 18:06:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1623 states have (on average 1.4793592113370302) internal successors, (2401), 1623 states have internal predecessors, (2401), 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 18:06:07,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2401 transitions. [2025-02-05 18:06:07,680 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2401 transitions. Word has length 405 [2025-02-05 18:06:07,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:07,681 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2401 transitions. [2025-02-05 18:06:07,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 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 18:06:07,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2401 transitions. [2025-02-05 18:06:07,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-02-05 18:06:07,685 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:07,686 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:07,703 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 18:06:07,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:06:07,886 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:07,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:07,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1601800485, now seen corresponding path program 1 times [2025-02-05 18:06:07,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:07,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379657976] [2025-02-05 18:06:07,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:07,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:07,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-02-05 18:06:07,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-02-05 18:06:07,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:07,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:08,458 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 34 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:08,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:08,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379657976] [2025-02-05 18:06:08,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379657976] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:06:08,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833886392] [2025-02-05 18:06:08,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:08,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:06:08,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:06:08,461 INFO L229 MonitoredProcess]: Starting monitored process 4 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 18:06:08,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 18:06:08,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-02-05 18:06:09,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-02-05 18:06:09,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:09,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:09,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 1712 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 18:06:09,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:06:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:09,393 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 18:06:09,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833886392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:09,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 18:06:09,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-02-05 18:06:09,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675119168] [2025-02-05 18:06:09,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:09,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:06:09,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:09,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:06:09,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-05 18:06:09,395 INFO L87 Difference]: Start difference. First operand 1624 states and 2401 transitions. Second operand has 6 states, 6 states have (on average 67.66666666666667) internal successors, (406), 6 states have internal predecessors, (406), 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 18:06:10,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:10,108 INFO L93 Difference]: Finished difference Result 3982 states and 5879 transitions. [2025-02-05 18:06:10,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:06:10,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 67.66666666666667) internal successors, (406), 6 states have internal predecessors, (406), 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 406 [2025-02-05 18:06:10,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:10,116 INFO L225 Difference]: With dead ends: 3982 [2025-02-05 18:06:10,116 INFO L226 Difference]: Without dead ends: 2540 [2025-02-05 18:06:10,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-05 18:06:10,118 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 1983 mSDsluCounter, 1941 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1983 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:10,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1983 Valid, 2592 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:06:10,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states. [2025-02-05 18:06:10,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 2060. [2025-02-05 18:06:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2060 states, 2059 states have (on average 1.4672170956775135) internal successors, (3021), 2059 states have internal predecessors, (3021), 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 18:06:10,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 3021 transitions. [2025-02-05 18:06:10,162 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 3021 transitions. Word has length 406 [2025-02-05 18:06:10,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:10,167 INFO L471 AbstractCegarLoop]: Abstraction has 2060 states and 3021 transitions. [2025-02-05 18:06:10,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.66666666666667) internal successors, (406), 6 states have internal predecessors, (406), 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 18:06:10,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 3021 transitions. [2025-02-05 18:06:10,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-02-05 18:06:10,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:10,175 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:10,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 18:06:10,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:06:10,376 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:10,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:10,377 INFO L85 PathProgramCache]: Analyzing trace with hash 227161199, now seen corresponding path program 1 times [2025-02-05 18:06:10,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:10,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662446360] [2025-02-05 18:06:10,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:10,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:10,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-02-05 18:06:10,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-02-05 18:06:10,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:10,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:10,917 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 34 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:10,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:10,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662446360] [2025-02-05 18:06:10,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662446360] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:06:10,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813515872] [2025-02-05 18:06:10,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:10,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:06:10,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:06:10,920 INFO L229 MonitoredProcess]: Starting monitored process 5 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 18:06:10,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 18:06:11,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-02-05 18:06:11,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-02-05 18:06:11,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:11,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:11,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 1715 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 18:06:11,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:06:12,186 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:12,186 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 18:06:12,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813515872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:12,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 18:06:12,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-02-05 18:06:12,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044628261] [2025-02-05 18:06:12,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:12,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:06:12,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:12,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:06:12,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-05 18:06:12,188 INFO L87 Difference]: Start difference. First operand 2060 states and 3021 transitions. Second operand has 6 states, 6 states have (on average 67.83333333333333) internal successors, (407), 6 states have internal predecessors, (407), 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 18:06:13,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:13,057 INFO L93 Difference]: Finished difference Result 4354 states and 6414 transitions. [2025-02-05 18:06:13,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 18:06:13,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 67.83333333333333) internal successors, (407), 6 states have internal predecessors, (407), 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 407 [2025-02-05 18:06:13,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:13,070 INFO L225 Difference]: With dead ends: 4354 [2025-02-05 18:06:13,071 INFO L226 Difference]: Without dead ends: 2540 [2025-02-05 18:06:13,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-05 18:06:13,075 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 1188 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 2590 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:13,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 2590 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 18:06:13,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states. [2025-02-05 18:06:13,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 2536. [2025-02-05 18:06:13,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 2535 states have (on average 1.4725838264299802) internal successors, (3733), 2535 states have internal predecessors, (3733), 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 18:06:13,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 3733 transitions. [2025-02-05 18:06:13,113 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 3733 transitions. Word has length 407 [2025-02-05 18:06:13,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:13,113 INFO L471 AbstractCegarLoop]: Abstraction has 2536 states and 3733 transitions. [2025-02-05 18:06:13,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.83333333333333) internal successors, (407), 6 states have internal predecessors, (407), 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 18:06:13,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 3733 transitions. [2025-02-05 18:06:13,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-02-05 18:06:13,118 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:13,118 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:13,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 18:06:13,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-02-05 18:06:13,319 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:13,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:13,319 INFO L85 PathProgramCache]: Analyzing trace with hash 280750556, now seen corresponding path program 1 times [2025-02-05 18:06:13,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:13,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240606889] [2025-02-05 18:06:13,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:13,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:13,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-02-05 18:06:13,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-02-05 18:06:13,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:13,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:13,809 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 34 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:13,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:13,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240606889] [2025-02-05 18:06:13,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240606889] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 18:06:13,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828718190] [2025-02-05 18:06:13,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:13,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 18:06:13,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:06:13,812 INFO L229 MonitoredProcess]: Starting monitored process 6 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 18:06:13,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 18:06:14,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-02-05 18:06:14,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-02-05 18:06:14,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:14,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:14,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 1715 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-05 18:06:14,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 18:06:15,244 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 34 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:15,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 18:06:16,408 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 36 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:16,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828718190] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 18:06:16,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 18:06:16,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 12] total 31 [2025-02-05 18:06:16,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734909252] [2025-02-05 18:06:16,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 18:06:16,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-05 18:06:16,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:16,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-05 18:06:16,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2025-02-05 18:06:16,411 INFO L87 Difference]: Start difference. First operand 2536 states and 3733 transitions. Second operand has 31 states, 31 states have (on average 35.096774193548384) internal successors, (1088), 31 states have internal predecessors, (1088), 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 18:06:23,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:23,211 INFO L93 Difference]: Finished difference Result 35904 states and 52965 transitions. [2025-02-05 18:06:23,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2025-02-05 18:06:23,215 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 35.096774193548384) internal successors, (1088), 31 states have internal predecessors, (1088), 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 407 [2025-02-05 18:06:23,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:23,281 INFO L225 Difference]: With dead ends: 35904 [2025-02-05 18:06:23,281 INFO L226 Difference]: Without dead ends: 33614 [2025-02-05 18:06:23,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 970 GetRequests, 801 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10391 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2460, Invalid=26610, Unknown=0, NotChecked=0, Total=29070 [2025-02-05 18:06:23,300 INFO L435 NwaCegarLoop]: 1544 mSDtfsCounter, 18178 mSDsluCounter, 34157 mSDsCounter, 0 mSdLazyCounter, 8644 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18178 SdHoareTripleChecker+Valid, 35701 SdHoareTripleChecker+Invalid, 8676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 8644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:23,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18178 Valid, 35701 Invalid, 8676 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 8644 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 18:06:23,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33614 states. [2025-02-05 18:06:23,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33614 to 6968. [2025-02-05 18:06:23,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6968 states, 6967 states have (on average 1.4702167360413376) internal successors, (10243), 6967 states have internal predecessors, (10243), 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 18:06:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6968 states to 6968 states and 10243 transitions. [2025-02-05 18:06:23,542 INFO L78 Accepts]: Start accepts. Automaton has 6968 states and 10243 transitions. Word has length 407 [2025-02-05 18:06:23,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:23,543 INFO L471 AbstractCegarLoop]: Abstraction has 6968 states and 10243 transitions. [2025-02-05 18:06:23,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 35.096774193548384) internal successors, (1088), 31 states have internal predecessors, (1088), 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 18:06:23,543 INFO L276 IsEmpty]: Start isEmpty. Operand 6968 states and 10243 transitions. [2025-02-05 18:06:23,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-02-05 18:06:23,595 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:23,595 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:23,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 18:06:23,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-05 18:06:23,796 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:23,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:23,797 INFO L85 PathProgramCache]: Analyzing trace with hash -482144826, now seen corresponding path program 1 times [2025-02-05 18:06:23,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:23,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209865286] [2025-02-05 18:06:23,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:23,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:23,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-02-05 18:06:23,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-02-05 18:06:23,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:23,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:24,288 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 18:06:24,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:24,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209865286] [2025-02-05 18:06:24,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209865286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:24,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:24,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:06:24,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060669940] [2025-02-05 18:06:24,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:24,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:06:24,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:24,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:06:24,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:24,291 INFO L87 Difference]: Start difference. First operand 6968 states and 10243 transitions. Second operand has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 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 18:06:24,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:24,536 INFO L93 Difference]: Finished difference Result 13402 states and 19734 transitions. [2025-02-05 18:06:24,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:06:24,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 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 409 [2025-02-05 18:06:24,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:24,551 INFO L225 Difference]: With dead ends: 13402 [2025-02-05 18:06:24,551 INFO L226 Difference]: Without dead ends: 7016 [2025-02-05 18:06:24,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:06:24,558 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 0 mSDsluCounter, 1690 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2543 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:24,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2543 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 18:06:24,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7016 states. [2025-02-05 18:06:24,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7016 to 6968. [2025-02-05 18:06:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6968 states, 6967 states have (on average 1.4702167360413376) internal successors, (10243), 6967 states have internal predecessors, (10243), 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 18:06:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6968 states to 6968 states and 10243 transitions. [2025-02-05 18:06:24,633 INFO L78 Accepts]: Start accepts. Automaton has 6968 states and 10243 transitions. Word has length 409 [2025-02-05 18:06:24,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:24,633 INFO L471 AbstractCegarLoop]: Abstraction has 6968 states and 10243 transitions. [2025-02-05 18:06:24,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 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 18:06:24,633 INFO L276 IsEmpty]: Start isEmpty. Operand 6968 states and 10243 transitions. [2025-02-05 18:06:24,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-02-05 18:06:24,645 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:24,645 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:24,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 18:06:24,646 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:24,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:24,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1656777965, now seen corresponding path program 1 times [2025-02-05 18:06:24,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:24,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459045786] [2025-02-05 18:06:24,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:24,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:24,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-02-05 18:06:24,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-02-05 18:06:24,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:24,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:25,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:25,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459045786] [2025-02-05 18:06:25,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459045786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:25,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:25,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 18:06:25,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231020799] [2025-02-05 18:06:25,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:25,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 18:06:25,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:25,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 18:06:25,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 18:06:25,803 INFO L87 Difference]: Start difference. First operand 6968 states and 10243 transitions. Second operand has 8 states, 8 states have (on average 51.25) internal successors, (410), 8 states have internal predecessors, (410), 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 18:06:27,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:27,437 INFO L93 Difference]: Finished difference Result 19391 states and 28519 transitions. [2025-02-05 18:06:27,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 18:06:27,437 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 51.25) internal successors, (410), 8 states have internal predecessors, (410), 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 410 [2025-02-05 18:06:27,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:27,459 INFO L225 Difference]: With dead ends: 19391 [2025-02-05 18:06:27,460 INFO L226 Difference]: Without dead ends: 13005 [2025-02-05 18:06:27,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-05 18:06:27,471 INFO L435 NwaCegarLoop]: 1366 mSDtfsCounter, 1971 mSDsluCounter, 4468 mSDsCounter, 0 mSdLazyCounter, 3319 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1971 SdHoareTripleChecker+Valid, 5834 SdHoareTripleChecker+Invalid, 3320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:27,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1971 Valid, 5834 Invalid, 3320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3319 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 18:06:27,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13005 states. [2025-02-05 18:06:27,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13005 to 8840. [2025-02-05 18:06:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8840 states, 8839 states have (on average 1.4688313157597013) internal successors, (12983), 8839 states have internal predecessors, (12983), 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 18:06:27,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12983 transitions. [2025-02-05 18:06:27,589 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12983 transitions. Word has length 410 [2025-02-05 18:06:27,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:27,589 INFO L471 AbstractCegarLoop]: Abstraction has 8840 states and 12983 transitions. [2025-02-05 18:06:27,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 51.25) internal successors, (410), 8 states have internal predecessors, (410), 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 18:06:27,589 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12983 transitions. [2025-02-05 18:06:27,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-02-05 18:06:27,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:27,604 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:27,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 18:06:27,604 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:27,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:27,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1311970635, now seen corresponding path program 1 times [2025-02-05 18:06:27,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:27,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292384714] [2025-02-05 18:06:27,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:27,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:27,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-02-05 18:06:27,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-02-05 18:06:27,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:27,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 18:06:28,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:28,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292384714] [2025-02-05 18:06:28,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292384714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:28,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:28,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 18:06:28,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109313818] [2025-02-05 18:06:28,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:28,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:06:28,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:28,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:06:28,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:06:28,396 INFO L87 Difference]: Start difference. First operand 8840 states and 12983 transitions. Second operand has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 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 18:06:29,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:29,192 INFO L93 Difference]: Finished difference Result 22275 states and 32742 transitions. [2025-02-05 18:06:29,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:06:29,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 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 410 [2025-02-05 18:06:29,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:29,210 INFO L225 Difference]: With dead ends: 22275 [2025-02-05 18:06:29,211 INFO L226 Difference]: Without dead ends: 14092 [2025-02-05 18:06:29,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:06:29,222 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 1724 mSDsluCounter, 2209 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 2938 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:29,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1724 Valid, 2938 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:06:29,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14092 states. [2025-02-05 18:06:29,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14092 to 8840. [2025-02-05 18:06:29,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8840 states, 8839 states have (on average 1.4670211562393936) internal successors, (12967), 8839 states have internal predecessors, (12967), 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 18:06:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12967 transitions. [2025-02-05 18:06:29,364 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12967 transitions. Word has length 410 [2025-02-05 18:06:29,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:29,364 INFO L471 AbstractCegarLoop]: Abstraction has 8840 states and 12967 transitions. [2025-02-05 18:06:29,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 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 18:06:29,365 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12967 transitions. [2025-02-05 18:06:29,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-02-05 18:06:29,379 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:29,379 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:29,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 18:06:29,380 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:29,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:29,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2029026437, now seen corresponding path program 1 times [2025-02-05 18:06:29,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:29,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819081301] [2025-02-05 18:06:29,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:29,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:29,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-02-05 18:06:29,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-02-05 18:06:29,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:29,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:29,935 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 18:06:29,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:29,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819081301] [2025-02-05 18:06:29,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819081301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:29,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:29,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 18:06:29,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684684919] [2025-02-05 18:06:29,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:29,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:06:29,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:29,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:06:29,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:06:29,937 INFO L87 Difference]: Start difference. First operand 8840 states and 12967 transitions. Second operand has 6 states, 6 states have (on average 67.33333333333333) internal successors, (404), 6 states have internal predecessors, (404), 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 18:06:30,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:30,742 INFO L93 Difference]: Finished difference Result 22215 states and 32684 transitions. [2025-02-05 18:06:30,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:06:30,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 67.33333333333333) internal successors, (404), 6 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 411 [2025-02-05 18:06:30,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:30,764 INFO L225 Difference]: With dead ends: 22215 [2025-02-05 18:06:30,764 INFO L226 Difference]: Without dead ends: 14128 [2025-02-05 18:06:30,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:06:30,779 INFO L435 NwaCegarLoop]: 730 mSDtfsCounter, 905 mSDsluCounter, 2748 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 3478 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:30,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 3478 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:06:30,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14128 states. [2025-02-05 18:06:30,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14128 to 8936. [2025-02-05 18:06:30,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8936 states, 8935 states have (on average 1.463794068270845) internal successors, (13079), 8935 states have internal predecessors, (13079), 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 18:06:30,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8936 states to 8936 states and 13079 transitions. [2025-02-05 18:06:30,927 INFO L78 Accepts]: Start accepts. Automaton has 8936 states and 13079 transitions. Word has length 411 [2025-02-05 18:06:30,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:30,927 INFO L471 AbstractCegarLoop]: Abstraction has 8936 states and 13079 transitions. [2025-02-05 18:06:30,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.33333333333333) internal successors, (404), 6 states have internal predecessors, (404), 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 18:06:30,928 INFO L276 IsEmpty]: Start isEmpty. Operand 8936 states and 13079 transitions. [2025-02-05 18:06:30,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-02-05 18:06:30,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:30,942 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:30,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 18:06:30,943 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:30,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:30,944 INFO L85 PathProgramCache]: Analyzing trace with hash 642830800, now seen corresponding path program 1 times [2025-02-05 18:06:30,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:30,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967752985] [2025-02-05 18:06:30,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:30,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:30,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-02-05 18:06:31,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-02-05 18:06:31,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:31,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:31,652 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:31,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:31,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967752985] [2025-02-05 18:06:31,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967752985] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:31,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:31,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 18:06:31,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473412805] [2025-02-05 18:06:31,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:31,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:06:31,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:31,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:06:31,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:06:31,654 INFO L87 Difference]: Start difference. First operand 8936 states and 13079 transitions. Second operand has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 6 states have internal predecessors, (412), 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 18:06:32,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:32,415 INFO L93 Difference]: Finished difference Result 24623 states and 36086 transitions. [2025-02-05 18:06:32,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:06:32,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 6 states have internal predecessors, (412), 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 412 [2025-02-05 18:06:32,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:32,438 INFO L225 Difference]: With dead ends: 24623 [2025-02-05 18:06:32,439 INFO L226 Difference]: Without dead ends: 16536 [2025-02-05 18:06:32,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:06:32,452 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 1521 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 2335 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:32,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 2335 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:06:32,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16536 states. [2025-02-05 18:06:32,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16536 to 12968. [2025-02-05 18:06:32,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12968 states, 12967 states have (on average 1.4503740263746434) internal successors, (18807), 12967 states have internal predecessors, (18807), 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 18:06:32,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12968 states to 12968 states and 18807 transitions. [2025-02-05 18:06:32,638 INFO L78 Accepts]: Start accepts. Automaton has 12968 states and 18807 transitions. Word has length 412 [2025-02-05 18:06:32,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:32,639 INFO L471 AbstractCegarLoop]: Abstraction has 12968 states and 18807 transitions. [2025-02-05 18:06:32,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 6 states have internal predecessors, (412), 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 18:06:32,639 INFO L276 IsEmpty]: Start isEmpty. Operand 12968 states and 18807 transitions. [2025-02-05 18:06:32,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-02-05 18:06:32,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:32,655 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:32,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 18:06:32,655 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:32,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:32,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1563291921, now seen corresponding path program 1 times [2025-02-05 18:06:32,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:32,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305854055] [2025-02-05 18:06:32,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:32,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:32,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-02-05 18:06:32,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-02-05 18:06:32,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:32,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:33,319 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:33,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:33,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305854055] [2025-02-05 18:06:33,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305854055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:33,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:33,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 18:06:33,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799885265] [2025-02-05 18:06:33,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:33,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:06:33,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:33,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:06:33,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:06:33,322 INFO L87 Difference]: Start difference. First operand 12968 states and 18807 transitions. Second operand has 6 states, 6 states have (on average 68.83333333333333) internal successors, (413), 6 states have internal predecessors, (413), 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 18:06:34,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:34,104 INFO L93 Difference]: Finished difference Result 35376 states and 51383 transitions. [2025-02-05 18:06:34,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:06:34,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 68.83333333333333) internal successors, (413), 6 states have internal predecessors, (413), 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 413 [2025-02-05 18:06:34,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:34,135 INFO L225 Difference]: With dead ends: 35376 [2025-02-05 18:06:34,135 INFO L226 Difference]: Without dead ends: 23897 [2025-02-05 18:06:34,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:06:34,154 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 1524 mSDsluCounter, 1697 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 2348 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:34,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 2348 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:06:34,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23897 states. [2025-02-05 18:06:34,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23897 to 20696. [2025-02-05 18:06:34,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20696 states, 20695 states have (on average 1.437593621647741) internal successors, (29751), 20695 states have internal predecessors, (29751), 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 18:06:34,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20696 states to 20696 states and 29751 transitions. [2025-02-05 18:06:34,475 INFO L78 Accepts]: Start accepts. Automaton has 20696 states and 29751 transitions. Word has length 413 [2025-02-05 18:06:34,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:34,475 INFO L471 AbstractCegarLoop]: Abstraction has 20696 states and 29751 transitions. [2025-02-05 18:06:34,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.83333333333333) internal successors, (413), 6 states have internal predecessors, (413), 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 18:06:34,476 INFO L276 IsEmpty]: Start isEmpty. Operand 20696 states and 29751 transitions. [2025-02-05 18:06:34,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-02-05 18:06:34,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:34,508 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:34,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 18:06:34,508 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:34,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:34,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1396624851, now seen corresponding path program 1 times [2025-02-05 18:06:34,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:34,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73119752] [2025-02-05 18:06:34,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:34,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:34,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-02-05 18:06:34,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-02-05 18:06:34,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:34,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:35,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:35,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73119752] [2025-02-05 18:06:35,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73119752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:35,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:35,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:06:35,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195751866] [2025-02-05 18:06:35,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:35,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:06:35,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:35,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:06:35,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:06:35,132 INFO L87 Difference]: Start difference. First operand 20696 states and 29751 transitions. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 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 18:06:35,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:35,646 INFO L93 Difference]: Finished difference Result 38815 states and 56149 transitions. [2025-02-05 18:06:35,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:06:35,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 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 414 [2025-02-05 18:06:35,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:35,669 INFO L225 Difference]: With dead ends: 38815 [2025-02-05 18:06:35,669 INFO L226 Difference]: Without dead ends: 20696 [2025-02-05 18:06:35,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 18:06:35,686 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 893 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:35,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 1306 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:06:35,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20696 states. [2025-02-05 18:06:35,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20696 to 20696. [2025-02-05 18:06:35,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20696 states, 20695 states have (on average 1.4368204880405895) internal successors, (29735), 20695 states have internal predecessors, (29735), 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 18:06:35,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20696 states to 20696 states and 29735 transitions. [2025-02-05 18:06:35,890 INFO L78 Accepts]: Start accepts. Automaton has 20696 states and 29735 transitions. Word has length 414 [2025-02-05 18:06:35,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:35,890 INFO L471 AbstractCegarLoop]: Abstraction has 20696 states and 29735 transitions. [2025-02-05 18:06:35,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 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 18:06:35,891 INFO L276 IsEmpty]: Start isEmpty. Operand 20696 states and 29735 transitions. [2025-02-05 18:06:35,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-02-05 18:06:35,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:35,914 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:35,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 18:06:35,915 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:35,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:35,915 INFO L85 PathProgramCache]: Analyzing trace with hash 997724174, now seen corresponding path program 1 times [2025-02-05 18:06:35,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:35,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733524282] [2025-02-05 18:06:35,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:35,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:35,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-02-05 18:06:36,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-02-05 18:06:36,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:36,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:36,844 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:36,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:36,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733524282] [2025-02-05 18:06:36,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733524282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:36,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:36,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 18:06:36,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967831455] [2025-02-05 18:06:36,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:36,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 18:06:36,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:36,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 18:06:36,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 18:06:36,846 INFO L87 Difference]: Start difference. First operand 20696 states and 29735 transitions. Second operand has 8 states, 8 states have (on average 51.875) internal successors, (415), 8 states have internal predecessors, (415), 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 18:06:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:38,120 INFO L93 Difference]: Finished difference Result 51403 states and 74178 transitions. [2025-02-05 18:06:38,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 18:06:38,121 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 51.875) internal successors, (415), 8 states have internal predecessors, (415), 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 415 [2025-02-05 18:06:38,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:38,166 INFO L225 Difference]: With dead ends: 51403 [2025-02-05 18:06:38,166 INFO L226 Difference]: Without dead ends: 33284 [2025-02-05 18:06:38,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-02-05 18:06:38,196 INFO L435 NwaCegarLoop]: 1100 mSDtfsCounter, 1602 mSDsluCounter, 2840 mSDsCounter, 0 mSdLazyCounter, 2246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1602 SdHoareTripleChecker+Valid, 3940 SdHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:38,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1602 Valid, 3940 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2246 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 18:06:38,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33284 states. [2025-02-05 18:06:38,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33284 to 31946. [2025-02-05 18:06:38,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31946 states, 31945 states have (on average 1.4335576772577867) internal successors, (45795), 31945 states have internal predecessors, (45795), 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 18:06:38,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31946 states to 31946 states and 45795 transitions. [2025-02-05 18:06:38,601 INFO L78 Accepts]: Start accepts. Automaton has 31946 states and 45795 transitions. Word has length 415 [2025-02-05 18:06:38,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:38,601 INFO L471 AbstractCegarLoop]: Abstraction has 31946 states and 45795 transitions. [2025-02-05 18:06:38,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 51.875) internal successors, (415), 8 states have internal predecessors, (415), 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 18:06:38,602 INFO L276 IsEmpty]: Start isEmpty. Operand 31946 states and 45795 transitions. [2025-02-05 18:06:38,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2025-02-05 18:06:38,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:38,678 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:38,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 18:06:38,678 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:38,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:38,678 INFO L85 PathProgramCache]: Analyzing trace with hash 605478713, now seen corresponding path program 1 times [2025-02-05 18:06:38,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:38,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506609069] [2025-02-05 18:06:38,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:38,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:38,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-02-05 18:06:38,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-02-05 18:06:38,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:38,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:39,399 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:39,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:39,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506609069] [2025-02-05 18:06:39,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506609069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:39,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:39,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:06:39,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106385284] [2025-02-05 18:06:39,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:39,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:06:39,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:39,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:06:39,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:06:39,401 INFO L87 Difference]: Start difference. First operand 31946 states and 45795 transitions. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:40,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:40,073 INFO L93 Difference]: Finished difference Result 59775 states and 86247 transitions. [2025-02-05 18:06:40,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:06:40,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 416 [2025-02-05 18:06:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:40,108 INFO L225 Difference]: With dead ends: 59775 [2025-02-05 18:06:40,108 INFO L226 Difference]: Without dead ends: 31946 [2025-02-05 18:06:40,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 18:06:40,122 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 943 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:40,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 1307 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:06:40,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31946 states. [2025-02-05 18:06:40,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31946 to 31946. [2025-02-05 18:06:40,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31946 states, 31945 states have (on average 1.4303020817029268) internal successors, (45691), 31945 states have internal predecessors, (45691), 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 18:06:40,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31946 states to 31946 states and 45691 transitions. [2025-02-05 18:06:40,533 INFO L78 Accepts]: Start accepts. Automaton has 31946 states and 45691 transitions. Word has length 416 [2025-02-05 18:06:40,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:40,533 INFO L471 AbstractCegarLoop]: Abstraction has 31946 states and 45691 transitions. [2025-02-05 18:06:40,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:06:40,533 INFO L276 IsEmpty]: Start isEmpty. Operand 31946 states and 45691 transitions. [2025-02-05 18:06:40,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-02-05 18:06:40,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:40,577 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:40,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 18:06:40,577 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:40,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:40,578 INFO L85 PathProgramCache]: Analyzing trace with hash -390719592, now seen corresponding path program 1 times [2025-02-05 18:06:40,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:40,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954669005] [2025-02-05 18:06:40,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:40,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:40,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-02-05 18:06:40,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-02-05 18:06:40,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:06:40,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:06:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:06:41,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:06:41,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954669005] [2025-02-05 18:06:41,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954669005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:06:41,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:06:41,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 18:06:41,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233478315] [2025-02-05 18:06:41,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:06:41,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 18:06:41,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:06:41,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 18:06:41,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 18:06:41,632 INFO L87 Difference]: Start difference. First operand 31946 states and 45691 transitions. Second operand has 8 states, 8 states have (on average 52.125) internal successors, (417), 8 states have internal predecessors, (417), 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 18:06:43,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:06:43,225 INFO L93 Difference]: Finished difference Result 74642 states and 107307 transitions. [2025-02-05 18:06:43,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 18:06:43,226 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 52.125) internal successors, (417), 8 states have internal predecessors, (417), 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 417 [2025-02-05 18:06:43,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:06:43,292 INFO L225 Difference]: With dead ends: 74642 [2025-02-05 18:06:43,292 INFO L226 Difference]: Without dead ends: 46813 [2025-02-05 18:06:43,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-02-05 18:06:43,331 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 1569 mSDsluCounter, 3768 mSDsCounter, 0 mSdLazyCounter, 2736 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 4814 SdHoareTripleChecker+Invalid, 2737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:06:43,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1569 Valid, 4814 Invalid, 2737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2736 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 18:06:43,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46813 states. [2025-02-05 18:06:43,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46813 to 43630. [2025-02-05 18:06:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43630 states, 43629 states have (on average 1.4258176900685324) internal successors, (62207), 43629 states have internal predecessors, (62207), 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 18:06:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43630 states to 43630 states and 62207 transitions. [2025-02-05 18:06:43,838 INFO L78 Accepts]: Start accepts. Automaton has 43630 states and 62207 transitions. Word has length 417 [2025-02-05 18:06:43,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:06:43,838 INFO L471 AbstractCegarLoop]: Abstraction has 43630 states and 62207 transitions. [2025-02-05 18:06:43,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 52.125) internal successors, (417), 8 states have internal predecessors, (417), 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 18:06:43,839 INFO L276 IsEmpty]: Start isEmpty. Operand 43630 states and 62207 transitions. [2025-02-05 18:06:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2025-02-05 18:06:43,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:06:43,890 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:06:43,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 18:06:43,891 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:06:43,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:06:43,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1749093794, now seen corresponding path program 1 times [2025-02-05 18:06:43,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:06:43,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729386568] [2025-02-05 18:06:43,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:06:43,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:06:43,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes.