./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de52c08fb0028bef519c22f81b06d40dd6144270e7f5fea59e5bb117b888da23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:12:59,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:12:59,767 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:12:59,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:12:59,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:12:59,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:12:59,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:12:59,793 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:12:59,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:12:59,794 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:12:59,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:12:59,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:12:59,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:12:59,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:12:59,795 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:12:59,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:12:59,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:12:59,796 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:12:59,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:12:59,796 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:12:59,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:12:59,796 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:12:59,796 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:12:59,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:12:59,796 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:12:59,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:12:59,796 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:12:59,797 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:12:59,797 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:12:59,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:12:59,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:12:59,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:12:59,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:12:59,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:12:59,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:12:59,798 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:12:59,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:12:59,798 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:12:59,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:12:59,798 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:12:59,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:12:59,798 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:12:59,798 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:12:59,798 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de52c08fb0028bef519c22f81b06d40dd6144270e7f5fea59e5bb117b888da23 [2025-03-04 00:12:59,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:13:00,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:13:00,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:13:00,004 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:13:00,004 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:13:00,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i [2025-03-04 00:13:01,142 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94b65644f/b2fc3f37a8d54514a973d391acbdf878/FLAGa9426a1f5 [2025-03-04 00:13:01,402 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:13:01,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i [2025-03-04 00:13:01,410 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94b65644f/b2fc3f37a8d54514a973d391acbdf878/FLAGa9426a1f5 [2025-03-04 00:13:01,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94b65644f/b2fc3f37a8d54514a973d391acbdf878 [2025-03-04 00:13:01,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:13:01,722 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:13:01,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:13:01,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:13:01,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:13:01,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:13:01" (1/1) ... [2025-03-04 00:13:01,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26bcd721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:01, skipping insertion in model container [2025-03-04 00:13:01,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:13:01" (1/1) ... [2025-03-04 00:13:01,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:13:01,844 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i[916,929] [2025-03-04 00:13:01,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:13:01,949 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:13:01,956 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i[916,929] [2025-03-04 00:13:02,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:13:02,016 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:13:02,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:02 WrapperNode [2025-03-04 00:13:02,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:13:02,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:13:02,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:13:02,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:13:02,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:02" (1/1) ... [2025-03-04 00:13:02,038 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:02" (1/1) ... [2025-03-04 00:13:02,067 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 367 [2025-03-04 00:13:02,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:13:02,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:13:02,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:13:02,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:13:02,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:02" (1/1) ... [2025-03-04 00:13:02,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:02" (1/1) ... [2025-03-04 00:13:02,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:02" (1/1) ... [2025-03-04 00:13:02,108 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:13:02,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:02" (1/1) ... [2025-03-04 00:13:02,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:02" (1/1) ... [2025-03-04 00:13:02,118 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:02" (1/1) ... [2025-03-04 00:13:02,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:02" (1/1) ... [2025-03-04 00:13:02,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:02" (1/1) ... [2025-03-04 00:13:02,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:02" (1/1) ... [2025-03-04 00:13:02,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:13:02,145 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:13:02,145 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:13:02,145 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:13:02,146 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:02" (1/1) ... [2025-03-04 00:13:02,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:13:02,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:02,174 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:13:02,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:13:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:13:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:13:02,196 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:13:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:13:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:13:02,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:13:02,293 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:13:02,295 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:13:02,819 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L345: havoc property_#t~bitwise34#1;havoc property_#t~short35#1; [2025-03-04 00:13:02,874 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-03-04 00:13:02,875 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:13:02,892 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:13:02,894 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:13:02,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:13:02 BoogieIcfgContainer [2025-03-04 00:13:02,894 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:13:02,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:13:02,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:13:02,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:13:02,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:13:01" (1/3) ... [2025-03-04 00:13:02,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1033e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:13:02, skipping insertion in model container [2025-03-04 00:13:02,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:02" (2/3) ... [2025-03-04 00:13:02,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1033e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:13:02, skipping insertion in model container [2025-03-04 00:13:02,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:13:02" (3/3) ... [2025-03-04 00:13:02,903 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-56.i [2025-03-04 00:13:02,914 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:13:02,916 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-56.i that has 2 procedures, 156 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:13:02,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:13:02,973 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;@37c692b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:13:02,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:13:02,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 156 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 104 states have internal predecessors, (152), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-04 00:13:02,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-04 00:13:02,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:02,990 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:13:02,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:02,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:02,994 INFO L85 PathProgramCache]: Analyzing trace with hash -681760163, now seen corresponding path program 1 times [2025-03-04 00:13:02,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:03,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930555779] [2025-03-04 00:13:03,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:03,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:03,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-04 00:13:03,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-04 00:13:03,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:03,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:03,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-03-04 00:13:03,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:03,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930555779] [2025-03-04 00:13:03,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930555779] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:13:03,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523852624] [2025-03-04 00:13:03,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:03,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:03,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:03,455 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:13:03,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:13:03,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-04 00:13:03,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-04 00:13:03,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:03,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:03,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:13:03,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:13:03,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-03-04 00:13:03,730 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:13:03,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523852624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:03,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:13:03,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:13:03,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300581670] [2025-03-04 00:13:03,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:03,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:13:03,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:03,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:13:03,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:13:03,761 INFO L87 Difference]: Start difference. First operand has 156 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 104 states have internal predecessors, (152), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-04 00:13:03,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:03,804 INFO L93 Difference]: Finished difference Result 303 states and 543 transitions. [2025-03-04 00:13:03,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:13:03,806 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 324 [2025-03-04 00:13:03,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:03,811 INFO L225 Difference]: With dead ends: 303 [2025-03-04 00:13:03,812 INFO L226 Difference]: Without dead ends: 150 [2025-03-04 00:13:03,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:13:03,816 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:03,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:13:03,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-04 00:13:03,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-03-04 00:13:03,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 98 states have internal predecessors, (140), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-04 00:13:03,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 240 transitions. [2025-03-04 00:13:03,870 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 240 transitions. Word has length 324 [2025-03-04 00:13:03,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:03,871 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 240 transitions. [2025-03-04 00:13:03,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-04 00:13:03,872 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 240 transitions. [2025-03-04 00:13:03,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-04 00:13:03,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:03,878 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:13:03,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:13:04,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:13:04,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:04,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:04,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2032726745, now seen corresponding path program 1 times [2025-03-04 00:13:04,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:04,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082513456] [2025-03-04 00:13:04,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:04,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:04,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-04 00:13:04,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-04 00:13:04,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:04,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-04 00:13:04,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:04,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082513456] [2025-03-04 00:13:04,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082513456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:04,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:13:04,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:13:04,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607866720] [2025-03-04 00:13:04,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:04,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:13:04,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:04,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:13:04,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:13:04,394 INFO L87 Difference]: Start difference. First operand 150 states and 240 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-04 00:13:04,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:04,522 INFO L93 Difference]: Finished difference Result 438 states and 703 transitions. [2025-03-04 00:13:04,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:13:04,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 324 [2025-03-04 00:13:04,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:04,528 INFO L225 Difference]: With dead ends: 438 [2025-03-04 00:13:04,529 INFO L226 Difference]: Without dead ends: 291 [2025-03-04 00:13:04,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:13:04,532 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 211 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:04,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 620 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:13:04,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-04 00:13:04,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 190. [2025-03-04 00:13:04,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 138 states have (on average 1.4855072463768115) internal successors, (205), 138 states have internal predecessors, (205), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-04 00:13:04,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 305 transitions. [2025-03-04 00:13:04,562 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 305 transitions. Word has length 324 [2025-03-04 00:13:04,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:04,563 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 305 transitions. [2025-03-04 00:13:04,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-04 00:13:04,563 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 305 transitions. [2025-03-04 00:13:04,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-04 00:13:04,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:04,569 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:13:04,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:13:04,569 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:04,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:04,570 INFO L85 PathProgramCache]: Analyzing trace with hash -82426490, now seen corresponding path program 1 times [2025-03-04 00:13:04,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:04,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310133200] [2025-03-04 00:13:04,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:04,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:04,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-04 00:13:04,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-04 00:13:04,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:04,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:04,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-04 00:13:04,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:04,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310133200] [2025-03-04 00:13:04,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310133200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:04,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:13:04,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:13:04,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631541972] [2025-03-04 00:13:04,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:04,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:13:04,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:04,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:13:04,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:13:04,826 INFO L87 Difference]: Start difference. First operand 190 states and 305 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-04 00:13:04,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:04,910 INFO L93 Difference]: Finished difference Result 560 states and 901 transitions. [2025-03-04 00:13:04,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:13:04,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 324 [2025-03-04 00:13:04,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:04,914 INFO L225 Difference]: With dead ends: 560 [2025-03-04 00:13:04,914 INFO L226 Difference]: Without dead ends: 373 [2025-03-04 00:13:04,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:13:04,915 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 214 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:04,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 445 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:13:04,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-04 00:13:04,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 247. [2025-03-04 00:13:04,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 195 states have (on average 1.5179487179487179) internal successors, (296), 195 states have internal predecessors, (296), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-04 00:13:04,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 396 transitions. [2025-03-04 00:13:04,945 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 396 transitions. Word has length 324 [2025-03-04 00:13:04,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:04,946 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 396 transitions. [2025-03-04 00:13:04,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-04 00:13:04,946 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 396 transitions. [2025-03-04 00:13:04,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-04 00:13:04,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:04,951 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:13:04,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:13:04,951 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:04,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:04,952 INFO L85 PathProgramCache]: Analyzing trace with hash -983359990, now seen corresponding path program 1 times [2025-03-04 00:13:04,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:04,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487592382] [2025-03-04 00:13:04,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:04,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:04,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-04 00:13:05,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-04 00:13:05,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:05,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:05,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-04 00:13:05,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:05,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487592382] [2025-03-04 00:13:05,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487592382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:05,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:13:05,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:13:05,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72690117] [2025-03-04 00:13:05,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:05,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:13:05,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:05,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:13:05,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:13:05,738 INFO L87 Difference]: Start difference. First operand 247 states and 396 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-04 00:13:06,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:06,150 INFO L93 Difference]: Finished difference Result 791 states and 1261 transitions. [2025-03-04 00:13:06,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:13:06,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 325 [2025-03-04 00:13:06,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:06,154 INFO L225 Difference]: With dead ends: 791 [2025-03-04 00:13:06,154 INFO L226 Difference]: Without dead ends: 547 [2025-03-04 00:13:06,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-03-04 00:13:06,155 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 410 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:06,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 744 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:13:06,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-04 00:13:06,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 466. [2025-03-04 00:13:06,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 377 states have (on average 1.530503978779841) internal successors, (577), 378 states have internal predecessors, (577), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-04 00:13:06,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 749 transitions. [2025-03-04 00:13:06,202 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 749 transitions. Word has length 325 [2025-03-04 00:13:06,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:06,202 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 749 transitions. [2025-03-04 00:13:06,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-04 00:13:06,203 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 749 transitions. [2025-03-04 00:13:06,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-04 00:13:06,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:06,205 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:13:06,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:13:06,206 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:06,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:06,206 INFO L85 PathProgramCache]: Analyzing trace with hash 649444009, now seen corresponding path program 1 times [2025-03-04 00:13:06,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:06,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862000696] [2025-03-04 00:13:06,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:06,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:06,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-04 00:13:06,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-04 00:13:06,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:06,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-04 00:13:07,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:07,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862000696] [2025-03-04 00:13:07,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862000696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:07,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:13:07,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:13:07,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770452687] [2025-03-04 00:13:07,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:07,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:13:07,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:07,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:13:07,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:13:07,018 INFO L87 Difference]: Start difference. First operand 466 states and 749 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-04 00:13:07,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:07,462 INFO L93 Difference]: Finished difference Result 1010 states and 1613 transitions. [2025-03-04 00:13:07,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:13:07,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 325 [2025-03-04 00:13:07,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:07,467 INFO L225 Difference]: With dead ends: 1010 [2025-03-04 00:13:07,467 INFO L226 Difference]: Without dead ends: 547 [2025-03-04 00:13:07,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:13:07,469 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 370 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:07,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 889 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:13:07,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-04 00:13:07,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 466. [2025-03-04 00:13:07,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 377 states have (on average 1.5172413793103448) internal successors, (572), 378 states have internal predecessors, (572), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-04 00:13:07,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 744 transitions. [2025-03-04 00:13:07,504 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 744 transitions. Word has length 325 [2025-03-04 00:13:07,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:07,506 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 744 transitions. [2025-03-04 00:13:07,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-04 00:13:07,507 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 744 transitions. [2025-03-04 00:13:07,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-04 00:13:07,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:07,512 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:13:07,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:13:07,512 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:07,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:07,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1920042390, now seen corresponding path program 1 times [2025-03-04 00:13:07,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:07,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757245730] [2025-03-04 00:13:07,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:07,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:07,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-04 00:13:07,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-04 00:13:07,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:07,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:08,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-04 00:13:08,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:08,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757245730] [2025-03-04 00:13:08,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757245730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:08,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:13:08,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:13:08,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682766137] [2025-03-04 00:13:08,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:08,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:13:08,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:08,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:13:08,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:13:08,198 INFO L87 Difference]: Start difference. First operand 466 states and 744 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-04 00:13:08,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:08,633 INFO L93 Difference]: Finished difference Result 1010 states and 1603 transitions. [2025-03-04 00:13:08,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:13:08,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 325 [2025-03-04 00:13:08,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:08,638 INFO L225 Difference]: With dead ends: 1010 [2025-03-04 00:13:08,639 INFO L226 Difference]: Without dead ends: 547 [2025-03-04 00:13:08,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:13:08,642 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 451 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:08,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 865 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:13:08,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-04 00:13:08,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 466. [2025-03-04 00:13:08,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 377 states have (on average 1.5145888594164456) internal successors, (571), 378 states have internal predecessors, (571), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-04 00:13:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 743 transitions. [2025-03-04 00:13:08,675 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 743 transitions. Word has length 325 [2025-03-04 00:13:08,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:08,676 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 743 transitions. [2025-03-04 00:13:08,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-04 00:13:08,676 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 743 transitions. [2025-03-04 00:13:08,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-04 00:13:08,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:08,680 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:13:08,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:13:08,680 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:08,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:08,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1569242453, now seen corresponding path program 1 times [2025-03-04 00:13:08,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:08,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520053122] [2025-03-04 00:13:08,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:08,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:08,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-04 00:13:08,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-04 00:13:08,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:08,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:10,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-04 00:13:10,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:10,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520053122] [2025-03-04 00:13:10,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520053122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:10,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:13:10,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:13:10,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680122187] [2025-03-04 00:13:10,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:10,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:13:10,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:10,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:13:10,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:13:10,083 INFO L87 Difference]: Start difference. First operand 466 states and 743 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-04 00:13:14,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 00:13:18,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 00:13:22,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 00:13:23,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:23,679 INFO L93 Difference]: Finished difference Result 2043 states and 3254 transitions. [2025-03-04 00:13:23,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:13:23,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 325 [2025-03-04 00:13:23,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:23,689 INFO L225 Difference]: With dead ends: 2043 [2025-03-04 00:13:23,689 INFO L226 Difference]: Without dead ends: 1580 [2025-03-04 00:13:23,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:13:23,693 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 772 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 251 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:23,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1382 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 966 Invalid, 3 Unknown, 0 Unchecked, 13.4s Time] [2025-03-04 00:13:23,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2025-03-04 00:13:23,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1559. [2025-03-04 00:13:23,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1206 states have (on average 1.494195688225539) internal successors, (1802), 1210 states have internal predecessors, (1802), 344 states have call successors, (344), 8 states have call predecessors, (344), 8 states have return successors, (344), 340 states have call predecessors, (344), 344 states have call successors, (344) [2025-03-04 00:13:23,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2490 transitions. [2025-03-04 00:13:23,808 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2490 transitions. Word has length 325 [2025-03-04 00:13:23,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:23,808 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2490 transitions. [2025-03-04 00:13:23,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-04 00:13:23,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2490 transitions. [2025-03-04 00:13:23,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-04 00:13:23,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:23,812 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:13:23,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:13:23,812 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:23,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:23,812 INFO L85 PathProgramCache]: Analyzing trace with hash 857044838, now seen corresponding path program 1 times [2025-03-04 00:13:23,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:23,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869328400] [2025-03-04 00:13:23,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:23,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:23,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-04 00:13:23,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-04 00:13:23,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:23,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:25,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-04 00:13:25,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:25,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869328400] [2025-03-04 00:13:25,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869328400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:25,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:13:25,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:13:25,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555461616] [2025-03-04 00:13:25,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:25,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:13:25,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:25,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:13:25,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:13:25,084 INFO L87 Difference]: Start difference. First operand 1559 states and 2490 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-04 00:13:26,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:26,364 INFO L93 Difference]: Finished difference Result 3855 states and 6155 transitions. [2025-03-04 00:13:26,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:13:26,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 325 [2025-03-04 00:13:26,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:26,378 INFO L225 Difference]: With dead ends: 3855 [2025-03-04 00:13:26,378 INFO L226 Difference]: Without dead ends: 2299 [2025-03-04 00:13:26,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:13:26,383 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 548 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:26,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 996 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 00:13:26,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2025-03-04 00:13:26,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 2285. [2025-03-04 00:13:26,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2285 states, 1756 states have (on average 1.4908883826879271) internal successors, (2618), 1762 states have internal predecessors, (2618), 516 states have call successors, (516), 12 states have call predecessors, (516), 12 states have return successors, (516), 510 states have call predecessors, (516), 516 states have call successors, (516) [2025-03-04 00:13:26,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 3650 transitions. [2025-03-04 00:13:26,509 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 3650 transitions. Word has length 325 [2025-03-04 00:13:26,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:26,510 INFO L471 AbstractCegarLoop]: Abstraction has 2285 states and 3650 transitions. [2025-03-04 00:13:26,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-04 00:13:26,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 3650 transitions. [2025-03-04 00:13:26,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-04 00:13:26,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:26,513 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:13:26,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:13:26,514 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:26,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:26,514 INFO L85 PathProgramCache]: Analyzing trace with hash 478220009, now seen corresponding path program 1 times [2025-03-04 00:13:26,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:26,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268148736] [2025-03-04 00:13:26,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:26,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:26,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-04 00:13:26,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-04 00:13:26,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:26,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:26,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-04 00:13:26,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:26,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268148736] [2025-03-04 00:13:26,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268148736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:26,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:13:26,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:13:26,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008887069] [2025-03-04 00:13:26,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:26,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:13:26,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:26,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:13:26,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:13:26,976 INFO L87 Difference]: Start difference. First operand 2285 states and 3650 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-04 00:13:27,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:27,488 INFO L93 Difference]: Finished difference Result 4918 states and 7834 transitions. [2025-03-04 00:13:27,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:13:27,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 325 [2025-03-04 00:13:27,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:27,503 INFO L225 Difference]: With dead ends: 4918 [2025-03-04 00:13:27,504 INFO L226 Difference]: Without dead ends: 2636 [2025-03-04 00:13:27,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-03-04 00:13:27,512 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 430 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:27,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1027 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:13:27,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-03-04 00:13:27,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2459. [2025-03-04 00:13:27,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 1828 states have (on average 1.4715536105032823) internal successors, (2690), 1835 states have internal predecessors, (2690), 612 states have call successors, (612), 18 states have call predecessors, (612), 18 states have return successors, (612), 605 states have call predecessors, (612), 612 states have call successors, (612) [2025-03-04 00:13:27,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 3914 transitions. [2025-03-04 00:13:27,667 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 3914 transitions. Word has length 325 [2025-03-04 00:13:27,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:27,668 INFO L471 AbstractCegarLoop]: Abstraction has 2459 states and 3914 transitions. [2025-03-04 00:13:27,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-04 00:13:27,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 3914 transitions. [2025-03-04 00:13:27,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-04 00:13:27,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:27,671 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:13:27,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:13:27,671 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:27,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:27,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2111024008, now seen corresponding path program 1 times [2025-03-04 00:13:27,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:27,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039385988] [2025-03-04 00:13:27,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:27,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:27,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-04 00:13:27,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-04 00:13:27,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:27,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:28,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-04 00:13:28,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:28,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039385988] [2025-03-04 00:13:28,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039385988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:28,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:13:28,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:13:28,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453375411] [2025-03-04 00:13:28,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:28,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:13:28,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:28,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:13:28,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:13:28,151 INFO L87 Difference]: Start difference. First operand 2459 states and 3914 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-04 00:13:28,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:28,914 INFO L93 Difference]: Finished difference Result 4747 states and 7541 transitions. [2025-03-04 00:13:28,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:13:28,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 325 [2025-03-04 00:13:28,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:28,930 INFO L225 Difference]: With dead ends: 4747 [2025-03-04 00:13:28,931 INFO L226 Difference]: Without dead ends: 2350 [2025-03-04 00:13:28,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:13:28,938 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 469 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:28,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 929 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:13:28,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2025-03-04 00:13:29,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2171. [2025-03-04 00:13:29,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2171 states, 1576 states have (on average 1.4378172588832487) internal successors, (2266), 1582 states have internal predecessors, (2266), 576 states have call successors, (576), 18 states have call predecessors, (576), 18 states have return successors, (576), 570 states have call predecessors, (576), 576 states have call successors, (576) [2025-03-04 00:13:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 3418 transitions. [2025-03-04 00:13:29,085 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 3418 transitions. Word has length 325 [2025-03-04 00:13:29,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:29,085 INFO L471 AbstractCegarLoop]: Abstraction has 2171 states and 3418 transitions. [2025-03-04 00:13:29,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-04 00:13:29,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3418 transitions. [2025-03-04 00:13:29,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-04 00:13:29,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:29,089 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:13:29,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:13:29,089 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:29,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:29,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1822661304, now seen corresponding path program 1 times [2025-03-04 00:13:29,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:29,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640296645] [2025-03-04 00:13:29,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:29,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:29,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-04 00:13:29,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-04 00:13:29,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:29,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:30,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-04 00:13:30,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:30,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640296645] [2025-03-04 00:13:30,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640296645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:30,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:13:30,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:13:30,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525021672] [2025-03-04 00:13:30,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:30,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:13:30,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:30,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:13:30,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:13:30,158 INFO L87 Difference]: Start difference. First operand 2171 states and 3418 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-04 00:13:31,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:31,400 INFO L93 Difference]: Finished difference Result 3522 states and 5539 transitions. [2025-03-04 00:13:31,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:13:31,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 326 [2025-03-04 00:13:31,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:31,415 INFO L225 Difference]: With dead ends: 3522 [2025-03-04 00:13:31,415 INFO L226 Difference]: Without dead ends: 3039 [2025-03-04 00:13:31,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:13:31,418 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 395 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:31,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1328 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 00:13:31,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3039 states. [2025-03-04 00:13:31,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3039 to 2012. [2025-03-04 00:13:31,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2012 states, 1516 states have (on average 1.4538258575197889) internal successors, (2204), 1521 states have internal predecessors, (2204), 480 states have call successors, (480), 15 states have call predecessors, (480), 15 states have return successors, (480), 475 states have call predecessors, (480), 480 states have call successors, (480) [2025-03-04 00:13:31,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 3164 transitions. [2025-03-04 00:13:31,606 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 3164 transitions. Word has length 326 [2025-03-04 00:13:31,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:31,607 INFO L471 AbstractCegarLoop]: Abstraction has 2012 states and 3164 transitions. [2025-03-04 00:13:31,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-04 00:13:31,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 3164 transitions. [2025-03-04 00:13:31,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-04 00:13:31,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:31,611 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:13:31,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:13:31,611 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:31,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:31,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1987749710, now seen corresponding path program 1 times [2025-03-04 00:13:31,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:31,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635507194] [2025-03-04 00:13:31,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:31,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:31,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-04 00:13:31,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-04 00:13:31,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:31,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-04 00:13:32,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:32,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635507194] [2025-03-04 00:13:32,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635507194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:32,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:13:32,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:13:32,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555673111] [2025-03-04 00:13:32,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:32,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:13:32,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:32,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:13:32,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:13:32,522 INFO L87 Difference]: Start difference. First operand 2012 states and 3164 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-04 00:13:33,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:33,165 INFO L93 Difference]: Finished difference Result 4703 states and 7396 transitions. [2025-03-04 00:13:33,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:13:33,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 326 [2025-03-04 00:13:33,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:33,180 INFO L225 Difference]: With dead ends: 4703 [2025-03-04 00:13:33,181 INFO L226 Difference]: Without dead ends: 2694 [2025-03-04 00:13:33,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-03-04 00:13:33,187 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 222 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:33,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 522 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:13:33,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2025-03-04 00:13:33,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 951. [2025-03-04 00:13:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 752 states have (on average 1.476063829787234) internal successors, (1110), 754 states have internal predecessors, (1110), 192 states have call successors, (192), 6 states have call predecessors, (192), 6 states have return successors, (192), 190 states have call predecessors, (192), 192 states have call successors, (192) [2025-03-04 00:13:33,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1494 transitions. [2025-03-04 00:13:33,312 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1494 transitions. Word has length 326 [2025-03-04 00:13:33,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:33,313 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1494 transitions. [2025-03-04 00:13:33,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-04 00:13:33,313 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1494 transitions. [2025-03-04 00:13:33,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-04 00:13:33,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:33,315 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:13:33,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:13:33,315 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:33,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:33,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1947233529, now seen corresponding path program 1 times [2025-03-04 00:13:33,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:33,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751690308] [2025-03-04 00:13:33,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:33,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:33,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-04 00:13:33,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-04 00:13:33,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:33,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:33,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 108 proven. 39 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-04 00:13:33,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:33,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751690308] [2025-03-04 00:13:33,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751690308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:13:33,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620639060] [2025-03-04 00:13:33,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:33,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:33,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:33,849 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:13:33,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:13:33,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-04 00:13:34,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-04 00:13:34,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:34,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:34,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 00:13:34,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:13:34,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2074 proven. 39 refuted. 0 times theorem prover too weak. 2787 trivial. 0 not checked. [2025-03-04 00:13:34,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:13:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 108 proven. 39 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-04 00:13:34,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620639060] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:13:34,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:13:34,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 8] total 18 [2025-03-04 00:13:34,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021313463] [2025-03-04 00:13:34,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:13:34,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 00:13:34,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:34,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 00:13:34,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:13:34,733 INFO L87 Difference]: Start difference. First operand 951 states and 1494 transitions. Second operand has 18 states, 18 states have (on average 7.166666666666667) internal successors, (129), 18 states have internal predecessors, (129), 4 states have call successors, (76), 3 states have call predecessors, (76), 6 states have return successors, (77), 4 states have call predecessors, (77), 4 states have call successors, (77) [2025-03-04 00:13:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:40,201 INFO L93 Difference]: Finished difference Result 3165 states and 4766 transitions. [2025-03-04 00:13:40,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-03-04 00:13:40,205 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.166666666666667) internal successors, (129), 18 states have internal predecessors, (129), 4 states have call successors, (76), 3 states have call predecessors, (76), 6 states have return successors, (77), 4 states have call predecessors, (77), 4 states have call successors, (77) Word has length 326 [2025-03-04 00:13:40,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:40,218 INFO L225 Difference]: With dead ends: 3165 [2025-03-04 00:13:40,218 INFO L226 Difference]: Without dead ends: 2217 [2025-03-04 00:13:40,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 653 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=906, Invalid=5100, Unknown=0, NotChecked=0, Total=6006 [2025-03-04 00:13:40,223 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 1598 mSDsluCounter, 3769 mSDsCounter, 0 mSdLazyCounter, 4093 mSolverCounterSat, 893 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1638 SdHoareTripleChecker+Valid, 4399 SdHoareTripleChecker+Invalid, 4986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 893 IncrementalHoareTripleChecker+Valid, 4093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:40,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1638 Valid, 4399 Invalid, 4986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [893 Valid, 4093 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 00:13:40,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2025-03-04 00:13:40,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 871. [2025-03-04 00:13:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 652 states have (on average 1.366564417177914) internal successors, (891), 654 states have internal predecessors, (891), 200 states have call successors, (200), 18 states have call predecessors, (200), 18 states have return successors, (200), 198 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-04 00:13:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1291 transitions. [2025-03-04 00:13:40,337 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1291 transitions. Word has length 326 [2025-03-04 00:13:40,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:40,338 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1291 transitions. [2025-03-04 00:13:40,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.166666666666667) internal successors, (129), 18 states have internal predecessors, (129), 4 states have call successors, (76), 3 states have call predecessors, (76), 6 states have return successors, (77), 4 states have call predecessors, (77), 4 states have call successors, (77) [2025-03-04 00:13:40,338 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1291 transitions. [2025-03-04 00:13:40,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-04 00:13:40,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:40,341 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:13:40,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:13:40,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 00:13:40,542 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:40,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:40,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1872789975, now seen corresponding path program 1 times [2025-03-04 00:13:40,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:40,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618971220] [2025-03-04 00:13:40,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:40,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:40,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-04 00:13:40,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-04 00:13:40,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:40,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-04 00:13:40,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:40,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618971220] [2025-03-04 00:13:40,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618971220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:40,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:13:40,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:13:40,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296697789] [2025-03-04 00:13:40,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:40,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:13:40,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:40,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:13:40,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:13:40,881 INFO L87 Difference]: Start difference. First operand 871 states and 1291 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-04 00:13:41,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:41,573 INFO L93 Difference]: Finished difference Result 1883 states and 2784 transitions. [2025-03-04 00:13:41,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:13:41,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 326 [2025-03-04 00:13:41,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:41,580 INFO L225 Difference]: With dead ends: 1883 [2025-03-04 00:13:41,580 INFO L226 Difference]: Without dead ends: 1015 [2025-03-04 00:13:41,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:13:41,587 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 503 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:41,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 742 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:13:41,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2025-03-04 00:13:41,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 813. [2025-03-04 00:13:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 594 states have (on average 1.3468013468013469) internal successors, (800), 596 states have internal predecessors, (800), 200 states have call successors, (200), 18 states have call predecessors, (200), 18 states have return successors, (200), 198 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-04 00:13:41,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1200 transitions. [2025-03-04 00:13:41,685 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1200 transitions. Word has length 326 [2025-03-04 00:13:41,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:41,686 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1200 transitions. [2025-03-04 00:13:41,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-04 00:13:41,686 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1200 transitions. [2025-03-04 00:13:41,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-04 00:13:41,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:41,688 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:13:41,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 00:13:41,688 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:41,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:41,689 INFO L85 PathProgramCache]: Analyzing trace with hash 412073480, now seen corresponding path program 1 times [2025-03-04 00:13:41,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:41,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666543969] [2025-03-04 00:13:41,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:41,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:41,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-04 00:13:41,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-04 00:13:41,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:41,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 138 proven. 9 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-04 00:13:42,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:42,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666543969] [2025-03-04 00:13:42,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666543969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:13:42,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121931992] [2025-03-04 00:13:42,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:42,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:42,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:42,130 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:13:42,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 00:13:42,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-04 00:13:42,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-04 00:13:42,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:42,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:42,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:13:42,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:13:42,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 693 proven. 9 refuted. 0 times theorem prover too weak. 4198 trivial. 0 not checked. [2025-03-04 00:13:42,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:13:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 138 proven. 9 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-04 00:13:42,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121931992] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:13:42,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:13:42,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 00:13:42,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196391538] [2025-03-04 00:13:42,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:13:42,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:13:42,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:42,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:13:42,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:13:42,666 INFO L87 Difference]: Start difference. First operand 813 states and 1200 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-03-04 00:13:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:43,108 INFO L93 Difference]: Finished difference Result 1555 states and 2280 transitions. [2025-03-04 00:13:43,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:13:43,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 326 [2025-03-04 00:13:43,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:43,113 INFO L225 Difference]: With dead ends: 1555 [2025-03-04 00:13:43,113 INFO L226 Difference]: Without dead ends: 745 [2025-03-04 00:13:43,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 649 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:13:43,115 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 286 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:43,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 413 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:13:43,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-03-04 00:13:43,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 442. [2025-03-04 00:13:43,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 330 states have (on average 1.3333333333333333) internal successors, (440), 331 states have internal predecessors, (440), 100 states have call successors, (100), 11 states have call predecessors, (100), 11 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-04 00:13:43,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 640 transitions. [2025-03-04 00:13:43,175 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 640 transitions. Word has length 326 [2025-03-04 00:13:43,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:43,175 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 640 transitions. [2025-03-04 00:13:43,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-03-04 00:13:43,175 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 640 transitions. [2025-03-04 00:13:43,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-03-04 00:13:43,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:43,177 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:13:43,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:13:43,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:43,378 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:43,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:43,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1213283318, now seen corresponding path program 1 times [2025-03-04 00:13:43,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:43,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91541830] [2025-03-04 00:13:43,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:43,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:43,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-04 00:13:43,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-04 00:13:43,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:43,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:44,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 132 proven. 15 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-04 00:13:44,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:44,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91541830] [2025-03-04 00:13:44,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91541830] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:13:44,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369144860] [2025-03-04 00:13:44,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:44,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:44,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:44,381 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:13:44,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:13:44,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-04 00:13:44,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-04 00:13:44,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:44,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:44,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 00:13:44,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:13:45,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 1017 proven. 15 refuted. 0 times theorem prover too weak. 3868 trivial. 0 not checked. [2025-03-04 00:13:45,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:13:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 132 proven. 15 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-04 00:13:45,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369144860] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:13:45,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:13:45,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 23 [2025-03-04 00:13:45,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166145024] [2025-03-04 00:13:45,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:13:45,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 00:13:45,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:45,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 00:13:45,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2025-03-04 00:13:45,633 INFO L87 Difference]: Start difference. First operand 442 states and 640 transitions. Second operand has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 23 states have internal predecessors, (147), 4 states have call successors, (150), 3 states have call predecessors, (150), 6 states have return successors, (150), 4 states have call predecessors, (150), 4 states have call successors, (150) [2025-03-04 00:13:48,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:48,341 INFO L93 Difference]: Finished difference Result 1784 states and 2541 transitions. [2025-03-04 00:13:48,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 00:13:48,341 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 23 states have internal predecessors, (147), 4 states have call successors, (150), 3 states have call predecessors, (150), 6 states have return successors, (150), 4 states have call predecessors, (150), 4 states have call successors, (150) Word has length 327 [2025-03-04 00:13:48,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:48,346 INFO L225 Difference]: With dead ends: 1784 [2025-03-04 00:13:48,347 INFO L226 Difference]: Without dead ends: 1345 [2025-03-04 00:13:48,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=509, Invalid=2247, Unknown=0, NotChecked=0, Total=2756 [2025-03-04 00:13:48,349 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 1854 mSDsluCounter, 2194 mSDsCounter, 0 mSdLazyCounter, 2631 mSolverCounterSat, 975 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1856 SdHoareTripleChecker+Valid, 2498 SdHoareTripleChecker+Invalid, 3606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 975 IncrementalHoareTripleChecker+Valid, 2631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:48,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1856 Valid, 2498 Invalid, 3606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [975 Valid, 2631 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-04 00:13:48,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2025-03-04 00:13:48,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 810. [2025-03-04 00:13:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 535 states have (on average 1.2429906542056075) internal successors, (665), 538 states have internal predecessors, (665), 245 states have call successors, (245), 29 states have call predecessors, (245), 29 states have return successors, (245), 242 states have call predecessors, (245), 245 states have call successors, (245) [2025-03-04 00:13:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1155 transitions. [2025-03-04 00:13:48,502 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1155 transitions. Word has length 327 [2025-03-04 00:13:48,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:48,502 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 1155 transitions. [2025-03-04 00:13:48,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 23 states have internal predecessors, (147), 4 states have call successors, (150), 3 states have call predecessors, (150), 6 states have return successors, (150), 4 states have call predecessors, (150), 4 states have call successors, (150) [2025-03-04 00:13:48,503 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1155 transitions. [2025-03-04 00:13:48,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-03-04 00:13:48,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:48,504 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:13:48,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 00:13:48,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 00:13:48,705 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:48,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:48,705 INFO L85 PathProgramCache]: Analyzing trace with hash -2131988608, now seen corresponding path program 1 times [2025-03-04 00:13:48,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:48,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999929443] [2025-03-04 00:13:48,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:48,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:48,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-04 00:13:48,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-04 00:13:48,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:48,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 303 proven. 249 refuted. 0 times theorem prover too weak. 4348 trivial. 0 not checked. [2025-03-04 00:13:49,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:49,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999929443] [2025-03-04 00:13:49,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999929443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:13:49,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525309306] [2025-03-04 00:13:49,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:49,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:49,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:49,815 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:13:49,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 00:13:49,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-04 00:13:50,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-04 00:13:50,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:50,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:50,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 00:13:50,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:13:51,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 3340 proven. 249 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2025-03-04 00:13:51,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:13:52,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 303 proven. 267 refuted. 0 times theorem prover too weak. 4330 trivial. 0 not checked. [2025-03-04 00:13:52,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525309306] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:13:52,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:13:52,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 30 [2025-03-04 00:13:52,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102195989] [2025-03-04 00:13:52,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:13:52,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 00:13:52,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:52,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 00:13:52,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=602, Unknown=0, NotChecked=0, Total=870 [2025-03-04 00:13:52,041 INFO L87 Difference]: Start difference. First operand 810 states and 1155 transitions. Second operand has 30 states, 27 states have (on average 7.37037037037037) internal successors, (199), 27 states have internal predecessors, (199), 13 states have call successors, (108), 5 states have call predecessors, (108), 12 states have return successors, (109), 12 states have call predecessors, (109), 13 states have call successors, (109) [2025-03-04 00:13:52,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:52,897 INFO L93 Difference]: Finished difference Result 1618 states and 2247 transitions. [2025-03-04 00:13:52,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 00:13:52,898 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 7.37037037037037) internal successors, (199), 27 states have internal predecessors, (199), 13 states have call successors, (108), 5 states have call predecessors, (108), 12 states have return successors, (109), 12 states have call predecessors, (109), 13 states have call successors, (109) Word has length 327 [2025-03-04 00:13:52,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:52,902 INFO L225 Difference]: With dead ends: 1618 [2025-03-04 00:13:52,902 INFO L226 Difference]: Without dead ends: 900 [2025-03-04 00:13:52,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 640 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=463, Invalid=1019, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 00:13:52,904 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 422 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:52,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 491 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:13:52,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2025-03-04 00:13:53,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 890. [2025-03-04 00:13:53,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 595 states have (on average 1.1915966386554622) internal successors, (709), 598 states have internal predecessors, (709), 245 states have call successors, (245), 49 states have call predecessors, (245), 49 states have return successors, (245), 242 states have call predecessors, (245), 245 states have call successors, (245) [2025-03-04 00:13:53,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1199 transitions. [2025-03-04 00:13:53,086 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1199 transitions. Word has length 327 [2025-03-04 00:13:53,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:53,086 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 1199 transitions. [2025-03-04 00:13:53,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 7.37037037037037) internal successors, (199), 27 states have internal predecessors, (199), 13 states have call successors, (108), 5 states have call predecessors, (108), 12 states have return successors, (109), 12 states have call predecessors, (109), 13 states have call successors, (109) [2025-03-04 00:13:53,087 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1199 transitions. [2025-03-04 00:13:53,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-04 00:13:53,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:53,088 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:13:53,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 00:13:53,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 00:13:53,289 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:53,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:53,289 INFO L85 PathProgramCache]: Analyzing trace with hash 967312837, now seen corresponding path program 1 times [2025-03-04 00:13:53,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:53,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225635793] [2025-03-04 00:13:53,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:53,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:53,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-04 00:13:53,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-04 00:13:53,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:53,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:13:53,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1613879304] [2025-03-04 00:13:53,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:53,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:53,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:53,534 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:13:53,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 00:13:53,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-04 00:13:54,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-04 00:13:54,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:54,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:54,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-04 00:13:54,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:13:56,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 3437 proven. 357 refuted. 0 times theorem prover too weak. 1106 trivial. 0 not checked. [2025-03-04 00:13:56,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:13:57,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:57,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225635793] [2025-03-04 00:13:57,112 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 00:13:57,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613879304] [2025-03-04 00:13:57,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613879304] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:13:57,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:13:57,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2025-03-04 00:13:57,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100178497] [2025-03-04 00:13:57,113 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 00:13:57,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 00:13:57,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:57,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 00:13:57,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2025-03-04 00:13:57,114 INFO L87 Difference]: Start difference. First operand 890 states and 1199 transitions. Second operand has 25 states, 25 states have (on average 4.48) internal successors, (112), 22 states have internal predecessors, (112), 7 states have call successors, (50), 7 states have call predecessors, (50), 11 states have return successors, (50), 7 states have call predecessors, (50), 7 states have call successors, (50) [2025-03-04 00:13:59,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:59,218 INFO L93 Difference]: Finished difference Result 2041 states and 2728 transitions. [2025-03-04 00:13:59,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 00:13:59,219 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.48) internal successors, (112), 22 states have internal predecessors, (112), 7 states have call successors, (50), 7 states have call predecessors, (50), 11 states have return successors, (50), 7 states have call predecessors, (50), 7 states have call successors, (50) Word has length 329 [2025-03-04 00:13:59,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:59,225 INFO L225 Difference]: With dead ends: 2041 [2025-03-04 00:13:59,225 INFO L226 Difference]: Without dead ends: 1259 [2025-03-04 00:13:59,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=602, Invalid=2260, Unknown=0, NotChecked=0, Total=2862 [2025-03-04 00:13:59,228 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 658 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 1850 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:59,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1845 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1850 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 00:13:59,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2025-03-04 00:13:59,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1106. [2025-03-04 00:13:59,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 786 states have (on average 1.2035623409669212) internal successors, (946), 790 states have internal predecessors, (946), 260 states have call successors, (260), 59 states have call predecessors, (260), 59 states have return successors, (260), 256 states have call predecessors, (260), 260 states have call successors, (260) [2025-03-04 00:13:59,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1466 transitions. [2025-03-04 00:13:59,426 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1466 transitions. Word has length 329 [2025-03-04 00:13:59,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:59,427 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1466 transitions. [2025-03-04 00:13:59,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.48) internal successors, (112), 22 states have internal predecessors, (112), 7 states have call successors, (50), 7 states have call predecessors, (50), 11 states have return successors, (50), 7 states have call predecessors, (50), 7 states have call successors, (50) [2025-03-04 00:13:59,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1466 transitions. [2025-03-04 00:13:59,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-04 00:13:59,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:59,429 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:13:59,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 00:13:59,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 00:13:59,630 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:59,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:59,630 INFO L85 PathProgramCache]: Analyzing trace with hash -733427642, now seen corresponding path program 1 times [2025-03-04 00:13:59,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:59,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956666966] [2025-03-04 00:13:59,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:59,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:59,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-04 00:14:00,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-04 00:14:00,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:14:00,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:14:00,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1356046906] [2025-03-04 00:14:00,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:14:00,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:14:00,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:14:00,013 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:14:00,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 00:14:00,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes.