./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_floodmax.3.2.ufo.BOUNDED-6.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 708f088db085ec098a8544d76f8abbece9dbe61a183e0bc1703749c9af891b6b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:05:52,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:05:52,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:05:52,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:05:52,675 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:05:52,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:05:52,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:05:52,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:05:52,697 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:05:52,697 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:05:52,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:05:52,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:05:52,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:05:52,698 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:05:52,699 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:05:52,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:05:52,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:05:52,699 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:05:52,699 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:05:52,699 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:05:52,699 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:05:52,699 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:05:52,699 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:05:52,699 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:05:52,699 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:05:52,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:05:52,699 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:05:52,699 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:05:52,700 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:05:52,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:05:52,700 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:05:52,700 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:05:52,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:05:52,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:05:52,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:05:52,700 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:05:52,700 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:05:52,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:05:52,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:05:52,700 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:05:52,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:05:52,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:05:52,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:05:52,700 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 -> 708f088db085ec098a8544d76f8abbece9dbe61a183e0bc1703749c9af891b6b [2025-03-16 19:05:52,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:05:52,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:05:52,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:05:52,906 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:05:52,906 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:05:52,907 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2025-03-16 19:05:53,993 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a9ee08ed/8679c3d1394a4735a1ecd43fd28b4b7b/FLAGa2e8a999b [2025-03-16 19:05:54,256 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:05:54,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2025-03-16 19:05:54,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a9ee08ed/8679c3d1394a4735a1ecd43fd28b4b7b/FLAGa2e8a999b [2025-03-16 19:05:54,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a9ee08ed/8679c3d1394a4735a1ecd43fd28b4b7b [2025-03-16 19:05:54,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:05:54,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:05:54,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:05:54,551 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:05:54,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:05:54,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:05:54" (1/1) ... [2025-03-16 19:05:54,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154be36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:54, skipping insertion in model container [2025-03-16 19:05:54,555 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:05:54" (1/1) ... [2025-03-16 19:05:54,569 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:05:54,698 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_floodmax.3.2.ufo.BOUNDED-6.pals.c[12764,12777] [2025-03-16 19:05:54,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:05:54,715 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:05:54,758 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_floodmax.3.2.ufo.BOUNDED-6.pals.c[12764,12777] [2025-03-16 19:05:54,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:05:54,772 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:05:54,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:54 WrapperNode [2025-03-16 19:05:54,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:05:54,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:05:54,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:05:54,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:05:54,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:54" (1/1) ... [2025-03-16 19:05:54,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:54" (1/1) ... [2025-03-16 19:05:54,812 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 449 [2025-03-16 19:05:54,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:05:54,813 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:05:54,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:05:54,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:05:54,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:54" (1/1) ... [2025-03-16 19:05:54,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:54" (1/1) ... [2025-03-16 19:05:54,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:54" (1/1) ... [2025-03-16 19:05:54,835 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-16 19:05:54,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:54" (1/1) ... [2025-03-16 19:05:54,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:54" (1/1) ... [2025-03-16 19:05:54,841 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:54" (1/1) ... [2025-03-16 19:05:54,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:54" (1/1) ... [2025-03-16 19:05:54,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:54" (1/1) ... [2025-03-16 19:05:54,850 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:54" (1/1) ... [2025-03-16 19:05:54,852 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:05:54,853 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:05:54,853 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:05:54,853 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:05:54,854 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:54" (1/1) ... [2025-03-16 19:05:54,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:05:54,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:54,880 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-16 19:05:54,883 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-16 19:05:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:05:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:05:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:05:54,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:05:54,982 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:05:54,984 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:05:55,338 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-03-16 19:05:55,338 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:05:55,347 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:05:55,348 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:05:55,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:05:55 BoogieIcfgContainer [2025-03-16 19:05:55,348 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:05:55,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:05:55,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:05:55,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:05:55,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:05:54" (1/3) ... [2025-03-16 19:05:55,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c23a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:05:55, skipping insertion in model container [2025-03-16 19:05:55,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:54" (2/3) ... [2025-03-16 19:05:55,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c23a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:05:55, skipping insertion in model container [2025-03-16 19:05:55,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:05:55" (3/3) ... [2025-03-16 19:05:55,357 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2025-03-16 19:05:55,367 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:05:55,370 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c that has 1 procedures, 114 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 19:05:55,415 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:05:55,424 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;@1ed8bafa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:05:55,424 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:05:55,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 112 states have (on average 1.8125) internal successors, (203), 113 states have internal predecessors, (203), 0 states have call successors, (0), 0 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-16 19:05:55,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 19:05:55,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:55,433 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] [2025-03-16 19:05:55,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:55,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:55,436 INFO L85 PathProgramCache]: Analyzing trace with hash -2098460883, now seen corresponding path program 1 times [2025-03-16 19:05:55,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:55,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233099860] [2025-03-16 19:05:55,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:55,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:55,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 19:05:55,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 19:05:55,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:55,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:55,683 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-16 19:05:55,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:55,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233099860] [2025-03-16 19:05:55,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233099860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:55,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:55,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:05:55,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355369288] [2025-03-16 19:05:55,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:55,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 19:05:55,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:55,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 19:05:55,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:05:55,700 INFO L87 Difference]: Start difference. First operand has 114 states, 112 states have (on average 1.8125) internal successors, (203), 113 states have internal predecessors, (203), 0 states have call successors, (0), 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 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-16 19:05:55,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:55,715 INFO L93 Difference]: Finished difference Result 174 states and 306 transitions. [2025-03-16 19:05:55,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 19:05:55,716 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-16 19:05:55,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:55,721 INFO L225 Difference]: With dead ends: 174 [2025-03-16 19:05:55,721 INFO L226 Difference]: Without dead ends: 112 [2025-03-16 19:05:55,723 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-16 19:05:55,724 INFO L435 NwaCegarLoop]: 201 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, 201 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-16 19:05:55,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:55,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-16 19:05:55,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-16 19:05:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.7927927927927927) internal successors, (199), 111 states have internal predecessors, (199), 0 states have call successors, (0), 0 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-16 19:05:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 199 transitions. [2025-03-16 19:05:55,750 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 199 transitions. Word has length 34 [2025-03-16 19:05:55,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:55,750 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 199 transitions. [2025-03-16 19:05:55,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-16 19:05:55,750 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 199 transitions. [2025-03-16 19:05:55,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 19:05:55,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:55,751 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] [2025-03-16 19:05:55,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:05:55,752 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:55,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:55,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1352034542, now seen corresponding path program 1 times [2025-03-16 19:05:55,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:55,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126502390] [2025-03-16 19:05:55,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:55,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:55,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 19:05:55,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 19:05:55,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:55,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:56,047 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-16 19:05:56,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:56,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126502390] [2025-03-16 19:05:56,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126502390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:56,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:56,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:56,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478508717] [2025-03-16 19:05:56,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:56,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:56,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:56,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:56,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:56,049 INFO L87 Difference]: Start difference. First operand 112 states and 199 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-16 19:05:56,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:56,147 INFO L93 Difference]: Finished difference Result 229 states and 400 transitions. [2025-03-16 19:05:56,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:56,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-16 19:05:56,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:56,148 INFO L225 Difference]: With dead ends: 229 [2025-03-16 19:05:56,148 INFO L226 Difference]: Without dead ends: 169 [2025-03-16 19:05:56,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:56,149 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 98 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:56,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 556 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:05:56,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-16 19:05:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 112. [2025-03-16 19:05:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.5495495495495495) internal successors, (172), 111 states have internal predecessors, (172), 0 states have call successors, (0), 0 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-16 19:05:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 172 transitions. [2025-03-16 19:05:56,159 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 172 transitions. Word has length 34 [2025-03-16 19:05:56,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:56,159 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 172 transitions. [2025-03-16 19:05:56,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-16 19:05:56,159 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 172 transitions. [2025-03-16 19:05:56,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 19:05:56,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:56,160 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] [2025-03-16 19:05:56,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:05:56,160 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:56,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:56,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1117460788, now seen corresponding path program 1 times [2025-03-16 19:05:56,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:56,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790861972] [2025-03-16 19:05:56,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:56,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:56,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 19:05:56,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 19:05:56,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:56,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:56,257 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-16 19:05:56,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:56,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790861972] [2025-03-16 19:05:56,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790861972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:56,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:56,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:05:56,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950743274] [2025-03-16 19:05:56,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:56,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:05:56,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:56,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:05:56,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:05:56,258 INFO L87 Difference]: Start difference. First operand 112 states and 172 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-16 19:05:56,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:56,299 INFO L93 Difference]: Finished difference Result 217 states and 353 transitions. [2025-03-16 19:05:56,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:05:56,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-16 19:05:56,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:56,300 INFO L225 Difference]: With dead ends: 217 [2025-03-16 19:05:56,300 INFO L226 Difference]: Without dead ends: 160 [2025-03-16 19:05:56,303 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-16 19:05:56,303 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 74 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:56,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 305 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:56,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-16 19:05:56,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2025-03-16 19:05:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.5796178343949046) internal successors, (248), 157 states have internal predecessors, (248), 0 states have call successors, (0), 0 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-16 19:05:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 248 transitions. [2025-03-16 19:05:56,312 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 248 transitions. Word has length 60 [2025-03-16 19:05:56,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:56,312 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 248 transitions. [2025-03-16 19:05:56,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-16 19:05:56,312 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 248 transitions. [2025-03-16 19:05:56,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:05:56,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:56,314 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] [2025-03-16 19:05:56,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:05:56,314 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:56,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:56,315 INFO L85 PathProgramCache]: Analyzing trace with hash 457282417, now seen corresponding path program 1 times [2025-03-16 19:05:56,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:56,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067467065] [2025-03-16 19:05:56,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:56,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:56,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:05:56,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:05:56,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:56,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:56,408 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-16 19:05:56,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:56,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067467065] [2025-03-16 19:05:56,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067467065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:56,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:56,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:05:56,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104369869] [2025-03-16 19:05:56,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:56,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:05:56,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:56,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:05:56,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:05:56,409 INFO L87 Difference]: Start difference. First operand 158 states and 248 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-16 19:05:56,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:56,429 INFO L93 Difference]: Finished difference Result 350 states and 572 transitions. [2025-03-16 19:05:56,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:05:56,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-16 19:05:56,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:56,430 INFO L225 Difference]: With dead ends: 350 [2025-03-16 19:05:56,430 INFO L226 Difference]: Without dead ends: 247 [2025-03-16 19:05:56,431 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-16 19:05:56,431 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 76 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:56,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 367 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:56,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-16 19:05:56,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2025-03-16 19:05:56,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.6147540983606556) internal successors, (394), 244 states have internal predecessors, (394), 0 states have call successors, (0), 0 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-16 19:05:56,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 394 transitions. [2025-03-16 19:05:56,442 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 394 transitions. Word has length 62 [2025-03-16 19:05:56,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:56,442 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 394 transitions. [2025-03-16 19:05:56,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-16 19:05:56,442 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 394 transitions. [2025-03-16 19:05:56,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:05:56,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:56,443 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-16 19:05:56,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:05:56,443 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:56,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:56,444 INFO L85 PathProgramCache]: Analyzing trace with hash -432920261, now seen corresponding path program 1 times [2025-03-16 19:05:56,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:56,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3291499] [2025-03-16 19:05:56,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:56,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:56,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:05:56,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:05:56,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:56,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:56,521 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-16 19:05:56,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:56,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3291499] [2025-03-16 19:05:56,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3291499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:56,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:56,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:05:56,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323471738] [2025-03-16 19:05:56,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:56,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:05:56,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:56,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:05:56,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:05:56,523 INFO L87 Difference]: Start difference. First operand 245 states and 394 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-16 19:05:56,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:56,546 INFO L93 Difference]: Finished difference Result 446 states and 732 transitions. [2025-03-16 19:05:56,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:05:56,547 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-16 19:05:56,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:56,548 INFO L225 Difference]: With dead ends: 446 [2025-03-16 19:05:56,548 INFO L226 Difference]: Without dead ends: 343 [2025-03-16 19:05:56,550 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-16 19:05:56,551 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 77 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:56,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 381 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:56,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-16 19:05:56,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2025-03-16 19:05:56,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.6235294117647059) internal successors, (552), 340 states have internal predecessors, (552), 0 states have call successors, (0), 0 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-16 19:05:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 552 transitions. [2025-03-16 19:05:56,561 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 552 transitions. Word has length 64 [2025-03-16 19:05:56,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:56,561 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 552 transitions. [2025-03-16 19:05:56,561 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-16 19:05:56,561 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 552 transitions. [2025-03-16 19:05:56,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 19:05:56,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:56,562 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-16 19:05:56,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:05:56,563 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:56,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:56,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2117316082, now seen corresponding path program 1 times [2025-03-16 19:05:56,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:56,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007299962] [2025-03-16 19:05:56,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:56,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:56,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 19:05:56,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 19:05:56,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:56,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:56,652 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-16 19:05:56,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:56,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007299962] [2025-03-16 19:05:56,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007299962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:56,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:56,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:05:56,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48197261] [2025-03-16 19:05:56,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:56,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:05:56,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:56,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:05:56,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:05:56,653 INFO L87 Difference]: Start difference. First operand 341 states and 552 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-16 19:05:56,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:56,674 INFO L93 Difference]: Finished difference Result 837 states and 1380 transitions. [2025-03-16 19:05:56,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:05:56,676 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-16 19:05:56,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:56,678 INFO L225 Difference]: With dead ends: 837 [2025-03-16 19:05:56,678 INFO L226 Difference]: Without dead ends: 568 [2025-03-16 19:05:56,678 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-16 19:05:56,679 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 70 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:56,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 360 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:56,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-03-16 19:05:56,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 566. [2025-03-16 19:05:56,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 1.6283185840707965) internal successors, (920), 565 states have internal predecessors, (920), 0 states have call successors, (0), 0 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-16 19:05:56,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 920 transitions. [2025-03-16 19:05:56,698 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 920 transitions. Word has length 64 [2025-03-16 19:05:56,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:56,699 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 920 transitions. [2025-03-16 19:05:56,699 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-16 19:05:56,699 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 920 transitions. [2025-03-16 19:05:56,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:05:56,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:56,702 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-16 19:05:56,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:05:56,702 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:56,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:56,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1686175048, now seen corresponding path program 1 times [2025-03-16 19:05:56,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:56,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508283789] [2025-03-16 19:05:56,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:56,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:56,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:05:56,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:05:56,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:56,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:56,787 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-16 19:05:56,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:56,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508283789] [2025-03-16 19:05:56,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508283789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:56,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:56,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:05:56,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161470889] [2025-03-16 19:05:56,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:56,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:05:56,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:56,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:05:56,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:05:56,789 INFO L87 Difference]: Start difference. First operand 566 states and 920 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-16 19:05:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:56,811 INFO L93 Difference]: Finished difference Result 1050 states and 1724 transitions. [2025-03-16 19:05:56,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:05:56,812 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-16 19:05:56,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:56,814 INFO L225 Difference]: With dead ends: 1050 [2025-03-16 19:05:56,814 INFO L226 Difference]: Without dead ends: 781 [2025-03-16 19:05:56,815 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-16 19:05:56,815 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 71 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:56,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 373 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:56,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2025-03-16 19:05:56,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 779. [2025-03-16 19:05:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 778 states have (on average 1.6221079691516709) internal successors, (1262), 778 states have internal predecessors, (1262), 0 states have call successors, (0), 0 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-16 19:05:56,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1262 transitions. [2025-03-16 19:05:56,839 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1262 transitions. Word has length 66 [2025-03-16 19:05:56,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:56,839 INFO L471 AbstractCegarLoop]: Abstraction has 779 states and 1262 transitions. [2025-03-16 19:05:56,839 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-16 19:05:56,839 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1262 transitions. [2025-03-16 19:05:56,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 19:05:56,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:56,840 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-16 19:05:56,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:05:56,840 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:56,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:56,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1348242699, now seen corresponding path program 1 times [2025-03-16 19:05:56,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:56,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78496396] [2025-03-16 19:05:56,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:56,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:56,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 19:05:56,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 19:05:56,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:56,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:56,950 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-16 19:05:56,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:56,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78496396] [2025-03-16 19:05:56,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78496396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:56,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:56,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:05:56,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610558272] [2025-03-16 19:05:56,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:56,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:05:56,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:56,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:05:56,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:56,953 INFO L87 Difference]: Start difference. First operand 779 states and 1262 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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-16 19:05:57,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:57,124 INFO L93 Difference]: Finished difference Result 3623 states and 6043 transitions. [2025-03-16 19:05:57,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:05:57,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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-16 19:05:57,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:57,135 INFO L225 Difference]: With dead ends: 3623 [2025-03-16 19:05:57,135 INFO L226 Difference]: Without dead ends: 2928 [2025-03-16 19:05:57,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:05:57,137 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 565 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:57,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 1137 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:05:57,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2025-03-16 19:05:57,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1417. [2025-03-16 19:05:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1416 states have (on average 1.6271186440677967) internal successors, (2304), 1416 states have internal predecessors, (2304), 0 states have call successors, (0), 0 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-16 19:05:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 2304 transitions. [2025-03-16 19:05:57,187 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 2304 transitions. Word has length 66 [2025-03-16 19:05:57,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:57,187 INFO L471 AbstractCegarLoop]: Abstraction has 1417 states and 2304 transitions. [2025-03-16 19:05:57,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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-16 19:05:57,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2304 transitions. [2025-03-16 19:05:57,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:05:57,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:57,188 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-16 19:05:57,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:05:57,190 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:57,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:57,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1152508830, now seen corresponding path program 1 times [2025-03-16 19:05:57,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:57,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516172050] [2025-03-16 19:05:57,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:57,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:57,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:05:57,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:05:57,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:57,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:57,291 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-16 19:05:57,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:57,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516172050] [2025-03-16 19:05:57,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516172050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:57,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:57,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:57,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850331175] [2025-03-16 19:05:57,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:57,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:57,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:57,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:57,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:57,292 INFO L87 Difference]: Start difference. First operand 1417 states and 2304 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 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-16 19:05:57,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:57,379 INFO L93 Difference]: Finished difference Result 4220 states and 7007 transitions. [2025-03-16 19:05:57,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:57,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 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-16 19:05:57,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:57,389 INFO L225 Difference]: With dead ends: 4220 [2025-03-16 19:05:57,389 INFO L226 Difference]: Without dead ends: 2896 [2025-03-16 19:05:57,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:57,394 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 247 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:57,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 612 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:57,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2025-03-16 19:05:57,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 2142. [2025-03-16 19:05:57,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2142 states, 2141 states have (on average 1.6361513311536666) internal successors, (3503), 2141 states have internal predecessors, (3503), 0 states have call successors, (0), 0 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-16 19:05:57,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 3503 transitions. [2025-03-16 19:05:57,461 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 3503 transitions. Word has length 67 [2025-03-16 19:05:57,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:57,462 INFO L471 AbstractCegarLoop]: Abstraction has 2142 states and 3503 transitions. [2025-03-16 19:05:57,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 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-16 19:05:57,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 3503 transitions. [2025-03-16 19:05:57,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:05:57,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:57,463 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-16 19:05:57,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:05:57,463 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:57,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:57,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1938417527, now seen corresponding path program 1 times [2025-03-16 19:05:57,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:57,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204630680] [2025-03-16 19:05:57,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:57,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:57,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:05:57,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:05:57,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:57,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:57,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:05:57,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:57,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204630680] [2025-03-16 19:05:57,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204630680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:57,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:57,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:05:57,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915426156] [2025-03-16 19:05:57,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:57,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:05:57,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:57,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:05:57,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:05:57,519 INFO L87 Difference]: Start difference. First operand 2142 states and 3503 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-16 19:05:57,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:57,568 INFO L93 Difference]: Finished difference Result 4758 states and 7901 transitions. [2025-03-16 19:05:57,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:05:57,568 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-16 19:05:57,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:57,578 INFO L225 Difference]: With dead ends: 4758 [2025-03-16 19:05:57,578 INFO L226 Difference]: Without dead ends: 3233 [2025-03-16 19:05:57,580 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-16 19:05:57,580 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 83 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:57,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 393 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:57,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3233 states. [2025-03-16 19:05:57,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3233 to 3231. [2025-03-16 19:05:57,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3231 states, 3230 states have (on average 1.6368421052631579) internal successors, (5287), 3230 states have internal predecessors, (5287), 0 states have call successors, (0), 0 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-16 19:05:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3231 states to 3231 states and 5287 transitions. [2025-03-16 19:05:57,673 INFO L78 Accepts]: Start accepts. Automaton has 3231 states and 5287 transitions. Word has length 67 [2025-03-16 19:05:57,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:57,674 INFO L471 AbstractCegarLoop]: Abstraction has 3231 states and 5287 transitions. [2025-03-16 19:05:57,674 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-16 19:05:57,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3231 states and 5287 transitions. [2025-03-16 19:05:57,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:05:57,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:57,674 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-16 19:05:57,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:05:57,675 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:57,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:57,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1366454483, now seen corresponding path program 1 times [2025-03-16 19:05:57,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:57,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729332018] [2025-03-16 19:05:57,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:57,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:57,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:05:57,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:05:57,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:57,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:57,737 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-16 19:05:57,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:57,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729332018] [2025-03-16 19:05:57,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729332018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:57,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:57,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:57,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577303079] [2025-03-16 19:05:57,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:57,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:57,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:57,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:57,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:57,739 INFO L87 Difference]: Start difference. First operand 3231 states and 5287 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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-16 19:05:57,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:57,855 INFO L93 Difference]: Finished difference Result 10391 states and 17091 transitions. [2025-03-16 19:05:57,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:57,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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-16 19:05:57,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:57,876 INFO L225 Difference]: With dead ends: 10391 [2025-03-16 19:05:57,876 INFO L226 Difference]: Without dead ends: 7229 [2025-03-16 19:05:57,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:57,881 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 278 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:57,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 546 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:57,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7229 states. [2025-03-16 19:05:57,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7229 to 5201. [2025-03-16 19:05:57,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5201 states, 5200 states have (on average 1.6259615384615385) internal successors, (8455), 5200 states have internal predecessors, (8455), 0 states have call successors, (0), 0 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-16 19:05:58,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5201 states to 5201 states and 8455 transitions. [2025-03-16 19:05:58,004 INFO L78 Accepts]: Start accepts. Automaton has 5201 states and 8455 transitions. Word has length 68 [2025-03-16 19:05:58,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:58,004 INFO L471 AbstractCegarLoop]: Abstraction has 5201 states and 8455 transitions. [2025-03-16 19:05:58,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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-16 19:05:58,005 INFO L276 IsEmpty]: Start isEmpty. Operand 5201 states and 8455 transitions. [2025-03-16 19:05:58,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:05:58,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:58,005 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:05:58,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:05:58,005 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:58,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:58,006 INFO L85 PathProgramCache]: Analyzing trace with hash 591105284, now seen corresponding path program 1 times [2025-03-16 19:05:58,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:58,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475249109] [2025-03-16 19:05:58,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:58,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:58,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:05:58,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:05:58,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:58,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:58,097 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-16 19:05:58,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:58,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475249109] [2025-03-16 19:05:58,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475249109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:58,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:58,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:58,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041968485] [2025-03-16 19:05:58,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:58,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:58,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:58,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:58,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:58,099 INFO L87 Difference]: Start difference. First operand 5201 states and 8455 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-16 19:05:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:58,246 INFO L93 Difference]: Finished difference Result 16423 states and 26807 transitions. [2025-03-16 19:05:58,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:58,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-16 19:05:58,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:58,276 INFO L225 Difference]: With dead ends: 16423 [2025-03-16 19:05:58,276 INFO L226 Difference]: Without dead ends: 11291 [2025-03-16 19:05:58,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:58,285 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 276 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:58,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 547 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:58,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11291 states. [2025-03-16 19:05:58,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11291 to 8203. [2025-03-16 19:05:58,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8203 states, 8202 states have (on average 1.6146061936113143) internal successors, (13243), 8202 states have internal predecessors, (13243), 0 states have call successors, (0), 0 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-16 19:05:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8203 states to 8203 states and 13243 transitions. [2025-03-16 19:05:58,506 INFO L78 Accepts]: Start accepts. Automaton has 8203 states and 13243 transitions. Word has length 69 [2025-03-16 19:05:58,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:58,507 INFO L471 AbstractCegarLoop]: Abstraction has 8203 states and 13243 transitions. [2025-03-16 19:05:58,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-16 19:05:58,507 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 13243 transitions. [2025-03-16 19:05:58,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:05:58,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:58,507 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:05:58,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:05:58,507 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:58,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:58,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1163210150, now seen corresponding path program 1 times [2025-03-16 19:05:58,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:58,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428152792] [2025-03-16 19:05:58,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:58,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:58,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:05:58,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:05:58,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:58,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:58,645 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-16 19:05:58,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:58,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428152792] [2025-03-16 19:05:58,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428152792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:58,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:58,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:05:58,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542064549] [2025-03-16 19:05:58,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:58,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:05:58,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:58,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:05:58,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:58,647 INFO L87 Difference]: Start difference. First operand 8203 states and 13243 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-16 19:05:58,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:58,809 INFO L93 Difference]: Finished difference Result 16339 states and 26396 transitions. [2025-03-16 19:05:58,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:58,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2025-03-16 19:05:58,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:58,823 INFO L225 Difference]: With dead ends: 16339 [2025-03-16 19:05:58,823 INFO L226 Difference]: Without dead ends: 8205 [2025-03-16 19:05:58,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:05:58,830 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 70 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:58,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 599 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:58,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8205 states. [2025-03-16 19:05:58,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8205 to 8203. [2025-03-16 19:05:59,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8203 states, 8202 states have (on average 1.599366008290661) internal successors, (13118), 8202 states have internal predecessors, (13118), 0 states have call successors, (0), 0 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-16 19:05:59,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8203 states to 8203 states and 13118 transitions. [2025-03-16 19:05:59,024 INFO L78 Accepts]: Start accepts. Automaton has 8203 states and 13118 transitions. Word has length 71 [2025-03-16 19:05:59,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:59,024 INFO L471 AbstractCegarLoop]: Abstraction has 8203 states and 13118 transitions. [2025-03-16 19:05:59,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-16 19:05:59,025 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 13118 transitions. [2025-03-16 19:05:59,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:05:59,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:59,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:05:59,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:05:59,025 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:59,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:59,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1596881612, now seen corresponding path program 1 times [2025-03-16 19:05:59,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:59,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889011553] [2025-03-16 19:05:59,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:59,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:59,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:05:59,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:05:59,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:59,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:59,160 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-16 19:05:59,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:59,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889011553] [2025-03-16 19:05:59,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889011553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:59,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:59,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:05:59,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248676605] [2025-03-16 19:05:59,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:59,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:05:59,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:59,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:05:59,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:59,161 INFO L87 Difference]: Start difference. First operand 8203 states and 13118 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-16 19:05:59,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:59,382 INFO L93 Difference]: Finished difference Result 23501 states and 37734 transitions. [2025-03-16 19:05:59,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:59,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-03-16 19:05:59,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:59,407 INFO L225 Difference]: With dead ends: 23501 [2025-03-16 19:05:59,407 INFO L226 Difference]: Without dead ends: 15367 [2025-03-16 19:05:59,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:05:59,416 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 135 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:59,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 460 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:59,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15367 states. [2025-03-16 19:05:59,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15367 to 15365. [2025-03-16 19:05:59,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15365 states, 15364 states have (on average 1.582725852642541) internal successors, (24317), 15364 states have internal predecessors, (24317), 0 states have call successors, (0), 0 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-16 19:05:59,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15365 states to 15365 states and 24317 transitions. [2025-03-16 19:05:59,697 INFO L78 Accepts]: Start accepts. Automaton has 15365 states and 24317 transitions. Word has length 74 [2025-03-16 19:05:59,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:59,697 INFO L471 AbstractCegarLoop]: Abstraction has 15365 states and 24317 transitions. [2025-03-16 19:05:59,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-16 19:05:59,698 INFO L276 IsEmpty]: Start isEmpty. Operand 15365 states and 24317 transitions. [2025-03-16 19:05:59,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:05:59,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:59,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:05:59,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:05:59,698 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:59,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:59,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2037322221, now seen corresponding path program 1 times [2025-03-16 19:05:59,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:59,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533723417] [2025-03-16 19:05:59,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:59,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:59,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:05:59,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:05:59,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:59,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:59,883 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-16 19:05:59,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:59,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533723417] [2025-03-16 19:05:59,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533723417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:59,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:59,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:59,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454130719] [2025-03-16 19:05:59,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:59,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:59,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:59,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:59,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:59,884 INFO L87 Difference]: Start difference. First operand 15365 states and 24317 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-16 19:05:59,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:59,992 INFO L93 Difference]: Finished difference Result 16091 states and 25404 transitions. [2025-03-16 19:05:59,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:59,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-16 19:05:59,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:06:00,019 INFO L225 Difference]: With dead ends: 16091 [2025-03-16 19:06:00,019 INFO L226 Difference]: Without dead ends: 16089 [2025-03-16 19:06:00,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:06:00,026 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:06:00,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 497 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:06:00,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16089 states. [2025-03-16 19:06:00,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16089 to 16089. [2025-03-16 19:06:00,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16089 states, 16088 states have (on average 1.555942317255097) internal successors, (25032), 16088 states have internal predecessors, (25032), 0 states have call successors, (0), 0 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-16 19:06:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16089 states to 16089 states and 25032 transitions. [2025-03-16 19:06:00,314 INFO L78 Accepts]: Start accepts. Automaton has 16089 states and 25032 transitions. Word has length 75 [2025-03-16 19:06:00,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:06:00,315 INFO L471 AbstractCegarLoop]: Abstraction has 16089 states and 25032 transitions. [2025-03-16 19:06:00,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-16 19:06:00,315 INFO L276 IsEmpty]: Start isEmpty. Operand 16089 states and 25032 transitions. [2025-03-16 19:06:00,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:06:00,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:06:00,319 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:06:00,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:06:00,319 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:06:00,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:06:00,319 INFO L85 PathProgramCache]: Analyzing trace with hash 135646549, now seen corresponding path program 1 times [2025-03-16 19:06:00,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:06:00,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135879479] [2025-03-16 19:06:00,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:06:00,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:06:00,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:06:00,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:06:00,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:06:00,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:06:00,380 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 19:06:00,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:06:00,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135879479] [2025-03-16 19:06:00,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135879479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:06:00,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:06:00,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:06:00,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412826614] [2025-03-16 19:06:00,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:06:00,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:06:00,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:06:00,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:06:00,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:06:00,381 INFO L87 Difference]: Start difference. First operand 16089 states and 25032 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-16 19:06:00,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:06:00,707 INFO L93 Difference]: Finished difference Result 48011 states and 74630 transitions. [2025-03-16 19:06:00,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:06:00,707 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 99 [2025-03-16 19:06:00,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:06:00,768 INFO L225 Difference]: With dead ends: 48011 [2025-03-16 19:06:00,768 INFO L226 Difference]: Without dead ends: 31981 [2025-03-16 19:06:00,788 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-16 19:06:00,789 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 95 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 380 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-16 19:06:00,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 380 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:06:00,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31981 states. [2025-03-16 19:06:01,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31981 to 31979. [2025-03-16 19:06:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31979 states, 31978 states have (on average 1.5402776909125024) internal successors, (49255), 31978 states have internal predecessors, (49255), 0 states have call successors, (0), 0 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-16 19:06:01,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31979 states to 31979 states and 49255 transitions. [2025-03-16 19:06:01,414 INFO L78 Accepts]: Start accepts. Automaton has 31979 states and 49255 transitions. Word has length 99 [2025-03-16 19:06:01,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:06:01,415 INFO L471 AbstractCegarLoop]: Abstraction has 31979 states and 49255 transitions. [2025-03-16 19:06:01,415 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-16 19:06:01,415 INFO L276 IsEmpty]: Start isEmpty. Operand 31979 states and 49255 transitions. [2025-03-16 19:06:01,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:06:01,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:06:01,418 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, 1, 1, 1, 1] [2025-03-16 19:06:01,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:06:01,418 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:06:01,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:06:01,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1693820247, now seen corresponding path program 1 times [2025-03-16 19:06:01,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:06:01,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314789530] [2025-03-16 19:06:01,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:06:01,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:06:01,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:06:01,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:06:01,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:06:01,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:06:01,486 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 19:06:01,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:06:01,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314789530] [2025-03-16 19:06:01,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314789530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:06:01,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:06:01,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:06:01,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505171124] [2025-03-16 19:06:01,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:06:01,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:06:01,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:06:01,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:06:01,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:06:01,487 INFO L87 Difference]: Start difference. First operand 31979 states and 49255 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 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-16 19:06:01,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:06:01,987 INFO L93 Difference]: Finished difference Result 95479 states and 146928 transitions. [2025-03-16 19:06:01,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:06:01,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-16 19:06:01,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:06:02,105 INFO L225 Difference]: With dead ends: 95479 [2025-03-16 19:06:02,105 INFO L226 Difference]: Without dead ends: 63596 [2025-03-16 19:06:02,135 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-16 19:06:02,135 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 109 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 395 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-16 19:06:02,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 395 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:06:02,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63596 states. [2025-03-16 19:06:02,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63596 to 63594. [2025-03-16 19:06:03,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63594 states, 63593 states have (on average 1.5245231393392356) internal successors, (96949), 63593 states have internal predecessors, (96949), 0 states have call successors, (0), 0 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-16 19:06:03,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63594 states to 63594 states and 96949 transitions. [2025-03-16 19:06:03,166 INFO L78 Accepts]: Start accepts. Automaton has 63594 states and 96949 transitions. Word has length 99 [2025-03-16 19:06:03,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:06:03,166 INFO L471 AbstractCegarLoop]: Abstraction has 63594 states and 96949 transitions. [2025-03-16 19:06:03,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 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-16 19:06:03,166 INFO L276 IsEmpty]: Start isEmpty. Operand 63594 states and 96949 transitions. [2025-03-16 19:06:03,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:06:03,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:06:03,171 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, 1, 1, 1, 1] [2025-03-16 19:06:03,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:06:03,172 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:06:03,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:06:03,172 INFO L85 PathProgramCache]: Analyzing trace with hash 893143353, now seen corresponding path program 1 times [2025-03-16 19:06:03,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:06:03,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589202971] [2025-03-16 19:06:03,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:06:03,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:06:03,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:06:03,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:06:03,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:06:03,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:06:03,243 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-16 19:06:03,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:06:03,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589202971] [2025-03-16 19:06:03,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589202971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:06:03,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:06:03,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:06:03,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992277100] [2025-03-16 19:06:03,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:06:03,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:06:03,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:06:03,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:06:03,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:06:03,244 INFO L87 Difference]: Start difference. First operand 63594 states and 96949 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 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-16 19:06:04,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:06:04,466 INFO L93 Difference]: Finished difference Result 189870 states and 289193 transitions. [2025-03-16 19:06:04,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:06:04,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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-16 19:06:04,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:06:04,797 INFO L225 Difference]: With dead ends: 189870 [2025-03-16 19:06:04,797 INFO L226 Difference]: Without dead ends: 126472 [2025-03-16 19:06:04,826 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-16 19:06:04,827 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 110 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 394 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-16 19:06:04,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 394 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:06:04,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126472 states. [2025-03-16 19:06:06,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126472 to 126470. [2025-03-16 19:06:06,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126470 states, 126469 states have (on average 1.508598945196056) internal successors, (190791), 126469 states have internal predecessors, (190791), 0 states have call successors, (0), 0 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-16 19:06:06,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126470 states to 126470 states and 190791 transitions. [2025-03-16 19:06:06,871 INFO L78 Accepts]: Start accepts. Automaton has 126470 states and 190791 transitions. Word has length 99 [2025-03-16 19:06:06,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:06:06,871 INFO L471 AbstractCegarLoop]: Abstraction has 126470 states and 190791 transitions. [2025-03-16 19:06:06,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 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-16 19:06:06,872 INFO L276 IsEmpty]: Start isEmpty. Operand 126470 states and 190791 transitions. [2025-03-16 19:06:06,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:06:06,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:06:06,881 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, 1, 1, 1, 1, 1] [2025-03-16 19:06:06,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:06:06,881 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:06:06,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:06:06,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1430884486, now seen corresponding path program 1 times [2025-03-16 19:06:06,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:06:06,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798010041] [2025-03-16 19:06:06,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:06:06,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:06:06,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:06:06,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:06:06,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:06:06,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:06:06,941 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-16 19:06:06,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:06:06,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798010041] [2025-03-16 19:06:06,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798010041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:06:06,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:06:06,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:06:06,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650219963] [2025-03-16 19:06:06,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:06:06,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:06:06,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:06:06,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:06:06,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:06:06,942 INFO L87 Difference]: Start difference. First operand 126470 states and 190791 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 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-16 19:06:09,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:06:09,248 INFO L93 Difference]: Finished difference Result 377614 states and 569134 transitions. [2025-03-16 19:06:09,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:06:09,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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-16 19:06:09,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:06:09,678 INFO L225 Difference]: With dead ends: 377614 [2025-03-16 19:06:09,678 INFO L226 Difference]: Without dead ends: 251544 [2025-03-16 19:06:09,748 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-16 19:06:09,748 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 129 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 411 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-16 19:06:09,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 411 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:06:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251544 states. [2025-03-16 19:06:13,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251544 to 251542. [2025-03-16 19:06:13,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251542 states, 251541 states have (on average 1.492559861016693) internal successors, (375440), 251541 states have internal predecessors, (375440), 0 states have call successors, (0), 0 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-16 19:06:14,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251542 states to 251542 states and 375440 transitions. [2025-03-16 19:06:14,309 INFO L78 Accepts]: Start accepts. Automaton has 251542 states and 375440 transitions. Word has length 99 [2025-03-16 19:06:14,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:06:14,310 INFO L471 AbstractCegarLoop]: Abstraction has 251542 states and 375440 transitions. [2025-03-16 19:06:14,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 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-16 19:06:14,310 INFO L276 IsEmpty]: Start isEmpty. Operand 251542 states and 375440 transitions. [2025-03-16 19:06:14,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:06:14,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:06:14,325 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:06:14,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:06:14,325 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:06:14,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:06:14,326 INFO L85 PathProgramCache]: Analyzing trace with hash 928422523, now seen corresponding path program 1 times [2025-03-16 19:06:14,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:06:14,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670813345] [2025-03-16 19:06:14,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:06:14,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:06:14,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:06:14,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:06:14,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:06:14,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:06:14,373 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-16 19:06:14,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:06:14,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670813345] [2025-03-16 19:06:14,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670813345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:06:14,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:06:14,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:06:14,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033409902] [2025-03-16 19:06:14,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:06:14,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:06:14,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:06:14,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:06:14,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:06:14,374 INFO L87 Difference]: Start difference. First operand 251542 states and 375440 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 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-16 19:06:17,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:06:17,090 INFO L93 Difference]: Finished difference Result 377990 states and 562842 transitions. [2025-03-16 19:06:17,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:06:17,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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-16 19:06:17,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:06:17,542 INFO L225 Difference]: With dead ends: 377990 [2025-03-16 19:06:17,542 INFO L226 Difference]: Without dead ends: 251888 [2025-03-16 19:06:17,605 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-16 19:06:17,605 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 100 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:06:17,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 441 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:06:17,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251888 states. [2025-03-16 19:06:21,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251888 to 251886. [2025-03-16 19:06:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251886 states, 251885 states have (on average 1.4786589118049904) internal successors, (372452), 251885 states have internal predecessors, (372452), 0 states have call successors, (0), 0 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-16 19:06:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251886 states to 251886 states and 372452 transitions. [2025-03-16 19:06:22,060 INFO L78 Accepts]: Start accepts. Automaton has 251886 states and 372452 transitions. Word has length 99 [2025-03-16 19:06:22,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:06:22,060 INFO L471 AbstractCegarLoop]: Abstraction has 251886 states and 372452 transitions. [2025-03-16 19:06:22,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 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-16 19:06:22,061 INFO L276 IsEmpty]: Start isEmpty. Operand 251886 states and 372452 transitions. [2025-03-16 19:06:22,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:06:22,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:06:22,072 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, 1, 1, 1, 1, 1] [2025-03-16 19:06:22,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:06:22,072 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:06:22,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:06:22,073 INFO L85 PathProgramCache]: Analyzing trace with hash 422863898, now seen corresponding path program 1 times [2025-03-16 19:06:22,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:06:22,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534479270] [2025-03-16 19:06:22,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:06:22,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:06:22,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:06:22,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:06:22,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:06:22,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:06:22,146 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-16 19:06:22,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:06:22,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534479270] [2025-03-16 19:06:22,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534479270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:06:22,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:06:22,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:06:22,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68323352] [2025-03-16 19:06:22,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:06:22,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:06:22,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:06:22,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:06:22,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:06:22,147 INFO L87 Difference]: Start difference. First operand 251886 states and 372452 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 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-16 19:06:25,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:06:25,075 INFO L93 Difference]: Finished difference Result 378534 states and 558401 transitions. [2025-03-16 19:06:25,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:06:25,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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-16 19:06:25,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:06:25,561 INFO L225 Difference]: With dead ends: 378534 [2025-03-16 19:06:25,562 INFO L226 Difference]: Without dead ends: 252464 [2025-03-16 19:06:25,653 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-16 19:06:25,654 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 114 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:06:25,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 459 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:06:25,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252464 states.