./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label55.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem18_label55.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5c92878d09fe8ca31ff62e1863ecb09ce1afff2124636cc8090fb7804c754eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:13:05,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:13:05,837 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 12:13:05,842 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:13:05,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:13:05,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:13:05,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:13:05,864 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:13:05,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:13:05,864 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:13:05,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:13:05,864 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:13:05,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:13:05,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:13:05,865 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:13:05,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:13:05,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:13:05,865 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:13:05,865 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:13:05,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:13:05,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:13:05,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:13:05,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:13:05,865 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:13:05,865 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:13:05,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:13:05,865 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:13:05,865 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:13:05,865 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:13:05,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:13:05,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:13:05,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:13:05,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:13:05,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:13:05,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:13:05,866 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:13:05,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:13:05,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:13:05,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:13:05,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:13:05,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:13:05,866 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:13:05,866 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:13:05,866 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5c92878d09fe8ca31ff62e1863ecb09ce1afff2124636cc8090fb7804c754eb [2025-02-05 12:13:06,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:13:06,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:13:06,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:13:06,093 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:13:06,093 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:13:06,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label55.c [2025-02-05 12:13:07,247 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8202fa464/abb9eb779fad4302b80a5e2d18f6116f/FLAGbfb45c815 [2025-02-05 12:13:07,706 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:13:07,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label55.c [2025-02-05 12:13:07,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8202fa464/abb9eb779fad4302b80a5e2d18f6116f/FLAGbfb45c815 [2025-02-05 12:13:07,822 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8202fa464/abb9eb779fad4302b80a5e2d18f6116f [2025-02-05 12:13:07,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:13:07,825 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:13:07,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:13:07,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:13:07,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:13:07,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:13:07" (1/1) ... [2025-02-05 12:13:07,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50552dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:13:07, skipping insertion in model container [2025-02-05 12:13:07,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:13:07" (1/1) ... [2025-02-05 12:13:07,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:13:08,022 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label55.c[1618,1631] [2025-02-05 12:13:08,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:13:08,389 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:13:08,398 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label55.c[1618,1631] [2025-02-05 12:13:08,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:13:08,614 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:13:08,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:13:08 WrapperNode [2025-02-05 12:13:08,615 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:13:08,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:13:08,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:13:08,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:13:08,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:13:08" (1/1) ... [2025-02-05 12:13:08,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:13:08" (1/1) ... [2025-02-05 12:13:08,860 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-02-05 12:13:08,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:13:08,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:13:08,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:13:08,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:13:08,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:13:08" (1/1) ... [2025-02-05 12:13:08,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:13:08" (1/1) ... [2025-02-05 12:13:08,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:13:08" (1/1) ... [2025-02-05 12:13:08,938 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 12:13:08,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:13:08" (1/1) ... [2025-02-05 12:13:08,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:13:08" (1/1) ... [2025-02-05 12:13:08,990 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:13:08" (1/1) ... [2025-02-05 12:13:08,999 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:13:08" (1/1) ... [2025-02-05 12:13:09,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:13:08" (1/1) ... [2025-02-05 12:13:09,058 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:13:08" (1/1) ... [2025-02-05 12:13:09,077 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:13:09,077 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:13:09,078 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:13:09,078 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:13:09,078 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:13:08" (1/1) ... [2025-02-05 12:13:09,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:13:09,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:13:09,101 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 12:13:09,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 12:13:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:13:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:13:09,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:13:09,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:13:09,161 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:13:09,162 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:13:11,836 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1; [2025-02-05 12:13:11,836 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1; [2025-02-05 12:13:11,916 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-02-05 12:13:11,916 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:13:11,934 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:13:11,935 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:13:11,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:13:11 BoogieIcfgContainer [2025-02-05 12:13:11,935 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:13:11,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:13:11,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:13:11,943 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:13:11,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:13:07" (1/3) ... [2025-02-05 12:13:11,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739d5ae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:13:11, skipping insertion in model container [2025-02-05 12:13:11,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:13:08" (2/3) ... [2025-02-05 12:13:11,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739d5ae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:13:11, skipping insertion in model container [2025-02-05 12:13:11,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:13:11" (3/3) ... [2025-02-05 12:13:11,945 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label55.c [2025-02-05 12:13:11,955 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:13:11,956 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label55.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:13:12,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:13:12,014 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;@2e4ee2a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:13:12,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:13:12,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:12,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 12:13:12,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:13:12,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:13:12,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:13:12,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:13:12,028 INFO L85 PathProgramCache]: Analyzing trace with hash 433239797, now seen corresponding path program 1 times [2025-02-05 12:13:12,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:13:12,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964696329] [2025-02-05 12:13:12,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:13:12,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:13:12,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 12:13:12,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 12:13:12,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:13:12,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:13:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:13:12,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:13:12,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964696329] [2025-02-05 12:13:12,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964696329] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:13:12,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:13:12,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:13:12,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127563002] [2025-02-05 12:13:12,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:13:12,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:13:12,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:13:12,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:13:12,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:12,173 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:13:14,528 INFO L93 Difference]: Finished difference Result 2205 states and 4263 transitions. [2025-02-05 12:13:14,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:13:14,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-02-05 12:13:14,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:13:14,542 INFO L225 Difference]: With dead ends: 2205 [2025-02-05 12:13:14,542 INFO L226 Difference]: Without dead ends: 1384 [2025-02-05 12:13:14,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:14,548 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 707 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2232 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 2762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 2232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:13:14,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 430 Invalid, 2762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 2232 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 12:13:14,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2025-02-05 12:13:14,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2025-02-05 12:13:14,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1383 states have (on average 1.6514822848879247) internal successors, (2284), 1383 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:14,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2284 transitions. [2025-02-05 12:13:14,605 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2284 transitions. Word has length 12 [2025-02-05 12:13:14,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:13:14,606 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2284 transitions. [2025-02-05 12:13:14,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:14,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2284 transitions. [2025-02-05 12:13:14,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 12:13:14,611 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:13:14,611 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:13:14,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:13:14,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:13:14,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:13:14,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1269038519, now seen corresponding path program 1 times [2025-02-05 12:13:14,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:13:14,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64575356] [2025-02-05 12:13:14,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:13:14,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:13:14,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 12:13:14,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 12:13:14,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:13:14,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:13:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:13:14,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:13:14,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64575356] [2025-02-05 12:13:14,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64575356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:13:14,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:13:14,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:13:14,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277196404] [2025-02-05 12:13:14,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:13:14,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:13:14,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:13:14,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:13:14,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:14,793 INFO L87 Difference]: Start difference. First operand 1384 states and 2284 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:16,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:13:16,992 INFO L93 Difference]: Finished difference Result 4146 states and 6847 transitions. [2025-02-05 12:13:16,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:13:16,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 12:13:16,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:13:17,010 INFO L225 Difference]: With dead ends: 4146 [2025-02-05 12:13:17,012 INFO L226 Difference]: Without dead ends: 2764 [2025-02-05 12:13:17,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:17,016 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 712 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:13:17,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 531 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 12:13:17,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2025-02-05 12:13:17,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764. [2025-02-05 12:13:17,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2764 states, 2763 states have (on average 1.404632645674991) internal successors, (3881), 2763 states have internal predecessors, (3881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:17,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 3881 transitions. [2025-02-05 12:13:17,067 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 3881 transitions. Word has length 78 [2025-02-05 12:13:17,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:13:17,067 INFO L471 AbstractCegarLoop]: Abstraction has 2764 states and 3881 transitions. [2025-02-05 12:13:17,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:17,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3881 transitions. [2025-02-05 12:13:17,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 12:13:17,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:13:17,068 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:13:17,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:13:17,069 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:13:17,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:13:17,069 INFO L85 PathProgramCache]: Analyzing trace with hash -344608733, now seen corresponding path program 1 times [2025-02-05 12:13:17,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:13:17,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684395713] [2025-02-05 12:13:17,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:13:17,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:13:17,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 12:13:17,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 12:13:17,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:13:17,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:13:17,227 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:13:17,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:13:17,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684395713] [2025-02-05 12:13:17,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684395713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:13:17,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:13:17,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:13:17,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4610961] [2025-02-05 12:13:17,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:13:17,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:13:17,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:13:17,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:13:17,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:17,229 INFO L87 Difference]: Start difference. First operand 2764 states and 3881 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:19,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:13:19,286 INFO L93 Difference]: Finished difference Result 8286 states and 11638 transitions. [2025-02-05 12:13:19,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:13:19,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-05 12:13:19,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:13:19,300 INFO L225 Difference]: With dead ends: 8286 [2025-02-05 12:13:19,300 INFO L226 Difference]: Without dead ends: 5524 [2025-02-05 12:13:19,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:19,303 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 707 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:13:19,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 435 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 12:13:19,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5524 states. [2025-02-05 12:13:19,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5524 to 4834. [2025-02-05 12:13:19,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4834 states, 4833 states have (on average 1.2971239395820402) internal successors, (6269), 4833 states have internal predecessors, (6269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4834 states to 4834 states and 6269 transitions. [2025-02-05 12:13:19,355 INFO L78 Accepts]: Start accepts. Automaton has 4834 states and 6269 transitions. Word has length 79 [2025-02-05 12:13:19,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:13:19,355 INFO L471 AbstractCegarLoop]: Abstraction has 4834 states and 6269 transitions. [2025-02-05 12:13:19,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:19,355 INFO L276 IsEmpty]: Start isEmpty. Operand 4834 states and 6269 transitions. [2025-02-05 12:13:19,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 12:13:19,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:13:19,361 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:13:19,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:13:19,361 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:13:19,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:13:19,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1734891796, now seen corresponding path program 1 times [2025-02-05 12:13:19,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:13:19,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473018834] [2025-02-05 12:13:19,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:13:19,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:13:19,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 12:13:19,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 12:13:19,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:13:19,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:13:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 12:13:19,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:13:19,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473018834] [2025-02-05 12:13:19,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473018834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:13:19,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:13:19,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:13:19,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811088207] [2025-02-05 12:13:19,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:13:19,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:13:19,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:13:19,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:13:19,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:13:19,880 INFO L87 Difference]: Start difference. First operand 4834 states and 6269 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:22,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:13:22,877 INFO L93 Difference]: Finished difference Result 12426 states and 15644 transitions. [2025-02-05 12:13:22,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:13:22,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 199 [2025-02-05 12:13:22,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:13:22,894 INFO L225 Difference]: With dead ends: 12426 [2025-02-05 12:13:22,894 INFO L226 Difference]: Without dead ends: 7594 [2025-02-05 12:13:22,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:13:22,898 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 1873 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4348 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 4465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 4348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:13:22,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1873 Valid, 641 Invalid, 4465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 4348 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 12:13:22,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7594 states. [2025-02-05 12:13:22,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7594 to 6904. [2025-02-05 12:13:22,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6904 states, 6903 states have (on average 1.2358394900767782) internal successors, (8531), 6903 states have internal predecessors, (8531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:22,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 8531 transitions. [2025-02-05 12:13:22,981 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 8531 transitions. Word has length 199 [2025-02-05 12:13:22,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:13:22,982 INFO L471 AbstractCegarLoop]: Abstraction has 6904 states and 8531 transitions. [2025-02-05 12:13:22,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:22,982 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 8531 transitions. [2025-02-05 12:13:22,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-02-05 12:13:22,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:13:22,987 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:13:22,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 12:13:22,988 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:13:22,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:13:22,988 INFO L85 PathProgramCache]: Analyzing trace with hash -2067523462, now seen corresponding path program 1 times [2025-02-05 12:13:22,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:13:22,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105619008] [2025-02-05 12:13:22,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:13:22,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:13:23,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-02-05 12:13:23,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-02-05 12:13:23,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:13:23,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:13:23,453 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 12:13:23,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:13:23,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105619008] [2025-02-05 12:13:23,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105619008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:13:23,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:13:23,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:13:23,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10518536] [2025-02-05 12:13:23,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:13:23,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:13:23,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:13:23,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:13:23,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:13:23,457 INFO L87 Difference]: Start difference. First operand 6904 states and 8531 transitions. Second operand has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:25,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:13:25,504 INFO L93 Difference]: Finished difference Result 15239 states and 18535 transitions. [2025-02-05 12:13:25,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:13:25,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 381 [2025-02-05 12:13:25,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:13:25,522 INFO L225 Difference]: With dead ends: 15239 [2025-02-05 12:13:25,522 INFO L226 Difference]: Without dead ends: 8284 [2025-02-05 12:13:25,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:13:25,529 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 513 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3037 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 3239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 3037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:13:25,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 640 Invalid, 3239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 3037 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 12:13:25,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8284 states. [2025-02-05 12:13:25,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8284 to 8284. [2025-02-05 12:13:25,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8284 states, 8283 states have (on average 1.154291923216226) internal successors, (9561), 8283 states have internal predecessors, (9561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:25,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8284 states to 8284 states and 9561 transitions. [2025-02-05 12:13:25,614 INFO L78 Accepts]: Start accepts. Automaton has 8284 states and 9561 transitions. Word has length 381 [2025-02-05 12:13:25,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:13:25,614 INFO L471 AbstractCegarLoop]: Abstraction has 8284 states and 9561 transitions. [2025-02-05 12:13:25,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:25,614 INFO L276 IsEmpty]: Start isEmpty. Operand 8284 states and 9561 transitions. [2025-02-05 12:13:25,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2025-02-05 12:13:25,617 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:13:25,617 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:13:25,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 12:13:25,617 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:13:25,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:13:25,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1016539904, now seen corresponding path program 1 times [2025-02-05 12:13:25,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:13:25,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042213956] [2025-02-05 12:13:25,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:13:25,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:13:25,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes. [2025-02-05 12:13:25,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements. [2025-02-05 12:13:25,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:13:25,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:13:25,929 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 12:13:25,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:13:25,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042213956] [2025-02-05 12:13:25,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042213956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:13:25,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:13:25,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:13:25,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736764335] [2025-02-05 12:13:25,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:13:25,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:13:25,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:13:25,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:13:25,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:25,933 INFO L87 Difference]: Start difference. First operand 8284 states and 9561 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 2 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:27,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:13:27,546 INFO L93 Difference]: Finished difference Result 20016 states and 22949 transitions. [2025-02-05 12:13:27,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:13:27,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 2 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 396 [2025-02-05 12:13:27,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:13:27,570 INFO L225 Difference]: With dead ends: 20016 [2025-02-05 12:13:27,571 INFO L226 Difference]: Without dead ends: 11734 [2025-02-05 12:13:27,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:27,579 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 466 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:13:27,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 77 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:13:27,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11734 states. [2025-02-05 12:13:27,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11734 to 11734. [2025-02-05 12:13:27,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11734 states, 11733 states have (on average 1.119151112247507) internal successors, (13131), 11733 states have internal predecessors, (13131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11734 states to 11734 states and 13131 transitions. [2025-02-05 12:13:27,787 INFO L78 Accepts]: Start accepts. Automaton has 11734 states and 13131 transitions. Word has length 396 [2025-02-05 12:13:27,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:13:27,788 INFO L471 AbstractCegarLoop]: Abstraction has 11734 states and 13131 transitions. [2025-02-05 12:13:27,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 2 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:27,788 INFO L276 IsEmpty]: Start isEmpty. Operand 11734 states and 13131 transitions. [2025-02-05 12:13:27,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-02-05 12:13:27,791 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:13:27,791 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:13:27,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 12:13:27,791 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:13:27,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:13:27,792 INFO L85 PathProgramCache]: Analyzing trace with hash 882275948, now seen corresponding path program 1 times [2025-02-05 12:13:27,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:13:27,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348998694] [2025-02-05 12:13:27,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:13:27,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:13:27,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-02-05 12:13:27,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-02-05 12:13:27,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:13:27,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:13:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:13:28,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:13:28,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348998694] [2025-02-05 12:13:28,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348998694] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:13:28,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:13:28,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:13:28,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743359457] [2025-02-05 12:13:28,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:13:28,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:13:28,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:13:28,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:13:28,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:28,252 INFO L87 Difference]: Start difference. First operand 11734 states and 13131 transitions. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:30,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:13:30,102 INFO L93 Difference]: Finished difference Result 32436 states and 36566 transitions. [2025-02-05 12:13:30,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:13:30,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 404 [2025-02-05 12:13:30,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:13:30,132 INFO L225 Difference]: With dead ends: 32436 [2025-02-05 12:13:30,132 INFO L226 Difference]: Without dead ends: 20704 [2025-02-05 12:13:30,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:30,143 INFO L435 NwaCegarLoop]: 972 mSDtfsCounter, 600 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:13:30,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 979 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 12:13:30,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20704 states. [2025-02-05 12:13:30,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20704 to 20014. [2025-02-05 12:13:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20014 states, 20013 states have (on average 1.095537900364763) internal successors, (21925), 20013 states have internal predecessors, (21925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:30,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20014 states to 20014 states and 21925 transitions. [2025-02-05 12:13:30,392 INFO L78 Accepts]: Start accepts. Automaton has 20014 states and 21925 transitions. Word has length 404 [2025-02-05 12:13:30,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:13:30,393 INFO L471 AbstractCegarLoop]: Abstraction has 20014 states and 21925 transitions. [2025-02-05 12:13:30,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:30,393 INFO L276 IsEmpty]: Start isEmpty. Operand 20014 states and 21925 transitions. [2025-02-05 12:13:30,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-02-05 12:13:30,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:13:30,397 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:13:30,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 12:13:30,397 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:13:30,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:13:30,398 INFO L85 PathProgramCache]: Analyzing trace with hash -785594359, now seen corresponding path program 1 times [2025-02-05 12:13:30,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:13:30,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797571697] [2025-02-05 12:13:30,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:13:30,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:13:30,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-02-05 12:13:30,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-02-05 12:13:30,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:13:30,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:13:30,586 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-05 12:13:30,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:13:30,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797571697] [2025-02-05 12:13:30,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797571697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:13:30,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:13:30,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:13:30,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133513083] [2025-02-05 12:13:30,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:13:30,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:13:30,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:13:30,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:13:30,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:30,588 INFO L87 Difference]: Start difference. First operand 20014 states and 21925 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:32,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:13:32,376 INFO L93 Difference]: Finished difference Result 46236 states and 50984 transitions. [2025-02-05 12:13:32,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:13:32,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 411 [2025-02-05 12:13:32,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:13:32,410 INFO L225 Difference]: With dead ends: 46236 [2025-02-05 12:13:32,410 INFO L226 Difference]: Without dead ends: 22774 [2025-02-05 12:13:32,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:32,424 INFO L435 NwaCegarLoop]: 1113 mSDtfsCounter, 692 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:13:32,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1120 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 12:13:32,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22774 states. [2025-02-05 12:13:32,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22774 to 20704. [2025-02-05 12:13:32,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20704 states, 20703 states have (on average 1.0554025986571995) internal successors, (21850), 20703 states have internal predecessors, (21850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:32,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20704 states to 20704 states and 21850 transitions. [2025-02-05 12:13:32,586 INFO L78 Accepts]: Start accepts. Automaton has 20704 states and 21850 transitions. Word has length 411 [2025-02-05 12:13:32,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:13:32,586 INFO L471 AbstractCegarLoop]: Abstraction has 20704 states and 21850 transitions. [2025-02-05 12:13:32,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:32,588 INFO L276 IsEmpty]: Start isEmpty. Operand 20704 states and 21850 transitions. [2025-02-05 12:13:32,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-02-05 12:13:32,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:13:32,593 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:13:32,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 12:13:32,594 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:13:32,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:13:32,594 INFO L85 PathProgramCache]: Analyzing trace with hash 238143646, now seen corresponding path program 1 times [2025-02-05 12:13:32,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:13:32,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437626347] [2025-02-05 12:13:32,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:13:32,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:13:32,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-02-05 12:13:32,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-02-05 12:13:32,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:13:32,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:13:32,860 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2025-02-05 12:13:32,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:13:32,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437626347] [2025-02-05 12:13:32,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437626347] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:13:32,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:13:32,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:13:32,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014204494] [2025-02-05 12:13:32,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:13:32,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:13:32,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:13:32,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:13:32,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:32,861 INFO L87 Difference]: Start difference. First operand 20704 states and 21850 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:34,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:13:34,424 INFO L93 Difference]: Finished difference Result 46236 states and 49051 transitions. [2025-02-05 12:13:34,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:13:34,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 482 [2025-02-05 12:13:34,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:13:34,526 INFO L225 Difference]: With dead ends: 46236 [2025-02-05 12:13:34,526 INFO L226 Difference]: Without dead ends: 23464 [2025-02-05 12:13:34,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:34,535 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 698 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:13:34,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 936 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:13:34,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23464 states. [2025-02-05 12:13:34,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23464 to 23464. [2025-02-05 12:13:34,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23464 states, 23463 states have (on average 1.0528065464774325) internal successors, (24702), 23463 states have internal predecessors, (24702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:34,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23464 states to 23464 states and 24702 transitions. [2025-02-05 12:13:34,751 INFO L78 Accepts]: Start accepts. Automaton has 23464 states and 24702 transitions. Word has length 482 [2025-02-05 12:13:34,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:13:34,752 INFO L471 AbstractCegarLoop]: Abstraction has 23464 states and 24702 transitions. [2025-02-05 12:13:34,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:34,753 INFO L276 IsEmpty]: Start isEmpty. Operand 23464 states and 24702 transitions. [2025-02-05 12:13:34,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2025-02-05 12:13:34,761 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:13:34,762 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:13:34,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 12:13:34,762 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:13:34,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:13:34,764 INFO L85 PathProgramCache]: Analyzing trace with hash -570339142, now seen corresponding path program 1 times [2025-02-05 12:13:34,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:13:34,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128927173] [2025-02-05 12:13:34,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:13:34,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:13:34,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 645 statements into 1 equivalence classes. [2025-02-05 12:13:34,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 645 of 645 statements. [2025-02-05 12:13:34,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:13:34,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:13:35,569 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2025-02-05 12:13:35,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:13:35,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128927173] [2025-02-05 12:13:35,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128927173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:13:35,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:13:35,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:13:35,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969822251] [2025-02-05 12:13:35,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:13:35,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:13:35,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:13:35,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:13:35,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:35,571 INFO L87 Difference]: Start difference. First operand 23464 states and 24702 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:36,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:13:36,912 INFO L93 Difference]: Finished difference Result 46926 states and 49402 transitions. [2025-02-05 12:13:36,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:13:36,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 645 [2025-02-05 12:13:36,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:13:36,932 INFO L225 Difference]: With dead ends: 46926 [2025-02-05 12:13:36,932 INFO L226 Difference]: Without dead ends: 23464 [2025-02-05 12:13:36,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:36,945 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 785 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:13:36,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 746 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 12:13:36,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23464 states. [2025-02-05 12:13:37,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23464 to 23464. [2025-02-05 12:13:37,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23464 states, 23463 states have (on average 1.046583983292844) internal successors, (24556), 23463 states have internal predecessors, (24556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23464 states to 23464 states and 24556 transitions. [2025-02-05 12:13:37,098 INFO L78 Accepts]: Start accepts. Automaton has 23464 states and 24556 transitions. Word has length 645 [2025-02-05 12:13:37,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:13:37,099 INFO L471 AbstractCegarLoop]: Abstraction has 23464 states and 24556 transitions. [2025-02-05 12:13:37,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:37,099 INFO L276 IsEmpty]: Start isEmpty. Operand 23464 states and 24556 transitions. [2025-02-05 12:13:37,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-02-05 12:13:37,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:13:37,106 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:13:37,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 12:13:37,107 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:13:37,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:13:37,108 INFO L85 PathProgramCache]: Analyzing trace with hash -578285655, now seen corresponding path program 1 times [2025-02-05 12:13:37,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:13:37,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840283817] [2025-02-05 12:13:37,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:13:37,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:13:37,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-02-05 12:13:37,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-02-05 12:13:37,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:13:37,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:13:37,421 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2025-02-05 12:13:37,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:13:37,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840283817] [2025-02-05 12:13:37,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840283817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:13:37,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:13:37,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:13:37,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045143536] [2025-02-05 12:13:37,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:13:37,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:13:37,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:13:37,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:13:37,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:37,423 INFO L87 Difference]: Start difference. First operand 23464 states and 24556 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:39,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:13:39,003 INFO L93 Difference]: Finished difference Result 56586 states and 59462 transitions. [2025-02-05 12:13:39,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:13:39,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 688 [2025-02-05 12:13:39,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:13:39,036 INFO L225 Difference]: With dead ends: 56586 [2025-02-05 12:13:39,036 INFO L226 Difference]: Without dead ends: 33124 [2025-02-05 12:13:39,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:39,054 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 681 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 2011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:13:39,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 963 Invalid, 2011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:13:39,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33124 states. [2025-02-05 12:13:39,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33124 to 31744. [2025-02-05 12:13:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31744 states, 31743 states have (on average 1.0438521878839429) internal successors, (33135), 31743 states have internal predecessors, (33135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:39,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31744 states to 31744 states and 33135 transitions. [2025-02-05 12:13:39,260 INFO L78 Accepts]: Start accepts. Automaton has 31744 states and 33135 transitions. Word has length 688 [2025-02-05 12:13:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:13:39,261 INFO L471 AbstractCegarLoop]: Abstraction has 31744 states and 33135 transitions. [2025-02-05 12:13:39,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 31744 states and 33135 transitions. [2025-02-05 12:13:39,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2025-02-05 12:13:39,268 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:13:39,268 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:13:39,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 12:13:39,269 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:13:39,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:13:39,269 INFO L85 PathProgramCache]: Analyzing trace with hash -2086171262, now seen corresponding path program 1 times [2025-02-05 12:13:39,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:13:39,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931929444] [2025-02-05 12:13:39,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:13:39,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:13:39,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 701 statements into 1 equivalence classes. [2025-02-05 12:13:39,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 701 of 701 statements. [2025-02-05 12:13:39,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:13:39,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:13:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 601 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-05 12:13:39,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:13:39,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931929444] [2025-02-05 12:13:39,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931929444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:13:39,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:13:39,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:13:39,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56070020] [2025-02-05 12:13:39,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:13:39,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:13:39,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:13:39,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:13:39,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:13:39,737 INFO L87 Difference]: Start difference. First operand 31744 states and 33135 transitions. Second operand has 4 states, 4 states have (on average 152.25) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:42,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:13:42,014 INFO L93 Difference]: Finished difference Result 71076 states and 74439 transitions. [2025-02-05 12:13:42,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:13:42,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 152.25) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 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 701 [2025-02-05 12:13:42,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:13:42,055 INFO L225 Difference]: With dead ends: 71076 [2025-02-05 12:13:42,055 INFO L226 Difference]: Without dead ends: 39334 [2025-02-05 12:13:42,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:13:42,067 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 1398 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2649 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 3098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 2649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:13:42,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1398 Valid, 94 Invalid, 3098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 2649 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 12:13:42,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39334 states. [2025-02-05 12:13:42,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39334 to 38644. [2025-02-05 12:13:42,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38644 states, 38643 states have (on average 1.0419739668245218) internal successors, (40265), 38643 states have internal predecessors, (40265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:42,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38644 states to 38644 states and 40265 transitions. [2025-02-05 12:13:42,467 INFO L78 Accepts]: Start accepts. Automaton has 38644 states and 40265 transitions. Word has length 701 [2025-02-05 12:13:42,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:13:42,468 INFO L471 AbstractCegarLoop]: Abstraction has 38644 states and 40265 transitions. [2025-02-05 12:13:42,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 152.25) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:42,468 INFO L276 IsEmpty]: Start isEmpty. Operand 38644 states and 40265 transitions. [2025-02-05 12:13:42,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1245 [2025-02-05 12:13:42,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:13:42,489 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:13:42,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 12:13:42,489 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:13:42,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:13:42,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1438367299, now seen corresponding path program 1 times [2025-02-05 12:13:42,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:13:42,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856408585] [2025-02-05 12:13:42,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:13:42,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:13:42,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1244 statements into 1 equivalence classes. [2025-02-05 12:13:42,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1244 of 1244 statements. [2025-02-05 12:13:42,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:13:42,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:13:43,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1434 backedges. 410 proven. 938 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-02-05 12:13:43,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:13:43,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856408585] [2025-02-05 12:13:43,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856408585] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:13:43,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177116403] [2025-02-05 12:13:43,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:13:43,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:13:43,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:13:43,836 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:13:43,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 12:13:43,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1244 statements into 1 equivalence classes. [2025-02-05 12:13:44,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1244 of 1244 statements. [2025-02-05 12:13:44,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:13:44,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:13:44,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 1431 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 12:13:44,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:13:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1434 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 1050 trivial. 0 not checked. [2025-02-05 12:13:44,289 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:13:44,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177116403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:13:44,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 12:13:44,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-02-05 12:13:44,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514311493] [2025-02-05 12:13:44,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:13:44,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:13:44,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:13:44,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:13:44,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 12:13:44,292 INFO L87 Difference]: Start difference. First operand 38644 states and 40265 transitions. Second operand has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:45,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:13:45,615 INFO L93 Difference]: Finished difference Result 77976 states and 81228 transitions. [2025-02-05 12:13:45,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:13:45,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 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 1244 [2025-02-05 12:13:45,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:13:45,652 INFO L225 Difference]: With dead ends: 77976 [2025-02-05 12:13:45,652 INFO L226 Difference]: Without dead ends: 38644 [2025-02-05 12:13:45,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1251 GetRequests, 1244 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 12:13:45,674 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 642 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:13:45,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 805 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 12:13:45,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38644 states. [2025-02-05 12:13:45,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38644 to 37954. [2025-02-05 12:13:45,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37954 states, 37953 states have (on average 1.0390482965773458) internal successors, (39435), 37953 states have internal predecessors, (39435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:45,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37954 states to 37954 states and 39435 transitions. [2025-02-05 12:13:45,943 INFO L78 Accepts]: Start accepts. Automaton has 37954 states and 39435 transitions. Word has length 1244 [2025-02-05 12:13:45,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:13:45,944 INFO L471 AbstractCegarLoop]: Abstraction has 37954 states and 39435 transitions. [2025-02-05 12:13:45,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:45,944 INFO L276 IsEmpty]: Start isEmpty. Operand 37954 states and 39435 transitions. [2025-02-05 12:13:45,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1296 [2025-02-05 12:13:45,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:13:45,957 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:13:45,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 12:13:46,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 12:13:46,162 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:13:46,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:13:46,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1474516063, now seen corresponding path program 1 times [2025-02-05 12:13:46,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:13:46,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971311462] [2025-02-05 12:13:46,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:13:46,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:13:46,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1295 statements into 1 equivalence classes. [2025-02-05 12:13:46,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1295 of 1295 statements. [2025-02-05 12:13:46,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:13:46,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:13:46,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 959 proven. 0 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2025-02-05 12:13:46,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:13:46,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971311462] [2025-02-05 12:13:46,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971311462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:13:46,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:13:46,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:13:46,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434087707] [2025-02-05 12:13:46,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:13:46,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:13:46,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:13:46,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:13:46,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:46,758 INFO L87 Difference]: Start difference. First operand 37954 states and 39435 transitions. Second operand has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:48,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:13:48,079 INFO L93 Difference]: Finished difference Result 88326 states and 92176 transitions. [2025-02-05 12:13:48,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:13:48,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 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 1295 [2025-02-05 12:13:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:13:48,145 INFO L225 Difference]: With dead ends: 88326 [2025-02-05 12:13:48,149 INFO L226 Difference]: Without dead ends: 51064 [2025-02-05 12:13:48,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:48,187 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 533 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1743 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:13:48,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 878 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1743 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 12:13:48,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51064 states. [2025-02-05 12:13:48,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51064 to 50374. [2025-02-05 12:13:48,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50374 states, 50373 states have (on average 1.0370039505290534) internal successors, (52237), 50373 states have internal predecessors, (52237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:48,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50374 states to 50374 states and 52237 transitions. [2025-02-05 12:13:48,705 INFO L78 Accepts]: Start accepts. Automaton has 50374 states and 52237 transitions. Word has length 1295 [2025-02-05 12:13:48,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:13:48,706 INFO L471 AbstractCegarLoop]: Abstraction has 50374 states and 52237 transitions. [2025-02-05 12:13:48,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:48,706 INFO L276 IsEmpty]: Start isEmpty. Operand 50374 states and 52237 transitions. [2025-02-05 12:13:48,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1337 [2025-02-05 12:13:48,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:13:48,733 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:13:48,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 12:13:48,733 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:13:48,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:13:48,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2064602696, now seen corresponding path program 1 times [2025-02-05 12:13:48,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:13:48,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551554151] [2025-02-05 12:13:48,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:13:48,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:13:48,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1336 statements into 1 equivalence classes. [2025-02-05 12:13:48,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1336 of 1336 statements. [2025-02-05 12:13:48,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:13:48,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:13:49,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2527 backedges. 1414 proven. 0 refuted. 0 times theorem prover too weak. 1113 trivial. 0 not checked. [2025-02-05 12:13:49,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:13:49,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551554151] [2025-02-05 12:13:49,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551554151] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:13:49,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:13:49,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 12:13:49,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186592622] [2025-02-05 12:13:49,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:13:49,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 12:13:49,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:13:49,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 12:13:49,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:13:49,911 INFO L87 Difference]: Start difference. First operand 50374 states and 52237 transitions. Second operand has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:52,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:13:52,039 INFO L93 Difference]: Finished difference Result 100157 states and 103882 transitions. [2025-02-05 12:13:52,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:13:52,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 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 1336 [2025-02-05 12:13:52,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:13:52,090 INFO L225 Difference]: With dead ends: 100157 [2025-02-05 12:13:52,090 INFO L226 Difference]: Without dead ends: 50475 [2025-02-05 12:13:52,122 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-02-05 12:13:52,122 INFO L435 NwaCegarLoop]: 934 mSDtfsCounter, 695 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 3367 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 3624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 3367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:13:52,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 953 Invalid, 3624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 3367 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 12:13:52,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50475 states. [2025-02-05 12:13:52,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50475 to 50374. [2025-02-05 12:13:52,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50374 states, 50373 states have (on average 1.0352966867170905) internal successors, (52151), 50373 states have internal predecessors, (52151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:52,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50374 states to 50374 states and 52151 transitions. [2025-02-05 12:13:52,714 INFO L78 Accepts]: Start accepts. Automaton has 50374 states and 52151 transitions. Word has length 1336 [2025-02-05 12:13:52,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:13:52,715 INFO L471 AbstractCegarLoop]: Abstraction has 50374 states and 52151 transitions. [2025-02-05 12:13:52,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:52,715 INFO L276 IsEmpty]: Start isEmpty. Operand 50374 states and 52151 transitions. [2025-02-05 12:13:52,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1348 [2025-02-05 12:13:52,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:13:52,732 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:13:52,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 12:13:52,732 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:13:52,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:13:52,733 INFO L85 PathProgramCache]: Analyzing trace with hash -732760232, now seen corresponding path program 1 times [2025-02-05 12:13:52,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:13:52,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473957122] [2025-02-05 12:13:52,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:13:52,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:13:52,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1347 statements into 1 equivalence classes. [2025-02-05 12:13:52,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1347 of 1347 statements. [2025-02-05 12:13:52,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:13:52,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:13:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2192 backedges. 556 proven. 0 refuted. 0 times theorem prover too weak. 1636 trivial. 0 not checked. [2025-02-05 12:13:53,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:13:53,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473957122] [2025-02-05 12:13:53,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473957122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:13:53,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:13:53,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:13:53,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818153938] [2025-02-05 12:13:53,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:13:53,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:13:53,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:13:53,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:13:53,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:53,506 INFO L87 Difference]: Start difference. First operand 50374 states and 52151 transitions. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:55,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:13:55,230 INFO L93 Difference]: Finished difference Result 109716 states and 113964 transitions. [2025-02-05 12:13:55,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:13:55,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 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 1347 [2025-02-05 12:13:55,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:13:55,293 INFO L225 Difference]: With dead ends: 109716 [2025-02-05 12:13:55,293 INFO L226 Difference]: Without dead ends: 60034 [2025-02-05 12:13:55,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:55,322 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 612 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:13:55,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 272 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1744 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:13:55,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60034 states. [2025-02-05 12:13:55,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60034 to 51064. [2025-02-05 12:13:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51064 states, 51063 states have (on average 1.0350155690029963) internal successors, (52851), 51063 states have internal predecessors, (52851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:55,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51064 states to 51064 states and 52851 transitions. [2025-02-05 12:13:55,903 INFO L78 Accepts]: Start accepts. Automaton has 51064 states and 52851 transitions. Word has length 1347 [2025-02-05 12:13:55,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:13:55,904 INFO L471 AbstractCegarLoop]: Abstraction has 51064 states and 52851 transitions. [2025-02-05 12:13:55,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:55,904 INFO L276 IsEmpty]: Start isEmpty. Operand 51064 states and 52851 transitions. [2025-02-05 12:13:55,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1379 [2025-02-05 12:13:55,933 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:13:55,933 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:13:55,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 12:13:55,934 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:13:55,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:13:55,934 INFO L85 PathProgramCache]: Analyzing trace with hash -942389331, now seen corresponding path program 1 times [2025-02-05 12:13:55,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:13:55,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023702665] [2025-02-05 12:13:55,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:13:55,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:13:56,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1378 statements into 1 equivalence classes. [2025-02-05 12:13:56,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1378 of 1378 statements. [2025-02-05 12:13:56,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:13:56,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:13:56,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 1956 trivial. 0 not checked. [2025-02-05 12:13:56,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:13:56,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023702665] [2025-02-05 12:13:56,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023702665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:13:56,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:13:56,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:13:56,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268395367] [2025-02-05 12:13:56,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:13:56,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:13:56,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:13:56,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:13:56,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:56,751 INFO L87 Difference]: Start difference. First operand 51064 states and 52851 transitions. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:58,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:13:58,523 INFO L93 Difference]: Finished difference Result 111786 states and 116021 transitions. [2025-02-05 12:13:58,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:13:58,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 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 1378 [2025-02-05 12:13:58,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:13:58,587 INFO L225 Difference]: With dead ends: 111786 [2025-02-05 12:13:58,587 INFO L226 Difference]: Without dead ends: 60724 [2025-02-05 12:13:58,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:58,621 INFO L435 NwaCegarLoop]: 948 mSDtfsCounter, 683 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1787 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:13:58,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 955 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1787 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:13:58,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60724 states. [2025-02-05 12:13:59,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60724 to 59344. [2025-02-05 12:13:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59344 states, 59343 states have (on average 1.0338371838296008) internal successors, (61351), 59343 states have internal predecessors, (61351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59344 states to 59344 states and 61351 transitions. [2025-02-05 12:13:59,195 INFO L78 Accepts]: Start accepts. Automaton has 59344 states and 61351 transitions. Word has length 1378 [2025-02-05 12:13:59,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:13:59,195 INFO L471 AbstractCegarLoop]: Abstraction has 59344 states and 61351 transitions. [2025-02-05 12:13:59,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:13:59,196 INFO L276 IsEmpty]: Start isEmpty. Operand 59344 states and 61351 transitions. [2025-02-05 12:13:59,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1478 [2025-02-05 12:13:59,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:13:59,220 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:13:59,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 12:13:59,220 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:13:59,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:13:59,221 INFO L85 PathProgramCache]: Analyzing trace with hash 26233819, now seen corresponding path program 1 times [2025-02-05 12:13:59,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:13:59,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857124379] [2025-02-05 12:13:59,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:13:59,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:13:59,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1477 statements into 1 equivalence classes. [2025-02-05 12:13:59,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1477 of 1477 statements. [2025-02-05 12:13:59,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:13:59,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:13:59,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 1420 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2025-02-05 12:13:59,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:13:59,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857124379] [2025-02-05 12:13:59,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857124379] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:13:59,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:13:59,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:13:59,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891580709] [2025-02-05 12:13:59,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:13:59,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:13:59,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:13:59,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:13:59,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:13:59,926 INFO L87 Difference]: Start difference. First operand 59344 states and 61351 transitions. Second operand has 3 states, 3 states have (on average 346.0) internal successors, (1038), 3 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:01,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:14:01,734 INFO L93 Difference]: Finished difference Result 142836 states and 147917 transitions. [2025-02-05 12:14:01,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:14:01,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 346.0) internal successors, (1038), 3 states have internal predecessors, (1038), 0 states have call successors, (0), 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 1477 [2025-02-05 12:14:01,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:14:01,806 INFO L225 Difference]: With dead ends: 142836 [2025-02-05 12:14:01,806 INFO L226 Difference]: Without dead ends: 83494 [2025-02-05 12:14:01,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:14:01,843 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 615 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1737 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 1737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:14:01,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 207 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 1737 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:14:01,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83494 states. [2025-02-05 12:14:02,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83494 to 83494. [2025-02-05 12:14:02,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83494 states, 83493 states have (on average 1.0311882433257877) internal successors, (86097), 83493 states have internal predecessors, (86097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:02,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83494 states to 83494 states and 86097 transitions. [2025-02-05 12:14:02,850 INFO L78 Accepts]: Start accepts. Automaton has 83494 states and 86097 transitions. Word has length 1477 [2025-02-05 12:14:02,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:14:02,851 INFO L471 AbstractCegarLoop]: Abstraction has 83494 states and 86097 transitions. [2025-02-05 12:14:02,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 346.0) internal successors, (1038), 3 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:02,851 INFO L276 IsEmpty]: Start isEmpty. Operand 83494 states and 86097 transitions. [2025-02-05 12:14:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1617 [2025-02-05 12:14:02,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:14:02,917 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:14:02,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 12:14:02,918 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:14:02,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:14:02,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1833636207, now seen corresponding path program 1 times [2025-02-05 12:14:02,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:14:02,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911233666] [2025-02-05 12:14:02,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:14:02,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:14:03,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1616 statements into 1 equivalence classes. [2025-02-05 12:14:03,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1616 of 1616 statements. [2025-02-05 12:14:03,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:14:03,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:14:04,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2598 backedges. 1157 proven. 0 refuted. 0 times theorem prover too weak. 1441 trivial. 0 not checked. [2025-02-05 12:14:04,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:14:04,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911233666] [2025-02-05 12:14:04,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911233666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:14:04,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:14:04,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:14:04,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204205933] [2025-02-05 12:14:04,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:14:04,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:14:04,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:14:04,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:14:04,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:14:04,835 INFO L87 Difference]: Start difference. First operand 83494 states and 86097 transitions. Second operand has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:06,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:14:06,597 INFO L93 Difference]: Finished difference Result 172506 states and 178135 transitions. [2025-02-05 12:14:06,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:14:06,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 0 states have call successors, (0), 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 1616 [2025-02-05 12:14:06,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:14:06,686 INFO L225 Difference]: With dead ends: 172506 [2025-02-05 12:14:06,686 INFO L226 Difference]: Without dead ends: 89704 [2025-02-05 12:14:06,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:14:06,732 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 305 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:14:06,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 809 Invalid, 2003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:14:06,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89704 states. [2025-02-05 12:14:07,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89704 to 87634. [2025-02-05 12:14:07,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87634 states, 87633 states have (on average 1.0284139536475985) internal successors, (90123), 87633 states have internal predecessors, (90123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87634 states to 87634 states and 90123 transitions. [2025-02-05 12:14:07,667 INFO L78 Accepts]: Start accepts. Automaton has 87634 states and 90123 transitions. Word has length 1616 [2025-02-05 12:14:07,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:14:07,669 INFO L471 AbstractCegarLoop]: Abstraction has 87634 states and 90123 transitions. [2025-02-05 12:14:07,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:07,669 INFO L276 IsEmpty]: Start isEmpty. Operand 87634 states and 90123 transitions. [2025-02-05 12:14:07,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1740 [2025-02-05 12:14:07,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:14:07,775 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:14:07,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 12:14:07,775 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:14:07,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:14:07,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1485711155, now seen corresponding path program 1 times [2025-02-05 12:14:07,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:14:07,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444275681] [2025-02-05 12:14:07,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:14:07,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:14:07,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1739 statements into 1 equivalence classes. [2025-02-05 12:14:07,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1739 of 1739 statements. [2025-02-05 12:14:07,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:14:07,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:14:10,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 1290 proven. 0 refuted. 0 times theorem prover too weak. 2031 trivial. 0 not checked. [2025-02-05 12:14:10,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:14:10,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444275681] [2025-02-05 12:14:10,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444275681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:14:10,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:14:10,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:14:10,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758770804] [2025-02-05 12:14:10,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:14:10,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:14:10,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:14:10,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:14:10,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:14:10,319 INFO L87 Difference]: Start difference. First operand 87634 states and 90123 transitions. Second operand has 3 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:11,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:14:11,762 INFO L93 Difference]: Finished difference Result 174576 states and 179553 transitions. [2025-02-05 12:14:11,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:14:11,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 0 states have call successors, (0), 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 1739 [2025-02-05 12:14:11,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:14:11,841 INFO L225 Difference]: With dead ends: 174576 [2025-02-05 12:14:11,842 INFO L226 Difference]: Without dead ends: 87634 [2025-02-05 12:14:11,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:14:11,891 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 311 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:14:11,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 74 Invalid, 1881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 12:14:11,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87634 states. [2025-02-05 12:14:12,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87634 to 87634. [2025-02-05 12:14:12,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87634 states, 87633 states have (on average 1.023678294706332) internal successors, (89708), 87633 states have internal predecessors, (89708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:12,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87634 states to 87634 states and 89708 transitions. [2025-02-05 12:14:12,777 INFO L78 Accepts]: Start accepts. Automaton has 87634 states and 89708 transitions. Word has length 1739 [2025-02-05 12:14:12,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:14:12,777 INFO L471 AbstractCegarLoop]: Abstraction has 87634 states and 89708 transitions. [2025-02-05 12:14:12,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:12,778 INFO L276 IsEmpty]: Start isEmpty. Operand 87634 states and 89708 transitions. [2025-02-05 12:14:12,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1998 [2025-02-05 12:14:12,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:14:12,985 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:14:12,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 12:14:12,985 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:14:12,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:14:12,987 INFO L85 PathProgramCache]: Analyzing trace with hash 325740421, now seen corresponding path program 1 times [2025-02-05 12:14:12,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:14:12,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860477859] [2025-02-05 12:14:12,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:14:12,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:14:13,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1997 statements into 1 equivalence classes. [2025-02-05 12:14:13,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1997 of 1997 statements. [2025-02-05 12:14:13,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:14:13,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:14:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3656 backedges. 2926 proven. 67 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2025-02-05 12:14:15,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:14:15,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860477859] [2025-02-05 12:14:15,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860477859] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:14:15,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961301095] [2025-02-05 12:14:15,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:14:15,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:14:15,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:14:15,675 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:14:15,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 12:14:15,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1997 statements into 1 equivalence classes. [2025-02-05 12:14:16,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1997 of 1997 statements. [2025-02-05 12:14:16,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:14:16,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:14:16,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 2246 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 12:14:16,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:14:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3656 backedges. 2488 proven. 0 refuted. 0 times theorem prover too weak. 1168 trivial. 0 not checked. [2025-02-05 12:14:16,213 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:14:16,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961301095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:14:16,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 12:14:16,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 12:14:16,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141257653] [2025-02-05 12:14:16,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:14:16,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:14:16,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:14:16,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:14:16,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:14:16,217 INFO L87 Difference]: Start difference. First operand 87634 states and 89708 transitions. Second operand has 3 states, 3 states have (on average 353.0) internal successors, (1059), 3 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:18,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:14:18,121 INFO L93 Difference]: Finished difference Result 175266 states and 179429 transitions. [2025-02-05 12:14:18,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:14:18,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 353.0) internal successors, (1059), 3 states have internal predecessors, (1059), 0 states have call successors, (0), 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 1997 [2025-02-05 12:14:18,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:14:18,220 INFO L225 Difference]: With dead ends: 175266 [2025-02-05 12:14:18,221 INFO L226 Difference]: Without dead ends: 88324 [2025-02-05 12:14:18,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2002 GetRequests, 1998 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:14:18,288 INFO L435 NwaCegarLoop]: 927 mSDtfsCounter, 612 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:14:18,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 934 Invalid, 1923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1735 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:14:18,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88324 states. [2025-02-05 12:14:19,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88324 to 88324. [2025-02-05 12:14:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88324 states, 88323 states have (on average 1.0193607554091233) internal successors, (90033), 88323 states have internal predecessors, (90033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:19,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88324 states to 88324 states and 90033 transitions. [2025-02-05 12:14:19,338 INFO L78 Accepts]: Start accepts. Automaton has 88324 states and 90033 transitions. Word has length 1997 [2025-02-05 12:14:19,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:14:19,339 INFO L471 AbstractCegarLoop]: Abstraction has 88324 states and 90033 transitions. [2025-02-05 12:14:19,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 353.0) internal successors, (1059), 3 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:19,339 INFO L276 IsEmpty]: Start isEmpty. Operand 88324 states and 90033 transitions. [2025-02-05 12:14:19,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2019 [2025-02-05 12:14:19,391 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:14:19,392 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:14:19,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 12:14:19,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:14:19,596 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:14:19,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:14:19,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1610332393, now seen corresponding path program 1 times [2025-02-05 12:14:19,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:14:19,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152683423] [2025-02-05 12:14:19,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:14:19,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:14:19,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2018 statements into 1 equivalence classes. [2025-02-05 12:14:19,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2018 of 2018 statements. [2025-02-05 12:14:19,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:14:19,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:14:21,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3761 backedges. 2737 proven. 0 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2025-02-05 12:14:21,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:14:21,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152683423] [2025-02-05 12:14:21,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152683423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:14:21,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:14:21,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:14:21,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196066658] [2025-02-05 12:14:21,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:14:21,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:14:21,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:14:21,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:14:21,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:14:21,766 INFO L87 Difference]: Start difference. First operand 88324 states and 90033 transitions. Second operand has 4 states, 4 states have (on average 286.5) internal successors, (1146), 4 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:24,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:14:24,794 INFO L93 Difference]: Finished difference Result 207006 states and 211301 transitions. [2025-02-05 12:14:24,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:14:24,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 286.5) internal successors, (1146), 4 states have internal predecessors, (1146), 0 states have call successors, (0), 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 2018 [2025-02-05 12:14:24,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:14:24,907 INFO L225 Difference]: With dead ends: 207006 [2025-02-05 12:14:24,907 INFO L226 Difference]: Without dead ends: 119374 [2025-02-05 12:14:24,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:14:24,968 INFO L435 NwaCegarLoop]: 931 mSDtfsCounter, 1244 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4262 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 4501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 4262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:14:24,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 949 Invalid, 4501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 4262 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 12:14:25,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119374 states. [2025-02-05 12:14:26,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119374 to 117994. [2025-02-05 12:14:26,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117994 states, 117993 states have (on average 1.018407871653403) internal successors, (120165), 117993 states have internal predecessors, (120165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117994 states to 117994 states and 120165 transitions. [2025-02-05 12:14:26,221 INFO L78 Accepts]: Start accepts. Automaton has 117994 states and 120165 transitions. Word has length 2018 [2025-02-05 12:14:26,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:14:26,225 INFO L471 AbstractCegarLoop]: Abstraction has 117994 states and 120165 transitions. [2025-02-05 12:14:26,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 286.5) internal successors, (1146), 4 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:14:26,225 INFO L276 IsEmpty]: Start isEmpty. Operand 117994 states and 120165 transitions. [2025-02-05 12:14:26,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2178 [2025-02-05 12:14:26,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:14:26,328 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:14:26,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 12:14:26,328 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:14:26,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:14:26,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2109880899, now seen corresponding path program 1 times [2025-02-05 12:14:26,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:14:26,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213171283] [2025-02-05 12:14:26,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:14:26,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:14:26,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2177 statements into 1 equivalence classes. [2025-02-05 12:14:26,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2177 of 2177 statements. [2025-02-05 12:14:26,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:14:26,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:14:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 1920 proven. 1924 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2025-02-05 12:14:31,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:14:31,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213171283] [2025-02-05 12:14:31,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213171283] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:14:31,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831082924] [2025-02-05 12:14:31,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:14:31,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:14:31,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:14:31,625 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:14:31,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 12:14:31,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2177 statements into 1 equivalence classes. [2025-02-05 12:14:32,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2177 of 2177 statements. [2025-02-05 12:14:32,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:14:32,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:14:32,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 2424 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:14:32,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:14:32,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 3338 proven. 67 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2025-02-05 12:14:32,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:14:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4429 backedges. 2735 proven. 0 refuted. 0 times theorem prover too weak. 1694 trivial. 0 not checked. [2025-02-05 12:14:32,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831082924] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:14:32,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:14:32,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 4] total 10 [2025-02-05 12:14:32,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924429505] [2025-02-05 12:14:32,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:14:32,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:14:32,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:14:32,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:14:32,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-05 12:14:32,500 INFO L87 Difference]: Start difference. First operand 117994 states and 120165 transitions. Second operand has 3 states, 3 states have (on average 346.6666666666667) internal successors, (1040), 3 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)