./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-39.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 4f3611a875fdf984da4dbe6a7960e00cbc86546d93a80a5be72248390d98dd3b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:21:44,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:21:44,768 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:21:44,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:21:44,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:21:44,798 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:21:44,799 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:21:44,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:21:44,799 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:21:44,799 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:21:44,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:21:44,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:21:44,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:21:44,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:21:44,801 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:21:44,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:21:44,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:21:44,801 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:21:44,801 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:21:44,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:21:44,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:21:44,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:21:44,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:21:44,802 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:21:44,802 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:21:44,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:21:44,802 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:21:44,802 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:21:44,802 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:21:44,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:21:44,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:21:44,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:21:44,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:21:44,803 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:21:44,803 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:21:44,803 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:21:44,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:21:44,803 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:21:44,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:21:44,803 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:21:44,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:21:44,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:21:44,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:21:44,803 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 -> 4f3611a875fdf984da4dbe6a7960e00cbc86546d93a80a5be72248390d98dd3b [2025-03-08 15:21:45,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:21:45,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:21:45,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:21:45,046 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:21:45,046 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:21:45,047 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-39.i [2025-03-08 15:21:46,261 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71757c4be/f523ca8664274719aaa87681131c44b3/FLAGf95182b79 [2025-03-08 15:21:46,546 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:21:46,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-39.i [2025-03-08 15:21:46,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71757c4be/f523ca8664274719aaa87681131c44b3/FLAGf95182b79 [2025-03-08 15:21:46,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71757c4be/f523ca8664274719aaa87681131c44b3 [2025-03-08 15:21:46,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:21:46,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:21:46,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:21:46,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:21:46,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:21:46,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:21:46" (1/1) ... [2025-03-08 15:21:46,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@372ad196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:46, skipping insertion in model container [2025-03-08 15:21:46,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:21:46" (1/1) ... [2025-03-08 15:21:46,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:21:46,724 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-39.i[916,929] [2025-03-08 15:21:46,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:21:46,830 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:21:46,837 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-39.i[916,929] [2025-03-08 15:21:46,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:21:46,919 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:21:46,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:46 WrapperNode [2025-03-08 15:21:46,921 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:21:46,922 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:21:46,922 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:21:46,922 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:21:46,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:46" (1/1) ... [2025-03-08 15:21:46,941 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:46" (1/1) ... [2025-03-08 15:21:46,989 INFO L138 Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 355 [2025-03-08 15:21:46,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:21:46,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:21:46,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:21:46,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:21:46,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:46" (1/1) ... [2025-03-08 15:21:46,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:46" (1/1) ... [2025-03-08 15:21:47,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:46" (1/1) ... [2025-03-08 15:21:47,034 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:21:47,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:46" (1/1) ... [2025-03-08 15:21:47,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:46" (1/1) ... [2025-03-08 15:21:47,057 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:46" (1/1) ... [2025-03-08 15:21:47,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:46" (1/1) ... [2025-03-08 15:21:47,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:46" (1/1) ... [2025-03-08 15:21:47,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:46" (1/1) ... [2025-03-08 15:21:47,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:21:47,085 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:21:47,086 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:21:47,086 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:21:47,087 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:46" (1/1) ... [2025-03-08 15:21:47,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:21:47,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:21:47,115 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:21:47,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:21:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:21:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:21:47,135 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:21:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:21:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:21:47,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:21:47,218 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:21:47,220 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:21:47,796 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L360: havoc property_#t~bitwise31#1; [2025-03-08 15:21:47,848 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-08 15:21:47,848 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:21:47,868 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:21:47,870 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-08 15:21:47,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:21:47 BoogieIcfgContainer [2025-03-08 15:21:47,871 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:21:47,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:21:47,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:21:47,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:21:47,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:21:46" (1/3) ... [2025-03-08 15:21:47,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b40fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:21:47, skipping insertion in model container [2025-03-08 15:21:47,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:21:46" (2/3) ... [2025-03-08 15:21:47,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b40fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:21:47, skipping insertion in model container [2025-03-08 15:21:47,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:21:47" (3/3) ... [2025-03-08 15:21:47,879 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-39.i [2025-03-08 15:21:47,890 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:21:47,892 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-39.i that has 2 procedures, 145 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:21:47,939 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:21:47,950 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;@6f191618, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:21:47,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:21:47,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 100 states have (on average 1.5) internal successors, (150), 101 states have internal predecessors, (150), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 15:21:47,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-03-08 15:21:47,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:21:47,973 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:21:47,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:21:47,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:21:47,979 INFO L85 PathProgramCache]: Analyzing trace with hash 49916149, now seen corresponding path program 1 times [2025-03-08 15:21:47,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:21:47,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221089782] [2025-03-08 15:21:47,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:21:47,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:21:48,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-08 15:21:48,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-08 15:21:48,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:21:48,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:21:48,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-03-08 15:21:48,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:21:48,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221089782] [2025-03-08 15:21:48,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221089782] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:21:48,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275375060] [2025-03-08 15:21:48,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:21:48,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:21:48,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:21:48,449 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:21:48,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:21:48,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-08 15:21:48,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-08 15:21:48,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:21:48,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:21:48,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:21:48,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:21:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-03-08 15:21:48,710 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:21:48,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275375060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:21:48,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:21:48,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:21:48,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296423310] [2025-03-08 15:21:48,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:21:48,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:21:48,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:21:48,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:21:48,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:21:48,734 INFO L87 Difference]: Start difference. First operand has 145 states, 100 states have (on average 1.5) internal successors, (150), 101 states have internal predecessors, (150), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 40.0) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-08 15:21:48,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:21:48,761 INFO L93 Difference]: Finished difference Result 284 states and 505 transitions. [2025-03-08 15:21:48,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:21:48,763 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 40.0) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) Word has length 285 [2025-03-08 15:21:48,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:21:48,769 INFO L225 Difference]: With dead ends: 284 [2025-03-08 15:21:48,769 INFO L226 Difference]: Without dead ends: 142 [2025-03-08 15:21:48,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:21:48,773 INFO L435 NwaCegarLoop]: 227 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, 227 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-08 15:21:48,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:21:48,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-08 15:21:48,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-03-08 15:21:48,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 98 states have (on average 1.4795918367346939) internal successors, (145), 98 states have internal predecessors, (145), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 15:21:48,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 229 transitions. [2025-03-08 15:21:48,810 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 229 transitions. Word has length 285 [2025-03-08 15:21:48,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:21:48,811 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 229 transitions. [2025-03-08 15:21:48,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.0) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-08 15:21:48,811 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 229 transitions. [2025-03-08 15:21:48,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-03-08 15:21:48,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:21:48,815 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:21:48,826 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-08 15:21:49,023 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-08 15:21:49,023 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:21:49,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:21:49,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1813244441, now seen corresponding path program 1 times [2025-03-08 15:21:49,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:21:49,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982503309] [2025-03-08 15:21:49,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:21:49,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:21:49,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-03-08 15:21:49,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-03-08 15:21:49,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:21:49,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:21:49,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-08 15:21:49,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:21:49,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982503309] [2025-03-08 15:21:49,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982503309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:21:49,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:21:49,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:21:49,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466827456] [2025-03-08 15:21:49,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:21:49,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:21:49,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:21:49,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:21:49,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:21:49,361 INFO L87 Difference]: Start difference. First operand 142 states and 229 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-08 15:21:49,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:21:49,470 INFO L93 Difference]: Finished difference Result 384 states and 619 transitions. [2025-03-08 15:21:49,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:21:49,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 285 [2025-03-08 15:21:49,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:21:49,473 INFO L225 Difference]: With dead ends: 384 [2025-03-08 15:21:49,475 INFO L226 Difference]: Without dead ends: 245 [2025-03-08 15:21:49,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:21:49,477 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 139 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:21:49,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 544 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:21:49,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-08 15:21:49,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2025-03-08 15:21:49,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 172 states have (on average 1.4709302325581395) internal successors, (253), 173 states have internal predecessors, (253), 67 states have call successors, (67), 2 states have call predecessors, (67), 2 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-08 15:21:49,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 387 transitions. [2025-03-08 15:21:49,512 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 387 transitions. Word has length 285 [2025-03-08 15:21:49,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:21:49,514 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 387 transitions. [2025-03-08 15:21:49,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-08 15:21:49,514 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 387 transitions. [2025-03-08 15:21:49,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-08 15:21:49,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:21:49,519 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:21:49,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:21:49,519 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:21:49,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:21:49,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2064346964, now seen corresponding path program 1 times [2025-03-08 15:21:49,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:21:49,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209718758] [2025-03-08 15:21:49,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:21:49,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:21:49,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-08 15:21:49,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-08 15:21:49,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:21:49,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:21:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-08 15:21:50,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:21:50,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209718758] [2025-03-08 15:21:50,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209718758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:21:50,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:21:50,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:21:50,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936217567] [2025-03-08 15:21:50,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:21:50,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:21:50,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:21:50,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:21:50,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:21:50,060 INFO L87 Difference]: Start difference. First operand 242 states and 387 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-08 15:21:50,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:21:50,125 INFO L93 Difference]: Finished difference Result 713 states and 1142 transitions. [2025-03-08 15:21:50,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:21:50,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 286 [2025-03-08 15:21:50,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:21:50,130 INFO L225 Difference]: With dead ends: 713 [2025-03-08 15:21:50,130 INFO L226 Difference]: Without dead ends: 474 [2025-03-08 15:21:50,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:21:50,132 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 110 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:21:50,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 435 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:21:50,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-03-08 15:21:50,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 444. [2025-03-08 15:21:50,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 305 states have (on average 1.4360655737704917) internal successors, (438), 307 states have internal predecessors, (438), 134 states have call successors, (134), 4 states have call predecessors, (134), 4 states have return successors, (134), 132 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-08 15:21:50,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 706 transitions. [2025-03-08 15:21:50,191 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 706 transitions. Word has length 286 [2025-03-08 15:21:50,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:21:50,192 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 706 transitions. [2025-03-08 15:21:50,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-08 15:21:50,192 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 706 transitions. [2025-03-08 15:21:50,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-08 15:21:50,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:21:50,196 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:21:50,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:21:50,196 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:21:50,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:21:50,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1770943957, now seen corresponding path program 1 times [2025-03-08 15:21:50,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:21:50,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929123062] [2025-03-08 15:21:50,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:21:50,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:21:50,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-08 15:21:50,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-08 15:21:50,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:21:50,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:21:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-08 15:21:50,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:21:50,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929123062] [2025-03-08 15:21:50,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929123062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:21:50,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:21:50,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:21:50,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866499060] [2025-03-08 15:21:50,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:21:50,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:21:50,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:21:50,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:21:50,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:21:50,738 INFO L87 Difference]: Start difference. First operand 444 states and 706 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-08 15:21:51,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:21:51,135 INFO L93 Difference]: Finished difference Result 1216 states and 1945 transitions. [2025-03-08 15:21:51,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:21:51,136 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), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 286 [2025-03-08 15:21:51,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:21:51,143 INFO L225 Difference]: With dead ends: 1216 [2025-03-08 15:21:51,143 INFO L226 Difference]: Without dead ends: 775 [2025-03-08 15:21:51,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:21:51,148 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 230 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:21:51,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 926 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:21:51,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-03-08 15:21:51,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 585. [2025-03-08 15:21:51,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 403 states have (on average 1.4218362282878412) internal successors, (573), 405 states have internal predecessors, (573), 176 states have call successors, (176), 5 states have call predecessors, (176), 5 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-03-08 15:21:51,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 925 transitions. [2025-03-08 15:21:51,229 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 925 transitions. Word has length 286 [2025-03-08 15:21:51,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:21:51,230 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 925 transitions. [2025-03-08 15:21:51,231 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), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-08 15:21:51,231 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 925 transitions. [2025-03-08 15:21:51,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-08 15:21:51,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:21:51,234 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:21:51,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:21:51,234 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:21:51,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:21:51,235 INFO L85 PathProgramCache]: Analyzing trace with hash 2121743894, now seen corresponding path program 1 times [2025-03-08 15:21:51,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:21:51,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171932693] [2025-03-08 15:21:51,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:21:51,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:21:51,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-08 15:21:51,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-08 15:21:51,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:21:51,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:21:52,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-08 15:21:52,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:21:52,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171932693] [2025-03-08 15:21:52,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171932693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:21:52,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:21:52,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:21:52,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516827708] [2025-03-08 15:21:52,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:21:52,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:21:52,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:21:52,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:21:52,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:21:52,034 INFO L87 Difference]: Start difference. First operand 585 states and 925 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, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-08 15:21:52,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:21:52,450 INFO L93 Difference]: Finished difference Result 1300 states and 2074 transitions. [2025-03-08 15:21:52,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:21:52,452 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, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 286 [2025-03-08 15:21:52,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:21:52,456 INFO L225 Difference]: With dead ends: 1300 [2025-03-08 15:21:52,456 INFO L226 Difference]: Without dead ends: 859 [2025-03-08 15:21:52,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:21:52,458 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 382 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:21:52,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 779 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:21:52,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-03-08 15:21:52,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 599. [2025-03-08 15:21:52,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 417 states have (on average 1.4268585131894485) internal successors, (595), 419 states have internal predecessors, (595), 176 states have call successors, (176), 5 states have call predecessors, (176), 5 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-03-08 15:21:52,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 947 transitions. [2025-03-08 15:21:52,528 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 947 transitions. Word has length 286 [2025-03-08 15:21:52,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:21:52,531 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 947 transitions. [2025-03-08 15:21:52,531 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, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-08 15:21:52,531 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 947 transitions. [2025-03-08 15:21:52,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-08 15:21:52,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:21:52,533 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:21:52,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:21:52,534 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:21:52,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:21:52,534 INFO L85 PathProgramCache]: Analyzing trace with hash -96014059, now seen corresponding path program 1 times [2025-03-08 15:21:52,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:21:52,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109633012] [2025-03-08 15:21:52,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:21:52,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:21:52,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-08 15:21:52,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-08 15:21:52,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:21:52,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:22:02,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-08 15:22:02,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:22:02,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109633012] [2025-03-08 15:22:02,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109633012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:22:02,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:22:02,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 15:22:02,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584226176] [2025-03-08 15:22:02,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:22:02,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 15:22:02,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:22:02,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 15:22:02,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-03-08 15:22:02,007 INFO L87 Difference]: Start difference. First operand 599 states and 947 transitions. Second operand has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 5 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 4 states have call predecessors, (42), 5 states have call successors, (42) [2025-03-08 15:22:06,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:22:06,014 INFO L93 Difference]: Finished difference Result 2027 states and 3255 transitions. [2025-03-08 15:22:06,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 15:22:06,015 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 5 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 4 states have call predecessors, (42), 5 states have call successors, (42) Word has length 286 [2025-03-08 15:22:06,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:22:06,022 INFO L225 Difference]: With dead ends: 2027 [2025-03-08 15:22:06,023 INFO L226 Difference]: Without dead ends: 1578 [2025-03-08 15:22:06,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=360, Invalid=1046, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 15:22:06,026 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 3428 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 1858 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3428 SdHoareTripleChecker+Valid, 2251 SdHoareTripleChecker+Invalid, 2160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:22:06,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3428 Valid, 2251 Invalid, 2160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1858 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 15:22:06,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2025-03-08 15:22:06,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 655. [2025-03-08 15:22:06,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 472 states have (on average 1.4427966101694916) internal successors, (681), 474 states have internal predecessors, (681), 176 states have call successors, (176), 6 states have call predecessors, (176), 6 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-03-08 15:22:06,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1033 transitions. [2025-03-08 15:22:06,094 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1033 transitions. Word has length 286 [2025-03-08 15:22:06,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:22:06,094 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 1033 transitions. [2025-03-08 15:22:06,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 19 states have internal predecessors, (79), 5 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 4 states have call predecessors, (42), 5 states have call successors, (42) [2025-03-08 15:22:06,094 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1033 transitions. [2025-03-08 15:22:06,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-08 15:22:06,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:22:06,096 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:22:06,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:22:06,099 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:22:06,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:22:06,100 INFO L85 PathProgramCache]: Analyzing trace with hash 409544566, now seen corresponding path program 1 times [2025-03-08 15:22:06,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:22:06,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822970955] [2025-03-08 15:22:06,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:22:06,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:22:06,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-08 15:22:06,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-08 15:22:06,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:22:06,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:22:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-08 15:22:17,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:22:17,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822970955] [2025-03-08 15:22:17,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822970955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:22:17,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:22:17,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 15:22:17,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370302833] [2025-03-08 15:22:17,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:22:17,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 15:22:17,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:22:17,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 15:22:17,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-03-08 15:22:17,521 INFO L87 Difference]: Start difference. First operand 655 states and 1033 transitions. Second operand has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 5 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 4 states have call predecessors, (42), 5 states have call successors, (42) [2025-03-08 15:22:20,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:22:20,562 INFO L93 Difference]: Finished difference Result 1919 states and 3081 transitions. [2025-03-08 15:22:20,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 15:22:20,563 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 5 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 4 states have call predecessors, (42), 5 states have call successors, (42) Word has length 286 [2025-03-08 15:22:20,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:22:20,572 INFO L225 Difference]: With dead ends: 1919 [2025-03-08 15:22:20,573 INFO L226 Difference]: Without dead ends: 1450 [2025-03-08 15:22:20,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=231, Invalid=699, Unknown=0, NotChecked=0, Total=930 [2025-03-08 15:22:20,576 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 1862 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1862 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:22:20,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1862 Valid, 1775 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 15:22:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2025-03-08 15:22:20,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 627. [2025-03-08 15:22:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 444 states have (on average 1.427927927927928) internal successors, (634), 446 states have internal predecessors, (634), 176 states have call successors, (176), 6 states have call predecessors, (176), 6 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-03-08 15:22:20,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 986 transitions. [2025-03-08 15:22:20,624 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 986 transitions. Word has length 286 [2025-03-08 15:22:20,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:22:20,625 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 986 transitions. [2025-03-08 15:22:20,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 5 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 4 states have call predecessors, (42), 5 states have call successors, (42) [2025-03-08 15:22:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 986 transitions. [2025-03-08 15:22:20,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-08 15:22:20,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:22:20,628 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:22:20,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:22:20,628 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:22:20,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:22:20,629 INFO L85 PathProgramCache]: Analyzing trace with hash -2134070348, now seen corresponding path program 1 times [2025-03-08 15:22:20,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:22:20,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086475189] [2025-03-08 15:22:20,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:22:20,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:22:20,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-08 15:22:21,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-08 15:22:21,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:22:21,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:22:21,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 18 proven. 105 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2025-03-08 15:22:21,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:22:21,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086475189] [2025-03-08 15:22:21,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086475189] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:22:21,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223722905] [2025-03-08 15:22:21,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:22:21,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:22:21,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:22:21,343 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:22:21,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:22:21,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-08 15:22:21,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-08 15:22:21,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:22:21,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:22:21,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 15:22:21,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:22:24,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 1180 proven. 489 refuted. 0 times theorem prover too weak. 1775 trivial. 0 not checked. [2025-03-08 15:22:24,873 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:22:28,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223722905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:22:28,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:22:28,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 24] total 26 [2025-03-08 15:22:28,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193105907] [2025-03-08 15:22:28,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 15:22:28,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 15:22:28,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:22:28,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 15:22:28,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 15:22:28,432 INFO L87 Difference]: Start difference. First operand 627 states and 986 transitions. Second operand has 26 states, 26 states have (on average 6.3076923076923075) internal successors, (164), 25 states have internal predecessors, (164), 7 states have call successors, (83), 6 states have call predecessors, (83), 10 states have return successors, (84), 7 states have call predecessors, (84), 7 states have call successors, (84) [2025-03-08 15:22:30,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:22:30,511 INFO L93 Difference]: Finished difference Result 1267 states and 1895 transitions. [2025-03-08 15:22:30,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 15:22:30,512 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.3076923076923075) internal successors, (164), 25 states have internal predecessors, (164), 7 states have call successors, (83), 6 states have call predecessors, (83), 10 states have return successors, (84), 7 states have call predecessors, (84), 7 states have call successors, (84) Word has length 286 [2025-03-08 15:22:30,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:22:30,516 INFO L225 Difference]: With dead ends: 1267 [2025-03-08 15:22:30,516 INFO L226 Difference]: Without dead ends: 770 [2025-03-08 15:22:30,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=437, Invalid=2425, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 15:22:30,518 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 521 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 1796 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:22:30,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1412 Invalid, 1854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1796 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 15:22:30,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-03-08 15:22:30,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 727. [2025-03-08 15:22:30,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 513 states have (on average 1.3391812865497077) internal successors, (687), 515 states have internal predecessors, (687), 176 states have call successors, (176), 37 states have call predecessors, (176), 37 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-03-08 15:22:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1039 transitions. [2025-03-08 15:22:30,562 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1039 transitions. Word has length 286 [2025-03-08 15:22:30,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:22:30,563 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1039 transitions. [2025-03-08 15:22:30,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.3076923076923075) internal successors, (164), 25 states have internal predecessors, (164), 7 states have call successors, (83), 6 states have call predecessors, (83), 10 states have return successors, (84), 7 states have call predecessors, (84), 7 states have call successors, (84) [2025-03-08 15:22:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1039 transitions. [2025-03-08 15:22:30,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-08 15:22:30,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:22:30,564 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:22:30,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 15:22:30,769 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,SelfDestructingSolverStorable7 [2025-03-08 15:22:30,770 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:22:30,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:22:30,770 INFO L85 PathProgramCache]: Analyzing trace with hash -2031674346, now seen corresponding path program 1 times [2025-03-08 15:22:30,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:22:30,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251687764] [2025-03-08 15:22:30,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:22:30,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:22:30,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-08 15:22:31,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-08 15:22:31,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:22:31,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:22:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-08 15:22:35,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:22:35,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251687764] [2025-03-08 15:22:35,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251687764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:22:35,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:22:35,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 15:22:35,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68553762] [2025-03-08 15:22:35,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:22:35,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 15:22:35,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:22:35,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 15:22:35,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-08 15:22:35,416 INFO L87 Difference]: Start difference. First operand 727 states and 1039 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 4 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 4 states have call successors, (42) [2025-03-08 15:22:37,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:22:37,583 INFO L93 Difference]: Finished difference Result 2023 states and 3031 transitions. [2025-03-08 15:22:37,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 15:22:37,583 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 4 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 4 states have call successors, (42) Word has length 286 [2025-03-08 15:22:37,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:22:37,590 INFO L225 Difference]: With dead ends: 2023 [2025-03-08 15:22:37,590 INFO L226 Difference]: Without dead ends: 1486 [2025-03-08 15:22:37,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2025-03-08 15:22:37,595 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 1585 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:22:37,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 1405 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 15:22:37,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2025-03-08 15:22:37,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 839. [2025-03-08 15:22:37,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 625 states have (on average 1.3728) internal successors, (858), 627 states have internal predecessors, (858), 176 states have call successors, (176), 37 states have call predecessors, (176), 37 states have return successors, (176), 174 states have call predecessors, (176), 176 states have call successors, (176) [2025-03-08 15:22:37,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1210 transitions. [2025-03-08 15:22:37,655 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1210 transitions. Word has length 286 [2025-03-08 15:22:37,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:22:37,655 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1210 transitions. [2025-03-08 15:22:37,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 4 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 4 states have call successors, (42) [2025-03-08 15:22:37,656 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1210 transitions. [2025-03-08 15:22:37,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-08 15:22:37,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:22:37,657 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:22:37,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:22:37,657 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:22:37,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:22:37,658 INFO L85 PathProgramCache]: Analyzing trace with hash 225236661, now seen corresponding path program 1 times [2025-03-08 15:22:37,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:22:37,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76266813] [2025-03-08 15:22:37,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:22:37,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:22:37,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-08 15:22:37,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-08 15:22:37,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:22:37,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:22:38,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 3 proven. 120 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2025-03-08 15:22:38,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:22:38,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76266813] [2025-03-08 15:22:38,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76266813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:22:38,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142514822] [2025-03-08 15:22:38,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:22:38,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:22:38,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:22:38,864 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:22:38,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 15:22:38,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-08 15:22:39,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-08 15:22:39,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:22:39,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:22:39,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 15:22:39,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:22:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 893 proven. 105 refuted. 0 times theorem prover too weak. 2446 trivial. 0 not checked. [2025-03-08 15:22:39,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:22:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 18 proven. 105 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2025-03-08 15:22:40,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142514822] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:22:40,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:22:40,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 20 [2025-03-08 15:22:40,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566984991] [2025-03-08 15:22:40,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:22:40,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 15:22:40,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:22:40,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 15:22:40,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-03-08 15:22:40,840 INFO L87 Difference]: Start difference. First operand 839 states and 1210 transitions. Second operand has 20 states, 19 states have (on average 10.368421052631579) internal successors, (197), 19 states have internal predecessors, (197), 6 states have call successors, (126), 3 states have call predecessors, (126), 6 states have return successors, (126), 6 states have call predecessors, (126), 6 states have call successors, (126) [2025-03-08 15:22:43,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:22:43,238 INFO L93 Difference]: Finished difference Result 4186 states and 6075 transitions. [2025-03-08 15:22:43,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-08 15:22:43,239 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 10.368421052631579) internal successors, (197), 19 states have internal predecessors, (197), 6 states have call successors, (126), 3 states have call predecessors, (126), 6 states have return successors, (126), 6 states have call predecessors, (126), 6 states have call successors, (126) Word has length 286 [2025-03-08 15:22:43,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:22:43,250 INFO L225 Difference]: With dead ends: 4186 [2025-03-08 15:22:43,250 INFO L226 Difference]: Without dead ends: 3599 [2025-03-08 15:22:43,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 568 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=612, Invalid=2694, Unknown=0, NotChecked=0, Total=3306 [2025-03-08 15:22:43,253 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 2225 mSDsluCounter, 2028 mSDsCounter, 0 mSdLazyCounter, 2052 mSolverCounterSat, 480 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2240 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 2532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 480 IncrementalHoareTripleChecker+Valid, 2052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:22:43,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2240 Valid, 2272 Invalid, 2532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [480 Valid, 2052 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 15:22:43,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3599 states. [2025-03-08 15:22:43,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3599 to 3125. [2025-03-08 15:22:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 2345 states have (on average 1.3859275053304905) internal successors, (3250), 2361 states have internal predecessors, (3250), 626 states have call successors, (626), 153 states have call predecessors, (626), 153 states have return successors, (626), 610 states have call predecessors, (626), 626 states have call successors, (626) [2025-03-08 15:22:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4502 transitions. [2025-03-08 15:22:43,449 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4502 transitions. Word has length 286 [2025-03-08 15:22:43,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:22:43,450 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 4502 transitions. [2025-03-08 15:22:43,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 10.368421052631579) internal successors, (197), 19 states have internal predecessors, (197), 6 states have call successors, (126), 3 states have call predecessors, (126), 6 states have return successors, (126), 6 states have call predecessors, (126), 6 states have call successors, (126) [2025-03-08 15:22:43,450 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4502 transitions. [2025-03-08 15:22:43,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-08 15:22:43,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:22:43,452 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:22:43,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 15:22:43,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:22:43,653 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:22:43,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:22:43,655 INFO L85 PathProgramCache]: Analyzing trace with hash -786909865, now seen corresponding path program 1 times [2025-03-08 15:22:43,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:22:43,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5302565] [2025-03-08 15:22:43,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:22:43,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:22:43,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-08 15:22:44,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-08 15:22:44,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:22:44,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:22:44,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 30 proven. 93 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2025-03-08 15:22:44,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:22:44,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5302565] [2025-03-08 15:22:44,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5302565] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:22:44,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061177057] [2025-03-08 15:22:44,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:22:44,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:22:44,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:22:44,777 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-08 15:22:44,777 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-08 15:22:44,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-08 15:22:44,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-08 15:22:44,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:22:44,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:22:44,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 15:22:44,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:22:45,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 1301 proven. 93 refuted. 0 times theorem prover too weak. 2050 trivial. 0 not checked. [2025-03-08 15:22:45,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:22:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 30 proven. 93 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2025-03-08 15:22:46,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061177057] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:22:46,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:22:46,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 26 [2025-03-08 15:22:46,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787004482] [2025-03-08 15:22:46,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:22:46,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 15:22:46,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:22:46,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 15:22:46,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2025-03-08 15:22:46,285 INFO L87 Difference]: Start difference. First operand 3125 states and 4502 transitions. Second operand has 26 states, 25 states have (on average 8.64) internal successors, (216), 26 states have internal predecessors, (216), 7 states have call successors, (126), 3 states have call predecessors, (126), 6 states have return successors, (126), 6 states have call predecessors, (126), 7 states have call successors, (126) [2025-03-08 15:22:48,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:22:48,201 INFO L93 Difference]: Finished difference Result 9001 states and 12819 transitions. [2025-03-08 15:22:48,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 15:22:48,201 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 8.64) internal successors, (216), 26 states have internal predecessors, (216), 7 states have call successors, (126), 3 states have call predecessors, (126), 6 states have return successors, (126), 6 states have call predecessors, (126), 7 states have call successors, (126) Word has length 286 [2025-03-08 15:22:48,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:22:48,228 INFO L225 Difference]: With dead ends: 9001 [2025-03-08 15:22:48,229 INFO L226 Difference]: Without dead ends: 6295 [2025-03-08 15:22:48,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 564 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=457, Invalid=1993, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 15:22:48,237 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 1630 mSDsluCounter, 2213 mSDsCounter, 0 mSdLazyCounter, 2434 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1681 SdHoareTripleChecker+Valid, 2431 SdHoareTripleChecker+Invalid, 2796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 2434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:22:48,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1681 Valid, 2431 Invalid, 2796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 2434 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 15:22:48,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6295 states. [2025-03-08 15:22:48,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6295 to 4367. [2025-03-08 15:22:48,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4367 states, 3339 states have (on average 1.3878406708595388) internal successors, (4634), 3371 states have internal predecessors, (4634), 786 states have call successors, (786), 241 states have call predecessors, (786), 241 states have return successors, (786), 754 states have call predecessors, (786), 786 states have call successors, (786) [2025-03-08 15:22:48,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4367 states to 4367 states and 6206 transitions. [2025-03-08 15:22:48,592 INFO L78 Accepts]: Start accepts. Automaton has 4367 states and 6206 transitions. Word has length 286 [2025-03-08 15:22:48,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:22:48,592 INFO L471 AbstractCegarLoop]: Abstraction has 4367 states and 6206 transitions. [2025-03-08 15:22:48,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 8.64) internal successors, (216), 26 states have internal predecessors, (216), 7 states have call successors, (126), 3 states have call predecessors, (126), 6 states have return successors, (126), 6 states have call predecessors, (126), 7 states have call successors, (126) [2025-03-08 15:22:48,593 INFO L276 IsEmpty]: Start isEmpty. Operand 4367 states and 6206 transitions. [2025-03-08 15:22:48,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-08 15:22:48,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:22:48,596 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:22:48,605 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-08 15:22:48,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:22:48,797 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:22:48,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:22:48,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1470001142, now seen corresponding path program 1 times [2025-03-08 15:22:48,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:22:48,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224970395] [2025-03-08 15:22:48,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:22:48,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:22:48,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-08 15:22:49,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-08 15:22:49,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:22:49,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:22:51,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 126 proven. 522 refuted. 0 times theorem prover too weak. 2796 trivial. 0 not checked. [2025-03-08 15:22:51,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:22:51,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224970395] [2025-03-08 15:22:51,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224970395] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:22:51,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523728231] [2025-03-08 15:22:51,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:22:51,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:22:51,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:22:51,564 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-08 15:22:51,565 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-08 15:22:51,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-08 15:22:51,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-08 15:22:51,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:22:51,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:22:51,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 15:22:51,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:22:53,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 1718 proven. 519 refuted. 0 times theorem prover too weak. 1207 trivial. 0 not checked. [2025-03-08 15:22:53,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:23:01,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523728231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:23:01,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:23:01,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 34 [2025-03-08 15:23:01,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119049103] [2025-03-08 15:23:01,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 15:23:01,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 15:23:01,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:23:01,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 15:23:01,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1376, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 15:23:01,784 INFO L87 Difference]: Start difference. First operand 4367 states and 6206 transitions. Second operand has 34 states, 33 states have (on average 4.96969696969697) internal successors, (164), 32 states have internal predecessors, (164), 12 states have call successors, (83), 6 states have call predecessors, (83), 10 states have return successors, (83), 11 states have call predecessors, (83), 12 states have call successors, (83)