./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 025025ef74b1493ac4064064509ff34d15f77bc18ba9a65b0d0237e8c59a21c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:00:25,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:00:25,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:00:25,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:00:25,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:00:25,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:00:25,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:00:25,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:00:25,530 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:00:25,530 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:00:25,530 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:00:25,530 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:00:25,530 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:00:25,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:00:25,531 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:00:25,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:00:25,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:00:25,532 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:00:25,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:00:25,532 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:00:25,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:00:25,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:00:25,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:00:25,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:00:25,533 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:00:25,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:00:25,536 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:00:25,537 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:00:25,537 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:00:25,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:00:25,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:00:25,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:00:25,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:00:25,537 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:00:25,537 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:00:25,537 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:00:25,537 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:00:25,537 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:00:25,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:00:25,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:00:25,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:00:25,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:00:25,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:00:25,537 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 025025ef74b1493ac4064064509ff34d15f77bc18ba9a65b0d0237e8c59a21c9 [2025-03-08 06:00:26,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:00:26,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:00:26,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:00:26,050 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:00:26,055 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:00:26,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c [2025-03-08 06:00:28,167 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a53b4688d/20afc1479c5c4937bf36138d719f3a62/FLAG2593b098e [2025-03-08 06:00:28,610 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:00:28,623 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c [2025-03-08 06:00:28,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a53b4688d/20afc1479c5c4937bf36138d719f3a62/FLAG2593b098e [2025-03-08 06:00:28,786 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a53b4688d/20afc1479c5c4937bf36138d719f3a62 [2025-03-08 06:00:28,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:00:28,793 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:00:28,798 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:00:28,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:00:28,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:00:28,807 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:00:28" (1/1) ... [2025-03-08 06:00:28,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60a0637f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:00:28, skipping insertion in model container [2025-03-08 06:00:28,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:00:28" (1/1) ... [2025-03-08 06:00:28,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:00:29,160 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c[12779,12792] [2025-03-08 06:00:29,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:00:29,185 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:00:29,279 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c[12779,12792] [2025-03-08 06:00:29,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:00:29,319 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:00:29,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:00:29 WrapperNode [2025-03-08 06:00:29,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:00:29,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:00:29,321 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:00:29,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:00:29,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:00:29" (1/1) ... [2025-03-08 06:00:29,351 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:00:29" (1/1) ... [2025-03-08 06:00:29,413 INFO L138 Inliner]: procedures = 25, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 380 [2025-03-08 06:00:29,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:00:29,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:00:29,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:00:29,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:00:29,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:00:29" (1/1) ... [2025-03-08 06:00:29,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:00:29" (1/1) ... [2025-03-08 06:00:29,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:00:29" (1/1) ... [2025-03-08 06:00:29,466 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-03-08 06:00:29,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:00:29" (1/1) ... [2025-03-08 06:00:29,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:00:29" (1/1) ... [2025-03-08 06:00:29,487 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:00:29" (1/1) ... [2025-03-08 06:00:29,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:00:29" (1/1) ... [2025-03-08 06:00:29,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:00:29" (1/1) ... [2025-03-08 06:00:29,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:00:29" (1/1) ... [2025-03-08 06:00:29,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:00:29,510 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:00:29,511 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:00:29,511 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:00:29,512 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:00:29" (1/1) ... [2025-03-08 06:00:29,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:00:29,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:00:29,581 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:00:29,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:00:29,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:00:29,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:00:29,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:00:29,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:00:29,765 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:00:29,771 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:00:30,539 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-03-08 06:00:30,541 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:00:30,565 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:00:30,565 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:00:30,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:00:30 BoogieIcfgContainer [2025-03-08 06:00:30,566 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:00:30,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:00:30,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:00:30,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:00:30,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:00:28" (1/3) ... [2025-03-08 06:00:30,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a441a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:00:30, skipping insertion in model container [2025-03-08 06:00:30,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:00:29" (2/3) ... [2025-03-08 06:00:30,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a441a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:00:30, skipping insertion in model container [2025-03-08 06:00:30,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:00:30" (3/3) ... [2025-03-08 06:00:30,583 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c [2025-03-08 06:00:30,612 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:00:30,618 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.5.ufo.UNBOUNDED.pals.c that has 1 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 06:00:30,716 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:00:30,741 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;@5ca91032, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:00:30,742 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:00:30,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 101 states have (on average 1.7425742574257426) internal successors, (176), 102 states have internal predecessors, (176), 0 states have call successors, (0), 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-03-08 06:00:30,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 06:00:30,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:30,765 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] [2025-03-08 06:00:30,766 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:30,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:30,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1859792487, now seen corresponding path program 1 times [2025-03-08 06:00:30,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:30,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000752278] [2025-03-08 06:00:30,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:30,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:30,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 06:00:31,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 06:00:31,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:31,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:31,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:31,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000752278] [2025-03-08 06:00:31,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000752278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:31,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:31,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 06:00:31,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015389825] [2025-03-08 06:00:31,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:31,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 06:00:31,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:31,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 06:00:31,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 06:00:31,293 INFO L87 Difference]: Start difference. First operand has 103 states, 101 states have (on average 1.7425742574257426) internal successors, (176), 102 states have internal predecessors, (176), 0 states have call successors, (0), 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 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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-03-08 06:00:31,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:31,316 INFO L93 Difference]: Finished difference Result 166 states and 280 transitions. [2025-03-08 06:00:31,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 06:00:31,318 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-03-08 06:00:31,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:31,326 INFO L225 Difference]: With dead ends: 166 [2025-03-08 06:00:31,326 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 06:00:31,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 06:00:31,336 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:31,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:00:31,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 06:00:31,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-08 06:00:31,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.7272727272727273) internal successors, (171), 99 states have internal predecessors, (171), 0 states have call successors, (0), 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-03-08 06:00:31,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 171 transitions. [2025-03-08 06:00:31,391 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 171 transitions. Word has length 33 [2025-03-08 06:00:31,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:31,393 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 171 transitions. [2025-03-08 06:00:31,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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-03-08 06:00:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 171 transitions. [2025-03-08 06:00:31,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 06:00:31,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:31,397 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] [2025-03-08 06:00:31,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:00:31,400 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:31,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:31,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1605055942, now seen corresponding path program 1 times [2025-03-08 06:00:31,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:31,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651468817] [2025-03-08 06:00:31,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:31,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:31,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 06:00:31,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 06:00:31,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:31,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:31,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:31,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651468817] [2025-03-08 06:00:31,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651468817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:31,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:31,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:00:31,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600290895] [2025-03-08 06:00:31,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:31,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:00:31,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:31,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:00:31,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:00:31,871 INFO L87 Difference]: Start difference. First operand 100 states and 171 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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-03-08 06:00:31,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:31,999 INFO L93 Difference]: Finished difference Result 166 states and 276 transitions. [2025-03-08 06:00:32,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:00:32,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-03-08 06:00:32,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:32,004 INFO L225 Difference]: With dead ends: 166 [2025-03-08 06:00:32,004 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 06:00:32,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:00:32,005 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:32,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 639 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:00:32,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 06:00:32,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-08 06:00:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.404040404040404) internal successors, (139), 99 states have internal predecessors, (139), 0 states have call successors, (0), 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-03-08 06:00:32,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 139 transitions. [2025-03-08 06:00:32,018 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 139 transitions. Word has length 33 [2025-03-08 06:00:32,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:32,019 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 139 transitions. [2025-03-08 06:00:32,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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-03-08 06:00:32,023 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2025-03-08 06:00:32,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:00:32,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:32,024 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] [2025-03-08 06:00:32,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:00:32,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:32,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:32,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1127338766, now seen corresponding path program 1 times [2025-03-08 06:00:32,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:32,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088236712] [2025-03-08 06:00:32,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:32,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:32,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:00:32,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:00:32,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:32,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:32,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:32,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:32,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088236712] [2025-03-08 06:00:32,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088236712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:32,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:32,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:00:32,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710766585] [2025-03-08 06:00:32,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:32,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:00:32,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:32,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:00:32,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:00:32,254 INFO L87 Difference]: Start difference. First operand 100 states and 139 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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-03-08 06:00:32,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:32,302 INFO L93 Difference]: Finished difference Result 216 states and 327 transitions. [2025-03-08 06:00:32,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:00:32,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-08 06:00:32,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:32,307 INFO L225 Difference]: With dead ends: 216 [2025-03-08 06:00:32,307 INFO L226 Difference]: Without dead ends: 154 [2025-03-08 06:00:32,307 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-03-08 06:00:32,308 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 85 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:32,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 304 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:00:32,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-08 06:00:32,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2025-03-08 06:00:32,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.4834437086092715) internal successors, (224), 151 states have internal predecessors, (224), 0 states have call successors, (0), 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-03-08 06:00:32,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 224 transitions. [2025-03-08 06:00:32,360 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 224 transitions. Word has length 64 [2025-03-08 06:00:32,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:32,360 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 224 transitions. [2025-03-08 06:00:32,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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-03-08 06:00:32,360 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 224 transitions. [2025-03-08 06:00:32,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:00:32,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:32,361 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] [2025-03-08 06:00:32,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:00:32,361 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:32,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:32,362 INFO L85 PathProgramCache]: Analyzing trace with hash -940490081, now seen corresponding path program 1 times [2025-03-08 06:00:32,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:32,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801695434] [2025-03-08 06:00:32,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:32,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:32,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:00:32,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:00:32,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:32,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:32,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:32,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:32,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801695434] [2025-03-08 06:00:32,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801695434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:32,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:32,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:00:32,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587180358] [2025-03-08 06:00:32,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:32,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:00:32,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:32,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:00:32,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:00:32,559 INFO L87 Difference]: Start difference. First operand 152 states and 224 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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-03-08 06:00:32,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:32,604 INFO L93 Difference]: Finished difference Result 364 states and 568 transitions. [2025-03-08 06:00:32,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:00:32,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-08 06:00:32,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:32,607 INFO L225 Difference]: With dead ends: 364 [2025-03-08 06:00:32,610 INFO L226 Difference]: Without dead ends: 250 [2025-03-08 06:00:32,611 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-03-08 06:00:32,612 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 81 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:32,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 301 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:00:32,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-08 06:00:32,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2025-03-08 06:00:32,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.534412955465587) internal successors, (379), 247 states have internal predecessors, (379), 0 states have call successors, (0), 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-03-08 06:00:32,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 379 transitions. [2025-03-08 06:00:32,643 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 379 transitions. Word has length 64 [2025-03-08 06:00:32,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:32,644 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 379 transitions. [2025-03-08 06:00:32,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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-03-08 06:00:32,644 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 379 transitions. [2025-03-08 06:00:32,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:00:32,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:32,648 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] [2025-03-08 06:00:32,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:00:32,648 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:32,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:32,649 INFO L85 PathProgramCache]: Analyzing trace with hash -751552820, now seen corresponding path program 1 times [2025-03-08 06:00:32,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:32,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126963098] [2025-03-08 06:00:32,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:32,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:32,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:00:32,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:00:32,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:32,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:32,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:32,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:32,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126963098] [2025-03-08 06:00:32,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126963098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:32,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:32,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:00:32,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788302073] [2025-03-08 06:00:32,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:32,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:00:32,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:32,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:00:32,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:00:32,967 INFO L87 Difference]: Start difference. First operand 248 states and 379 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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-03-08 06:00:33,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:33,229 INFO L93 Difference]: Finished difference Result 1508 states and 2425 transitions. [2025-03-08 06:00:33,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:00:33,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-08 06:00:33,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:33,242 INFO L225 Difference]: With dead ends: 1508 [2025-03-08 06:00:33,247 INFO L226 Difference]: Without dead ends: 1298 [2025-03-08 06:00:33,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:00:33,254 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1399 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:33,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1399 Valid, 980 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:00:33,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2025-03-08 06:00:33,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 456. [2025-03-08 06:00:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 1.5626373626373626) internal successors, (711), 455 states have internal predecessors, (711), 0 states have call successors, (0), 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-03-08 06:00:33,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 711 transitions. [2025-03-08 06:00:33,325 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 711 transitions. Word has length 64 [2025-03-08 06:00:33,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:33,326 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 711 transitions. [2025-03-08 06:00:33,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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-03-08 06:00:33,327 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 711 transitions. [2025-03-08 06:00:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 06:00:33,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:33,332 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] [2025-03-08 06:00:33,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:00:33,332 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:33,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:33,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1793686728, now seen corresponding path program 1 times [2025-03-08 06:00:33,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:33,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004629734] [2025-03-08 06:00:33,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:33,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:33,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 06:00:33,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 06:00:33,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:33,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:33,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:33,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:33,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004629734] [2025-03-08 06:00:33,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004629734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:33,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:33,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:00:33,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74514575] [2025-03-08 06:00:33,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:33,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:00:33,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:33,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:00:33,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:00:33,843 INFO L87 Difference]: Start difference. First operand 456 states and 711 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 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-03-08 06:00:33,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:33,893 INFO L93 Difference]: Finished difference Result 482 states and 744 transitions. [2025-03-08 06:00:33,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:00:33,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-08 06:00:33,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:33,896 INFO L225 Difference]: With dead ends: 482 [2025-03-08 06:00:33,896 INFO L226 Difference]: Without dead ends: 480 [2025-03-08 06:00:33,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:00:33,897 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:33,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 536 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:00:33,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-08 06:00:33,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-03-08 06:00:33,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 1.534446764091858) internal successors, (735), 479 states have internal predecessors, (735), 0 states have call successors, (0), 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-03-08 06:00:33,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 735 transitions. [2025-03-08 06:00:33,938 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 735 transitions. Word has length 65 [2025-03-08 06:00:33,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:33,938 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 735 transitions. [2025-03-08 06:00:33,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 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-03-08 06:00:33,938 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 735 transitions. [2025-03-08 06:00:33,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:00:33,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:33,941 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] [2025-03-08 06:00:33,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:00:33,942 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:33,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:33,942 INFO L85 PathProgramCache]: Analyzing trace with hash 319005836, now seen corresponding path program 1 times [2025-03-08 06:00:33,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:33,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844527157] [2025-03-08 06:00:33,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:33,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:33,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:00:33,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:00:33,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:33,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:34,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:34,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:34,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844527157] [2025-03-08 06:00:34,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844527157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:34,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:34,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:00:34,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524044211] [2025-03-08 06:00:34,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:34,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:00:34,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:34,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:00:34,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:00:34,104 INFO L87 Difference]: Start difference. First operand 480 states and 735 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-03-08 06:00:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:34,177 INFO L93 Difference]: Finished difference Result 1304 states and 2029 transitions. [2025-03-08 06:00:34,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:00:34,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-03-08 06:00:34,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:34,185 INFO L225 Difference]: With dead ends: 1304 [2025-03-08 06:00:34,189 INFO L226 Difference]: Without dead ends: 862 [2025-03-08 06:00:34,190 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-03-08 06:00:34,191 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 65 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:34,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 232 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:00:34,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2025-03-08 06:00:34,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 852. [2025-03-08 06:00:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 851 states have (on average 1.535840188014101) internal successors, (1307), 851 states have internal predecessors, (1307), 0 states have call successors, (0), 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-03-08 06:00:34,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1307 transitions. [2025-03-08 06:00:34,256 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1307 transitions. Word has length 66 [2025-03-08 06:00:34,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:34,256 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1307 transitions. [2025-03-08 06:00:34,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-03-08 06:00:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1307 transitions. [2025-03-08 06:00:34,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:00:34,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:34,257 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] [2025-03-08 06:00:34,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:00:34,257 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:34,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:34,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1960253371, now seen corresponding path program 1 times [2025-03-08 06:00:34,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:34,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629106065] [2025-03-08 06:00:34,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:34,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:34,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:00:34,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:00:34,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:34,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:34,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:34,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:34,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629106065] [2025-03-08 06:00:34,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629106065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:34,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:34,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:00:34,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477167041] [2025-03-08 06:00:34,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:34,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:00:34,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:34,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:00:34,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:00:34,378 INFO L87 Difference]: Start difference. First operand 852 states and 1307 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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-03-08 06:00:34,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:34,446 INFO L93 Difference]: Finished difference Result 2352 states and 3621 transitions. [2025-03-08 06:00:34,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:00:34,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-03-08 06:00:34,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:34,456 INFO L225 Difference]: With dead ends: 2352 [2025-03-08 06:00:34,460 INFO L226 Difference]: Without dead ends: 1538 [2025-03-08 06:00:34,462 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-03-08 06:00:34,463 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 73 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:34,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 286 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:00:34,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2025-03-08 06:00:34,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1536. [2025-03-08 06:00:34,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1536 states, 1535 states have (on average 1.521172638436482) internal successors, (2335), 1535 states have internal predecessors, (2335), 0 states have call successors, (0), 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-03-08 06:00:34,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 2335 transitions. [2025-03-08 06:00:34,562 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 2335 transitions. Word has length 67 [2025-03-08 06:00:34,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:34,562 INFO L471 AbstractCegarLoop]: Abstraction has 1536 states and 2335 transitions. [2025-03-08 06:00:34,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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-03-08 06:00:34,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 2335 transitions. [2025-03-08 06:00:34,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:00:34,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:34,564 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] [2025-03-08 06:00:34,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:00:34,566 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:34,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:34,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1176038035, now seen corresponding path program 1 times [2025-03-08 06:00:34,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:34,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568587089] [2025-03-08 06:00:34,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:34,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:34,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:00:34,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:00:34,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:34,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:34,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:34,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:34,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568587089] [2025-03-08 06:00:34,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568587089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:34,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:34,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:00:34,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139713147] [2025-03-08 06:00:34,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:34,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:00:34,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:34,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:00:34,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:00:34,723 INFO L87 Difference]: Start difference. First operand 1536 states and 2335 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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-03-08 06:00:34,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:34,845 INFO L93 Difference]: Finished difference Result 4276 states and 6481 transitions. [2025-03-08 06:00:34,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:00:34,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-03-08 06:00:34,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:34,863 INFO L225 Difference]: With dead ends: 4276 [2025-03-08 06:00:34,866 INFO L226 Difference]: Without dead ends: 2778 [2025-03-08 06:00:34,871 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-03-08 06:00:34,876 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 77 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:34,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 299 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:00:34,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2025-03-08 06:00:35,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2776. [2025-03-08 06:00:35,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2776 states, 2775 states have (on average 1.495855855855856) internal successors, (4151), 2775 states have internal predecessors, (4151), 0 states have call successors, (0), 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-03-08 06:00:35,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2776 states to 2776 states and 4151 transitions. [2025-03-08 06:00:35,068 INFO L78 Accepts]: Start accepts. Automaton has 2776 states and 4151 transitions. Word has length 67 [2025-03-08 06:00:35,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:35,069 INFO L471 AbstractCegarLoop]: Abstraction has 2776 states and 4151 transitions. [2025-03-08 06:00:35,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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-03-08 06:00:35,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2776 states and 4151 transitions. [2025-03-08 06:00:35,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 06:00:35,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:35,071 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] [2025-03-08 06:00:35,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:00:35,071 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:35,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:35,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1485654306, now seen corresponding path program 1 times [2025-03-08 06:00:35,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:35,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400066338] [2025-03-08 06:00:35,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:35,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:35,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:00:35,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:00:35,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:35,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:35,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:35,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400066338] [2025-03-08 06:00:35,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400066338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:35,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:35,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:00:35,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157104639] [2025-03-08 06:00:35,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:35,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:00:35,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:35,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:00:35,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:00:35,192 INFO L87 Difference]: Start difference. First operand 2776 states and 4151 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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-03-08 06:00:35,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:35,388 INFO L93 Difference]: Finished difference Result 5471 states and 8221 transitions. [2025-03-08 06:00:35,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:00:35,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-03-08 06:00:35,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:35,419 INFO L225 Difference]: With dead ends: 5471 [2025-03-08 06:00:35,419 INFO L226 Difference]: Without dead ends: 3964 [2025-03-08 06:00:35,422 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-03-08 06:00:35,425 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 86 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:35,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 314 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:00:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3964 states. [2025-03-08 06:00:35,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3964 to 3962. [2025-03-08 06:00:35,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3962 states, 3961 states have (on average 1.484726079272911) internal successors, (5881), 3961 states have internal predecessors, (5881), 0 states have call successors, (0), 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-03-08 06:00:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 5881 transitions. [2025-03-08 06:00:35,656 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 5881 transitions. Word has length 68 [2025-03-08 06:00:35,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:35,656 INFO L471 AbstractCegarLoop]: Abstraction has 3962 states and 5881 transitions. [2025-03-08 06:00:35,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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-03-08 06:00:35,656 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 5881 transitions. [2025-03-08 06:00:35,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:00:35,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:35,664 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:00:35,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:00:35,664 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:35,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:35,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1194092312, now seen corresponding path program 1 times [2025-03-08 06:00:35,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:35,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262691677] [2025-03-08 06:00:35,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:35,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:35,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:00:35,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:00:35,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:35,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:36,049 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 06:00:36,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:36,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262691677] [2025-03-08 06:00:36,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262691677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:36,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:36,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:00:36,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487219688] [2025-03-08 06:00:36,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:36,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:00:36,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:36,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:00:36,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:00:36,051 INFO L87 Difference]: Start difference. First operand 3962 states and 5881 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 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-03-08 06:00:36,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:36,589 INFO L93 Difference]: Finished difference Result 13206 states and 19839 transitions. [2025-03-08 06:00:36,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:00:36,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 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 94 [2025-03-08 06:00:36,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:36,667 INFO L225 Difference]: With dead ends: 13206 [2025-03-08 06:00:36,668 INFO L226 Difference]: Without dead ends: 11220 [2025-03-08 06:00:36,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:00:36,679 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 892 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:36,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 1076 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:00:36,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11220 states. [2025-03-08 06:00:37,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11220 to 5898. [2025-03-08 06:00:37,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5898 states, 5897 states have (on average 1.4856706800067832) internal successors, (8761), 5897 states have internal predecessors, (8761), 0 states have call successors, (0), 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-03-08 06:00:37,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5898 states to 5898 states and 8761 transitions. [2025-03-08 06:00:37,141 INFO L78 Accepts]: Start accepts. Automaton has 5898 states and 8761 transitions. Word has length 94 [2025-03-08 06:00:37,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:37,144 INFO L471 AbstractCegarLoop]: Abstraction has 5898 states and 8761 transitions. [2025-03-08 06:00:37,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 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-03-08 06:00:37,145 INFO L276 IsEmpty]: Start isEmpty. Operand 5898 states and 8761 transitions. [2025-03-08 06:00:37,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:00:37,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:37,153 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:00:37,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:00:37,153 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:37,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:37,154 INFO L85 PathProgramCache]: Analyzing trace with hash 999770516, now seen corresponding path program 1 times [2025-03-08 06:00:37,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:37,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430304006] [2025-03-08 06:00:37,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:37,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:37,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:00:37,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:00:37,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:37,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 06:00:37,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:37,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430304006] [2025-03-08 06:00:37,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430304006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:37,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:37,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:00:37,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897268814] [2025-03-08 06:00:37,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:37,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:00:37,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:37,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:00:37,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:00:37,545 INFO L87 Difference]: Start difference. First operand 5898 states and 8761 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-03-08 06:00:38,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:38,185 INFO L93 Difference]: Finished difference Result 15142 states and 22719 transitions. [2025-03-08 06:00:38,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:00:38,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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 94 [2025-03-08 06:00:38,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:38,257 INFO L225 Difference]: With dead ends: 15142 [2025-03-08 06:00:38,257 INFO L226 Difference]: Without dead ends: 13156 [2025-03-08 06:00:38,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:00:38,269 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 962 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:38,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 955 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:00:38,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13156 states. [2025-03-08 06:00:38,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13156 to 7834. [2025-03-08 06:00:38,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7834 states, 7833 states have (on average 1.486148346738159) internal successors, (11641), 7833 states have internal predecessors, (11641), 0 states have call successors, (0), 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-03-08 06:00:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7834 states to 7834 states and 11641 transitions. [2025-03-08 06:00:38,847 INFO L78 Accepts]: Start accepts. Automaton has 7834 states and 11641 transitions. Word has length 94 [2025-03-08 06:00:38,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:38,847 INFO L471 AbstractCegarLoop]: Abstraction has 7834 states and 11641 transitions. [2025-03-08 06:00:38,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 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-03-08 06:00:38,848 INFO L276 IsEmpty]: Start isEmpty. Operand 7834 states and 11641 transitions. [2025-03-08 06:00:38,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:00:38,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:38,855 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:00:38,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:00:38,856 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:38,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:38,856 INFO L85 PathProgramCache]: Analyzing trace with hash 415243077, now seen corresponding path program 1 times [2025-03-08 06:00:38,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:38,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017862471] [2025-03-08 06:00:38,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:38,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:38,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:00:38,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:00:38,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:38,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:00:39,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:39,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017862471] [2025-03-08 06:00:39,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017862471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:39,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:39,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:00:39,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29757319] [2025-03-08 06:00:39,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:39,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:00:39,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:39,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:00:39,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:00:39,144 INFO L87 Difference]: Start difference. First operand 7834 states and 11641 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:39,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:39,714 INFO L93 Difference]: Finished difference Result 17078 states and 25599 transitions. [2025-03-08 06:00:39,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:00:39,715 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-08 06:00:39,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:39,775 INFO L225 Difference]: With dead ends: 17078 [2025-03-08 06:00:39,778 INFO L226 Difference]: Without dead ends: 15092 [2025-03-08 06:00:39,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:00:39,787 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 918 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:39,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 988 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:00:39,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15092 states. [2025-03-08 06:00:40,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15092 to 9770. [2025-03-08 06:00:40,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9770 states, 9769 states have (on average 1.4864366874808066) internal successors, (14521), 9769 states have internal predecessors, (14521), 0 states have call successors, (0), 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-03-08 06:00:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9770 states to 9770 states and 14521 transitions. [2025-03-08 06:00:40,407 INFO L78 Accepts]: Start accepts. Automaton has 9770 states and 14521 transitions. Word has length 94 [2025-03-08 06:00:40,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:40,411 INFO L471 AbstractCegarLoop]: Abstraction has 9770 states and 14521 transitions. [2025-03-08 06:00:40,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:40,411 INFO L276 IsEmpty]: Start isEmpty. Operand 9770 states and 14521 transitions. [2025-03-08 06:00:40,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:00:40,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:40,420 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:00:40,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:00:40,420 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:40,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:40,420 INFO L85 PathProgramCache]: Analyzing trace with hash -743432813, now seen corresponding path program 1 times [2025-03-08 06:00:40,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:40,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295918339] [2025-03-08 06:00:40,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:40,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:40,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:00:40,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:00:40,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:40,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 06:00:40,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:40,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295918339] [2025-03-08 06:00:40,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295918339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:40,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:40,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:00:40,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050134391] [2025-03-08 06:00:40,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:40,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:00:40,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:40,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:00:40,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:00:40,796 INFO L87 Difference]: Start difference. First operand 9770 states and 14521 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 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-03-08 06:00:41,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:41,497 INFO L93 Difference]: Finished difference Result 19014 states and 28479 transitions. [2025-03-08 06:00:41,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:00:41,499 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 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 94 [2025-03-08 06:00:41,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:41,570 INFO L225 Difference]: With dead ends: 19014 [2025-03-08 06:00:41,574 INFO L226 Difference]: Without dead ends: 17028 [2025-03-08 06:00:41,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:00:41,597 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 823 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:41,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 1085 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:00:41,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17028 states. [2025-03-08 06:00:42,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17028 to 11706. [2025-03-08 06:00:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11706 states, 11705 states have (on average 1.486629645450662) internal successors, (17401), 11705 states have internal predecessors, (17401), 0 states have call successors, (0), 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-03-08 06:00:42,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11706 states to 11706 states and 17401 transitions. [2025-03-08 06:00:42,268 INFO L78 Accepts]: Start accepts. Automaton has 11706 states and 17401 transitions. Word has length 94 [2025-03-08 06:00:42,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:42,269 INFO L471 AbstractCegarLoop]: Abstraction has 11706 states and 17401 transitions. [2025-03-08 06:00:42,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 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-03-08 06:00:42,269 INFO L276 IsEmpty]: Start isEmpty. Operand 11706 states and 17401 transitions. [2025-03-08 06:00:42,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:00:42,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:42,280 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:00:42,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:00:42,280 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:42,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:42,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1728776098, now seen corresponding path program 1 times [2025-03-08 06:00:42,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:42,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913735253] [2025-03-08 06:00:42,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:42,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:42,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:00:42,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:00:42,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:42,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:42,496 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:42,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:42,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913735253] [2025-03-08 06:00:42,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913735253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:42,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:42,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:00:42,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427639336] [2025-03-08 06:00:42,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:42,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:00:42,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:42,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:00:42,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:00:42,502 INFO L87 Difference]: Start difference. First operand 11706 states and 17401 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:42,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:42,704 INFO L93 Difference]: Finished difference Result 23374 states and 34763 transitions. [2025-03-08 06:00:42,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:00:42,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:00:42,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:42,728 INFO L225 Difference]: With dead ends: 23374 [2025-03-08 06:00:42,729 INFO L226 Difference]: Without dead ends: 11708 [2025-03-08 06:00:42,744 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-03-08 06:00:42,744 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 68 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:42,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 300 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:00:42,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11708 states. [2025-03-08 06:00:43,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11708 to 11706. [2025-03-08 06:00:43,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11706 states, 11705 states have (on average 1.4743272105937633) internal successors, (17257), 11705 states have internal predecessors, (17257), 0 states have call successors, (0), 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-03-08 06:00:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11706 states to 11706 states and 17257 transitions. [2025-03-08 06:00:43,215 INFO L78 Accepts]: Start accepts. Automaton has 11706 states and 17257 transitions. Word has length 95 [2025-03-08 06:00:43,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:43,216 INFO L471 AbstractCegarLoop]: Abstraction has 11706 states and 17257 transitions. [2025-03-08 06:00:43,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:43,216 INFO L276 IsEmpty]: Start isEmpty. Operand 11706 states and 17257 transitions. [2025-03-08 06:00:43,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:00:43,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:43,223 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:00:43,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:00:43,224 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:43,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:43,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1429138485, now seen corresponding path program 1 times [2025-03-08 06:00:43,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:43,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868946268] [2025-03-08 06:00:43,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:43,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:43,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:00:43,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:00:43,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:43,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:43,430 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:43,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:43,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868946268] [2025-03-08 06:00:43,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868946268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:43,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:43,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:00:43,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784047721] [2025-03-08 06:00:43,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:43,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:00:43,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:43,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:00:43,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:00:43,435 INFO L87 Difference]: Start difference. First operand 11706 states and 17257 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:43,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:43,597 INFO L93 Difference]: Finished difference Result 17542 states and 25867 transitions. [2025-03-08 06:00:43,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:00:43,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:00:43,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:43,621 INFO L225 Difference]: With dead ends: 17542 [2025-03-08 06:00:43,622 INFO L226 Difference]: Without dead ends: 5876 [2025-03-08 06:00:43,647 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-03-08 06:00:43,648 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 62 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:43,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 281 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:00:43,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5876 states. [2025-03-08 06:00:43,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5876 to 5874. [2025-03-08 06:00:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5874 states, 5873 states have (on average 1.4604120551677167) internal successors, (8577), 5873 states have internal predecessors, (8577), 0 states have call successors, (0), 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-03-08 06:00:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5874 states to 5874 states and 8577 transitions. [2025-03-08 06:00:43,952 INFO L78 Accepts]: Start accepts. Automaton has 5874 states and 8577 transitions. Word has length 95 [2025-03-08 06:00:43,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:43,953 INFO L471 AbstractCegarLoop]: Abstraction has 5874 states and 8577 transitions. [2025-03-08 06:00:43,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:43,953 INFO L276 IsEmpty]: Start isEmpty. Operand 5874 states and 8577 transitions. [2025-03-08 06:00:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:00:43,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:43,959 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:00:43,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:00:43,959 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:43,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:43,960 INFO L85 PathProgramCache]: Analyzing trace with hash 810160712, now seen corresponding path program 1 times [2025-03-08 06:00:43,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:43,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239311017] [2025-03-08 06:00:43,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:43,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:43,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:00:44,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:00:44,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:44,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:46,201 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:46,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:46,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239311017] [2025-03-08 06:00:46,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239311017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:00:46,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356100473] [2025-03-08 06:00:46,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:46,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:00:46,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:00:46,208 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:00:46,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:00:46,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:00:46,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:00:46,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:46,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:46,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 06:00:46,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:00:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:47,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:00:48,137 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:48,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356100473] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:00:48,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:00:48,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2025-03-08 06:00:48,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257738344] [2025-03-08 06:00:48,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:00:48,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 06:00:48,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:48,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 06:00:48,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2025-03-08 06:00:48,140 INFO L87 Difference]: Start difference. First operand 5874 states and 8577 transitions. Second operand has 26 states, 26 states have (on average 9.153846153846153) internal successors, (238), 25 states have internal predecessors, (238), 0 states have call successors, (0), 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-03-08 06:00:49,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:49,381 INFO L93 Difference]: Finished difference Result 25608 states and 37868 transitions. [2025-03-08 06:00:49,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 06:00:49,381 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.153846153846153) internal successors, (238), 25 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:00:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:49,415 INFO L225 Difference]: With dead ends: 25608 [2025-03-08 06:00:49,415 INFO L226 Difference]: Without dead ends: 19774 [2025-03-08 06:00:49,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=416, Invalid=1390, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 06:00:49,428 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 2654 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2654 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:49,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2654 Valid, 1655 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:00:49,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19774 states. [2025-03-08 06:00:49,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19774 to 12534. [2025-03-08 06:00:49,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12534 states, 12533 states have (on average 1.4557568020426075) internal successors, (18245), 12533 states have internal predecessors, (18245), 0 states have call successors, (0), 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-03-08 06:00:49,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12534 states to 12534 states and 18245 transitions. [2025-03-08 06:00:49,689 INFO L78 Accepts]: Start accepts. Automaton has 12534 states and 18245 transitions. Word has length 95 [2025-03-08 06:00:49,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:49,690 INFO L471 AbstractCegarLoop]: Abstraction has 12534 states and 18245 transitions. [2025-03-08 06:00:49,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.153846153846153) internal successors, (238), 25 states have internal predecessors, (238), 0 states have call successors, (0), 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-03-08 06:00:49,690 INFO L276 IsEmpty]: Start isEmpty. Operand 12534 states and 18245 transitions. [2025-03-08 06:00:49,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 06:00:49,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:49,693 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:00:49,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 06:00:49,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 06:00:49,894 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:49,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:49,894 INFO L85 PathProgramCache]: Analyzing trace with hash -16879435, now seen corresponding path program 1 times [2025-03-08 06:00:49,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:49,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631368906] [2025-03-08 06:00:49,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:49,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:49,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 06:00:49,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 06:00:49,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:49,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:50,000 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:50,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:50,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631368906] [2025-03-08 06:00:50,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631368906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:50,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:50,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:00:50,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106597324] [2025-03-08 06:00:50,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:50,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:00:50,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:50,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:00:50,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:00:50,003 INFO L87 Difference]: Start difference. First operand 12534 states and 18245 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:50,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:50,090 INFO L93 Difference]: Finished difference Result 18736 states and 27253 transitions. [2025-03-08 06:00:50,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:00:50,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-08 06:00:50,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:50,102 INFO L225 Difference]: With dead ends: 18736 [2025-03-08 06:00:50,103 INFO L226 Difference]: Without dead ends: 6242 [2025-03-08 06:00:50,113 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-03-08 06:00:50,113 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 48 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:50,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 274 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:00:50,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6242 states. [2025-03-08 06:00:50,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6242 to 6096. [2025-03-08 06:00:50,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6096 states, 6095 states have (on average 1.4351107465135358) internal successors, (8747), 6095 states have internal predecessors, (8747), 0 states have call successors, (0), 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-03-08 06:00:50,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6096 states to 6096 states and 8747 transitions. [2025-03-08 06:00:50,246 INFO L78 Accepts]: Start accepts. Automaton has 6096 states and 8747 transitions. Word has length 95 [2025-03-08 06:00:50,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:50,246 INFO L471 AbstractCegarLoop]: Abstraction has 6096 states and 8747 transitions. [2025-03-08 06:00:50,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:50,246 INFO L276 IsEmpty]: Start isEmpty. Operand 6096 states and 8747 transitions. [2025-03-08 06:00:50,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:00:50,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:50,248 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:00:50,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:00:50,248 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:50,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:50,249 INFO L85 PathProgramCache]: Analyzing trace with hash 192831607, now seen corresponding path program 1 times [2025-03-08 06:00:50,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:50,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538139106] [2025-03-08 06:00:50,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:50,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:50,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:00:50,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:00:50,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:50,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:50,301 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:50,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:50,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538139106] [2025-03-08 06:00:50,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538139106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:50,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:50,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:00:50,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105017936] [2025-03-08 06:00:50,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:50,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:00:50,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:50,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:00:50,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:00:50,303 INFO L87 Difference]: Start difference. First operand 6096 states and 8747 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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-03-08 06:00:50,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:50,404 INFO L93 Difference]: Finished difference Result 17018 states and 24347 transitions. [2025-03-08 06:00:50,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:00:50,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-08 06:00:50,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:50,425 INFO L225 Difference]: With dead ends: 17018 [2025-03-08 06:00:50,425 INFO L226 Difference]: Without dead ends: 10962 [2025-03-08 06:00:50,433 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-03-08 06:00:50,433 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 67 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:50,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 275 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:00:50,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10962 states. [2025-03-08 06:00:50,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10962 to 10960. [2025-03-08 06:00:50,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10960 states, 10959 states have (on average 1.4139063783191896) internal successors, (15495), 10959 states have internal predecessors, (15495), 0 states have call successors, (0), 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-03-08 06:00:50,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10960 states to 10960 states and 15495 transitions. [2025-03-08 06:00:50,623 INFO L78 Accepts]: Start accepts. Automaton has 10960 states and 15495 transitions. Word has length 96 [2025-03-08 06:00:50,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:50,623 INFO L471 AbstractCegarLoop]: Abstraction has 10960 states and 15495 transitions. [2025-03-08 06:00:50,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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-03-08 06:00:50,624 INFO L276 IsEmpty]: Start isEmpty. Operand 10960 states and 15495 transitions. [2025-03-08 06:00:50,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:00:50,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:50,628 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:00:50,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:00:50,628 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:50,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:50,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1533956403, now seen corresponding path program 1 times [2025-03-08 06:00:50,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:50,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586282479] [2025-03-08 06:00:50,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:50,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:50,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:00:50,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:00:50,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:50,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:51,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:51,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586282479] [2025-03-08 06:00:51,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586282479] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:00:51,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482546121] [2025-03-08 06:00:51,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:51,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:00:51,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:00:51,433 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:00:51,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:00:51,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:00:51,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:00:51,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:51,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:51,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 06:00:51,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:00:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:52,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:00:52,784 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:52,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482546121] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:00:52,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:00:52,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 9] total 25 [2025-03-08 06:00:52,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544672401] [2025-03-08 06:00:52,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:00:52,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 06:00:52,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:52,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 06:00:52,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:00:52,786 INFO L87 Difference]: Start difference. First operand 10960 states and 15495 transitions. Second operand has 25 states, 25 states have (on average 11.24) internal successors, (281), 25 states have internal predecessors, (281), 0 states have call successors, (0), 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-03-08 06:01:07,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:07,544 INFO L93 Difference]: Finished difference Result 149794 states and 209540 transitions. [2025-03-08 06:01:07,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2025-03-08 06:01:07,544 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 11.24) internal successors, (281), 25 states have internal predecessors, (281), 0 states have call successors, (0), 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 96 [2025-03-08 06:01:07,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:08,193 INFO L225 Difference]: With dead ends: 149794 [2025-03-08 06:01:08,193 INFO L226 Difference]: Without dead ends: 141330 [2025-03-08 06:01:08,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20637 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=5948, Invalid=43558, Unknown=0, NotChecked=0, Total=49506 [2025-03-08 06:01:08,291 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 7370 mSDsluCounter, 2224 mSDsCounter, 0 mSdLazyCounter, 2589 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7370 SdHoareTripleChecker+Valid, 2385 SdHoareTripleChecker+Invalid, 2713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 2589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:08,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7370 Valid, 2385 Invalid, 2713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 2589 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 06:01:08,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141330 states. [2025-03-08 06:01:12,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141330 to 120098. [2025-03-08 06:01:12,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120098 states, 120097 states have (on average 1.3788021349409227) internal successors, (165590), 120097 states have internal predecessors, (165590), 0 states have call successors, (0), 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-03-08 06:01:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120098 states to 120098 states and 165590 transitions. [2025-03-08 06:01:13,330 INFO L78 Accepts]: Start accepts. Automaton has 120098 states and 165590 transitions. Word has length 96 [2025-03-08 06:01:13,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:13,334 INFO L471 AbstractCegarLoop]: Abstraction has 120098 states and 165590 transitions. [2025-03-08 06:01:13,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.24) internal successors, (281), 25 states have internal predecessors, (281), 0 states have call successors, (0), 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-03-08 06:01:13,334 INFO L276 IsEmpty]: Start isEmpty. Operand 120098 states and 165590 transitions. [2025-03-08 06:01:13,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:01:13,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:13,342 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:01:13,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 06:01:13,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-08 06:01:13,543 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:13,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:13,544 INFO L85 PathProgramCache]: Analyzing trace with hash -616060130, now seen corresponding path program 1 times [2025-03-08 06:01:13,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:13,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975074107] [2025-03-08 06:01:13,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:13,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:13,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:01:13,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:01:13,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:13,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:13,719 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:13,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:13,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975074107] [2025-03-08 06:01:13,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975074107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:13,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:13,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:13,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66954312] [2025-03-08 06:01:13,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:13,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:13,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:13,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:13,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:13,726 INFO L87 Difference]: Start difference. First operand 120098 states and 165590 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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-03-08 06:01:15,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:15,904 INFO L93 Difference]: Finished difference Result 186140 states and 255328 transitions. [2025-03-08 06:01:15,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:15,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-08 06:01:15,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:16,041 INFO L225 Difference]: With dead ends: 186140 [2025-03-08 06:01:16,041 INFO L226 Difference]: Without dead ends: 66082 [2025-03-08 06:01:16,170 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-03-08 06:01:16,174 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 40 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:16,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 258 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:16,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66082 states. [2025-03-08 06:01:18,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66082 to 58028. [2025-03-08 06:01:18,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58028 states, 58027 states have (on average 1.350354145483999) internal successors, (78357), 58027 states have internal predecessors, (78357), 0 states have call successors, (0), 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-03-08 06:01:18,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58028 states to 58028 states and 78357 transitions. [2025-03-08 06:01:18,674 INFO L78 Accepts]: Start accepts. Automaton has 58028 states and 78357 transitions. Word has length 97 [2025-03-08 06:01:18,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:18,675 INFO L471 AbstractCegarLoop]: Abstraction has 58028 states and 78357 transitions. [2025-03-08 06:01:18,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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-03-08 06:01:18,675 INFO L276 IsEmpty]: Start isEmpty. Operand 58028 states and 78357 transitions. [2025-03-08 06:01:18,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:01:18,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:18,679 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:18,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:01:18,679 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:18,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:18,680 INFO L85 PathProgramCache]: Analyzing trace with hash 760153473, now seen corresponding path program 1 times [2025-03-08 06:01:18,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:18,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244048107] [2025-03-08 06:01:18,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:18,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:18,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:01:18,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:01:18,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:18,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:18,741 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:18,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:18,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244048107] [2025-03-08 06:01:18,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244048107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:18,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:18,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:01:18,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462746789] [2025-03-08 06:01:18,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:18,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:01:18,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:18,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:01:18,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:01:18,744 INFO L87 Difference]: Start difference. First operand 58028 states and 78357 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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-03-08 06:01:21,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:21,452 INFO L93 Difference]: Finished difference Result 158971 states and 214133 transitions. [2025-03-08 06:01:21,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:01:21,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-08 06:01:21,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:21,604 INFO L225 Difference]: With dead ends: 158971 [2025-03-08 06:01:21,605 INFO L226 Difference]: Without dead ends: 101389 [2025-03-08 06:01:21,651 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-03-08 06:01:21,659 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 63 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:21,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 328 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:01:21,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101389 states. [2025-03-08 06:01:24,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101389 to 101259. [2025-03-08 06:01:24,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101259 states, 101258 states have (on average 1.3354697900412806) internal successors, (135227), 101258 states have internal predecessors, (135227), 0 states have call successors, (0), 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-03-08 06:01:24,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101259 states to 101259 states and 135227 transitions. [2025-03-08 06:01:24,768 INFO L78 Accepts]: Start accepts. Automaton has 101259 states and 135227 transitions. Word has length 97 [2025-03-08 06:01:24,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:24,768 INFO L471 AbstractCegarLoop]: Abstraction has 101259 states and 135227 transitions. [2025-03-08 06:01:24,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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-03-08 06:01:24,769 INFO L276 IsEmpty]: Start isEmpty. Operand 101259 states and 135227 transitions. [2025-03-08 06:01:24,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:01:24,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:24,786 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:01:24,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:01:24,787 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:24,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:24,787 INFO L85 PathProgramCache]: Analyzing trace with hash 310699378, now seen corresponding path program 1 times [2025-03-08 06:01:24,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:24,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983713098] [2025-03-08 06:01:24,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:24,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:24,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:01:24,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:01:24,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:24,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:01:25,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:25,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983713098] [2025-03-08 06:01:25,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983713098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:01:25,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:01:25,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:01:25,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596844607] [2025-03-08 06:01:25,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:01:25,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:01:25,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:25,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:01:25,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:01:25,003 INFO L87 Difference]: Start difference. First operand 101259 states and 135227 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 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-03-08 06:01:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:28,960 INFO L93 Difference]: Finished difference Result 181342 states and 244011 transitions. [2025-03-08 06:01:28,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:01:28,960 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 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 98 [2025-03-08 06:01:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:29,176 INFO L225 Difference]: With dead ends: 181342 [2025-03-08 06:01:29,176 INFO L226 Difference]: Without dead ends: 163394 [2025-03-08 06:01:29,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:01:29,206 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 937 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:29,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 1200 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:01:29,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163394 states. [2025-03-08 06:01:32,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163394 to 118556. [2025-03-08 06:01:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118556 states, 118555 states have (on average 1.335506726835646) internal successors, (158331), 118555 states have internal predecessors, (158331), 0 states have call successors, (0), 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-03-08 06:01:33,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118556 states to 118556 states and 158331 transitions. [2025-03-08 06:01:33,176 INFO L78 Accepts]: Start accepts. Automaton has 118556 states and 158331 transitions. Word has length 98 [2025-03-08 06:01:33,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:01:33,176 INFO L471 AbstractCegarLoop]: Abstraction has 118556 states and 158331 transitions. [2025-03-08 06:01:33,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 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-03-08 06:01:33,177 INFO L276 IsEmpty]: Start isEmpty. Operand 118556 states and 158331 transitions. [2025-03-08 06:01:33,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:01:33,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:01:33,185 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:01:33,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:01:33,189 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:01:33,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:01:33,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1323335756, now seen corresponding path program 1 times [2025-03-08 06:01:33,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:01:33,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809757296] [2025-03-08 06:01:33,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:33,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:01:33,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:01:33,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:01:33,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:33,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:33,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:01:33,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809757296] [2025-03-08 06:01:33,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809757296] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:01:33,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976559605] [2025-03-08 06:01:33,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:01:33,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:01:33,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:01:33,858 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:01:33,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 06:01:34,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:01:34,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:01:34,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:01:34,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:01:34,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 06:01:34,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:01:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:34,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:01:36,157 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:01:36,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976559605] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:01:36,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:01:36,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-08 06:01:36,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675606855] [2025-03-08 06:01:36,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:01:36,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 06:01:36,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:01:36,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 06:01:36,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:01:36,161 INFO L87 Difference]: Start difference. First operand 118556 states and 158331 transitions. Second operand has 21 states, 21 states have (on average 10.666666666666666) internal successors, (224), 20 states have internal predecessors, (224), 0 states have call successors, (0), 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-03-08 06:01:42,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:01:42,139 INFO L93 Difference]: Finished difference Result 445640 states and 602343 transitions. [2025-03-08 06:01:42,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:01:42,139 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.666666666666666) internal successors, (224), 20 states have internal predecessors, (224), 0 states have call successors, (0), 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 99 [2025-03-08 06:01:42,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:01:42,788 INFO L225 Difference]: With dead ends: 445640 [2025-03-08 06:01:42,789 INFO L226 Difference]: Without dead ends: 337484 [2025-03-08 06:01:42,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=338, Invalid=922, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 06:01:42,862 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1217 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:01:42,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 762 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:01:43,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337484 states.