./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-18.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 7e6fc8e4e7ef819efaa9b7aff5e1f77d64399216ddf69d732052113bf27a4b18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:30:18,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:30:18,357 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:30:18,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:30:18,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:30:18,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:30:18,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:30:18,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:30:18,387 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:30:18,388 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:30:18,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:30:18,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:30:18,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:30:18,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:30:18,389 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:30:18,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:30:18,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:30:18,390 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:30:18,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:30:18,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:30:18,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:30:18,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:30:18,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:30:18,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:30:18,390 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:30:18,390 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:30:18,390 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:30:18,390 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:30:18,390 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:30:18,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:30:18,391 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:30:18,391 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:30:18,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:30:18,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:30:18,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:30:18,391 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:30:18,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:30:18,392 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:30:18,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:30:18,392 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:30:18,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:30:18,392 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:30:18,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:30:18,392 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 -> 7e6fc8e4e7ef819efaa9b7aff5e1f77d64399216ddf69d732052113bf27a4b18 [2025-03-04 00:30:18,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:30:18,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:30:18,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:30:18,619 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:30:18,619 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:30:18,620 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-18.i [2025-03-04 00:30:19,723 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f545e0ef/13865363f8eb44b7853167db4eb358fe/FLAGf80004d3f [2025-03-04 00:30:20,066 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:30:20,067 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-18.i [2025-03-04 00:30:20,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f545e0ef/13865363f8eb44b7853167db4eb358fe/FLAGf80004d3f [2025-03-04 00:30:20,288 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f545e0ef/13865363f8eb44b7853167db4eb358fe [2025-03-04 00:30:20,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:30:20,290 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:30:20,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:30:20,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:30:20,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:30:20,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:30:20" (1/1) ... [2025-03-04 00:30:20,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d327c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:20, skipping insertion in model container [2025-03-04 00:30:20,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:30:20" (1/1) ... [2025-03-04 00:30:20,318 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:30:20,413 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_amount500_file-18.i[916,929] [2025-03-04 00:30:20,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:30:20,583 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:30:20,593 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_amount500_file-18.i[916,929] [2025-03-04 00:30:20,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:30:20,690 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:30:20,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:20 WrapperNode [2025-03-04 00:30:20,692 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:30:20,693 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:30:20,693 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:30:20,693 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:30:20,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:20" (1/1) ... [2025-03-04 00:30:20,718 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:20" (1/1) ... [2025-03-04 00:30:20,797 INFO L138 Inliner]: procedures = 26, calls = 90, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 703 [2025-03-04 00:30:20,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:30:20,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:30:20,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:30:20,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:30:20,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:20" (1/1) ... [2025-03-04 00:30:20,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:20" (1/1) ... [2025-03-04 00:30:20,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:20" (1/1) ... [2025-03-04 00:30:20,929 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:30:20,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:20" (1/1) ... [2025-03-04 00:30:20,929 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:20" (1/1) ... [2025-03-04 00:30:20,961 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:20" (1/1) ... [2025-03-04 00:30:20,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:20" (1/1) ... [2025-03-04 00:30:20,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:20" (1/1) ... [2025-03-04 00:30:20,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:20" (1/1) ... [2025-03-04 00:30:20,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:30:20,995 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:30:20,995 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:30:20,996 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:30:20,996 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:20" (1/1) ... [2025-03-04 00:30:21,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:30:21,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:30:21,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:30:21,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:30:21,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:30:21,041 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:30:21,042 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:30:21,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:30:21,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:30:21,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:30:21,159 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:30:21,161 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:30:21,981 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L644: havoc property_#t~bitwise53#1;havoc property_#t~short54#1;havoc property_#t~ite57#1;havoc property_#t~bitwise55#1;havoc property_#t~bitwise56#1;havoc property_#t~short58#1;havoc property_#t~ite61#1;havoc property_#t~ite60#1;havoc property_#t~bitwise59#1;havoc property_#t~short62#1; [2025-03-04 00:30:22,114 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2025-03-04 00:30:22,114 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:30:22,137 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:30:22,141 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:30:22,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:30:22 BoogieIcfgContainer [2025-03-04 00:30:22,142 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:30:22,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:30:22,144 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:30:22,147 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:30:22,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:30:20" (1/3) ... [2025-03-04 00:30:22,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5546c2b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:30:22, skipping insertion in model container [2025-03-04 00:30:22,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:20" (2/3) ... [2025-03-04 00:30:22,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5546c2b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:30:22, skipping insertion in model container [2025-03-04 00:30:22,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:30:22" (3/3) ... [2025-03-04 00:30:22,150 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-18.i [2025-03-04 00:30:22,160 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:30:22,163 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-18.i that has 2 procedures, 280 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:30:22,216 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:30:22,226 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;@2c0a1cac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:30:22,227 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:30:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 280 states, 200 states have (on average 1.53) internal successors, (306), 201 states have internal predecessors, (306), 77 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2025-03-04 00:30:22,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-03-04 00:30:22,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:22,257 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:30:22,257 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:22,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:22,262 INFO L85 PathProgramCache]: Analyzing trace with hash -972293122, now seen corresponding path program 1 times [2025-03-04 00:30:22,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:22,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935948] [2025-03-04 00:30:22,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:22,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:22,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-04 00:30:22,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-04 00:30:22,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:22,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:22,868 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 11552 trivial. 0 not checked. [2025-03-04 00:30:22,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:22,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935948] [2025-03-04 00:30:22,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:30:22,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053924214] [2025-03-04 00:30:22,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:22,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:30:22,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:30:22,872 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:30:22,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:30:23,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-04 00:30:23,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-04 00:30:23,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:23,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:23,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:30:23,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:30:23,282 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 11552 trivial. 0 not checked. [2025-03-04 00:30:23,282 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:30:23,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053924214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:23,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:30:23,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:30:23,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508467130] [2025-03-04 00:30:23,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:23,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:30:23,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:23,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:30:23,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:30:23,314 INFO L87 Difference]: Start difference. First operand has 280 states, 200 states have (on average 1.53) internal successors, (306), 201 states have internal predecessors, (306), 77 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) Second operand has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (77), 2 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 2 states have call successors, (77) [2025-03-04 00:30:23,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:23,381 INFO L93 Difference]: Finished difference Result 554 states and 992 transitions. [2025-03-04 00:30:23,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:30:23,385 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (77), 2 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 2 states have call successors, (77) Word has length 514 [2025-03-04 00:30:23,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:23,393 INFO L225 Difference]: With dead ends: 554 [2025-03-04 00:30:23,394 INFO L226 Difference]: Without dead ends: 277 [2025-03-04 00:30:23,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:30:23,402 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:23,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 446 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:30:23,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-04 00:30:23,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2025-03-04 00:30:23,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 198 states have (on average 1.5151515151515151) internal successors, (300), 198 states have internal predecessors, (300), 77 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2025-03-04 00:30:23,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 454 transitions. [2025-03-04 00:30:23,473 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 454 transitions. Word has length 514 [2025-03-04 00:30:23,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:23,473 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 454 transitions. [2025-03-04 00:30:23,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (77), 2 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 2 states have call successors, (77) [2025-03-04 00:30:23,474 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 454 transitions. [2025-03-04 00:30:23,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-03-04 00:30:23,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:23,483 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:30:23,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:30:23,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:30:23,684 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:23,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:23,686 INFO L85 PathProgramCache]: Analyzing trace with hash 698518399, now seen corresponding path program 1 times [2025-03-04 00:30:23,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:23,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447579931] [2025-03-04 00:30:23,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:23,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:23,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-04 00:30:23,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-04 00:30:23,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:23,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:30:24,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:24,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447579931] [2025-03-04 00:30:24,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447579931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:24,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:24,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:30:24,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017928967] [2025-03-04 00:30:24,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:24,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:30:24,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:24,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:30:24,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:30:24,268 INFO L87 Difference]: Start difference. First operand 277 states and 454 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:30:24,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:24,405 INFO L93 Difference]: Finished difference Result 821 states and 1348 transitions. [2025-03-04 00:30:24,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:30:24,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 514 [2025-03-04 00:30:24,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:24,414 INFO L225 Difference]: With dead ends: 821 [2025-03-04 00:30:24,415 INFO L226 Difference]: Without dead ends: 547 [2025-03-04 00:30:24,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:30:24,418 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 437 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:24,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1103 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:30:24,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-04 00:30:24,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 349. [2025-03-04 00:30:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 270 states have (on average 1.5629629629629629) internal successors, (422), 270 states have internal predecessors, (422), 77 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2025-03-04 00:30:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 576 transitions. [2025-03-04 00:30:24,450 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 576 transitions. Word has length 514 [2025-03-04 00:30:24,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:24,452 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 576 transitions. [2025-03-04 00:30:24,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:30:24,452 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 576 transitions. [2025-03-04 00:30:24,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-03-04 00:30:24,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:24,457 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:30:24,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:30:24,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:24,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:24,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1241369121, now seen corresponding path program 1 times [2025-03-04 00:30:24,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:24,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137332466] [2025-03-04 00:30:24,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:24,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:24,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-04 00:30:24,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-04 00:30:24,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:24,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:25,350 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:30:25,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:25,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137332466] [2025-03-04 00:30:25,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137332466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:25,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:25,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:25,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152685111] [2025-03-04 00:30:25,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:25,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:25,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:25,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:25,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:25,355 INFO L87 Difference]: Start difference. First operand 349 states and 576 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:30:25,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:25,759 INFO L93 Difference]: Finished difference Result 1186 states and 1969 transitions. [2025-03-04 00:30:25,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:30:25,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 514 [2025-03-04 00:30:25,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:25,766 INFO L225 Difference]: With dead ends: 1186 [2025-03-04 00:30:25,767 INFO L226 Difference]: Without dead ends: 840 [2025-03-04 00:30:25,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:30:25,770 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 515 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:25,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1450 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:30:25,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2025-03-04 00:30:25,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 683. [2025-03-04 00:30:25,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 526 states have (on average 1.549429657794677) internal successors, (815), 526 states have internal predecessors, (815), 154 states have call successors, (154), 2 states have call predecessors, (154), 2 states have return successors, (154), 154 states have call predecessors, (154), 154 states have call successors, (154) [2025-03-04 00:30:25,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1123 transitions. [2025-03-04 00:30:25,837 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1123 transitions. Word has length 514 [2025-03-04 00:30:25,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:25,840 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 1123 transitions. [2025-03-04 00:30:25,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:30:25,841 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1123 transitions. [2025-03-04 00:30:25,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-03-04 00:30:25,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:25,847 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:30:25,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:30:25,847 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:25,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:25,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1948996192, now seen corresponding path program 1 times [2025-03-04 00:30:25,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:25,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18061736] [2025-03-04 00:30:25,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:25,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:25,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-04 00:30:25,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-04 00:30:25,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:25,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:30:27,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:27,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18061736] [2025-03-04 00:30:27,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18061736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:27,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:27,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:27,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509849369] [2025-03-04 00:30:27,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:27,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:27,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:27,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:27,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:27,013 INFO L87 Difference]: Start difference. First operand 683 states and 1123 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:30:27,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:27,299 INFO L93 Difference]: Finished difference Result 1761 states and 2877 transitions. [2025-03-04 00:30:27,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:30:27,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 514 [2025-03-04 00:30:27,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:27,306 INFO L225 Difference]: With dead ends: 1761 [2025-03-04 00:30:27,307 INFO L226 Difference]: Without dead ends: 1081 [2025-03-04 00:30:27,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:30:27,309 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 446 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:27,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 1469 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:30:27,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2025-03-04 00:30:27,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 966. [2025-03-04 00:30:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 795 states have (on average 1.5660377358490567) internal successors, (1245), 797 states have internal predecessors, (1245), 166 states have call successors, (166), 4 states have call predecessors, (166), 4 states have return successors, (166), 164 states have call predecessors, (166), 166 states have call successors, (166) [2025-03-04 00:30:27,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1577 transitions. [2025-03-04 00:30:27,410 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1577 transitions. Word has length 514 [2025-03-04 00:30:27,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:27,411 INFO L471 AbstractCegarLoop]: Abstraction has 966 states and 1577 transitions. [2025-03-04 00:30:27,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:30:27,412 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1577 transitions. [2025-03-04 00:30:27,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-03-04 00:30:27,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:27,417 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:30:27,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:30:27,417 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:27,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:27,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1041577375, now seen corresponding path program 1 times [2025-03-04 00:30:27,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:27,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925525071] [2025-03-04 00:30:27,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:27,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:27,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-04 00:30:27,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-04 00:30:27,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:27,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:27,669 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:30:27,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:27,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925525071] [2025-03-04 00:30:27,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925525071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:27,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:27,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:30:27,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242675333] [2025-03-04 00:30:27,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:27,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:30:27,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:27,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:30:27,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:30:27,673 INFO L87 Difference]: Start difference. First operand 966 states and 1577 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:30:27,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:27,754 INFO L93 Difference]: Finished difference Result 1941 states and 3160 transitions. [2025-03-04 00:30:27,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:30:27,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 514 [2025-03-04 00:30:27,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:27,760 INFO L225 Difference]: With dead ends: 1941 [2025-03-04 00:30:27,761 INFO L226 Difference]: Without dead ends: 978 [2025-03-04 00:30:27,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:30:27,764 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 182 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:27,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 986 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:30:27,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-03-04 00:30:27,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 867. [2025-03-04 00:30:27,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 708 states have (on average 1.5692090395480225) internal successors, (1111), 708 states have internal predecessors, (1111), 154 states have call successors, (154), 4 states have call predecessors, (154), 4 states have return successors, (154), 154 states have call predecessors, (154), 154 states have call successors, (154) [2025-03-04 00:30:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1419 transitions. [2025-03-04 00:30:27,857 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1419 transitions. Word has length 514 [2025-03-04 00:30:27,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:27,859 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1419 transitions. [2025-03-04 00:30:27,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:30:27,860 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1419 transitions. [2025-03-04 00:30:27,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2025-03-04 00:30:27,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:27,866 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:30:27,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:30:27,869 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:27,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:27,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1202988109, now seen corresponding path program 1 times [2025-03-04 00:30:27,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:27,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602957216] [2025-03-04 00:30:27,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:27,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:27,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 515 statements into 1 equivalence classes. [2025-03-04 00:30:28,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 515 of 515 statements. [2025-03-04 00:30:28,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:28,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:28,860 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:30:28,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:28,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602957216] [2025-03-04 00:30:28,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602957216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:28,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:28,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:30:28,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080940587] [2025-03-04 00:30:28,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:28,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:30:28,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:28,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:30:28,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:30:28,862 INFO L87 Difference]: Start difference. First operand 867 states and 1419 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:30:28,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:28,995 INFO L93 Difference]: Finished difference Result 1731 states and 2835 transitions. [2025-03-04 00:30:28,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:30:28,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 515 [2025-03-04 00:30:28,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:29,004 INFO L225 Difference]: With dead ends: 1731 [2025-03-04 00:30:29,004 INFO L226 Difference]: Without dead ends: 867 [2025-03-04 00:30:29,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:30:29,008 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 0 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:29,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 840 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:30:29,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2025-03-04 00:30:29,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 867. [2025-03-04 00:30:29,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 708 states have (on average 1.560734463276836) internal successors, (1105), 708 states have internal predecessors, (1105), 154 states have call successors, (154), 4 states have call predecessors, (154), 4 states have return successors, (154), 154 states have call predecessors, (154), 154 states have call successors, (154) [2025-03-04 00:30:29,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1413 transitions. [2025-03-04 00:30:29,050 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1413 transitions. Word has length 515 [2025-03-04 00:30:29,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:29,050 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1413 transitions. [2025-03-04 00:30:29,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:30:29,051 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1413 transitions. [2025-03-04 00:30:29,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2025-03-04 00:30:29,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:29,056 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:30:29,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:30:29,056 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:29,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:29,057 INFO L85 PathProgramCache]: Analyzing trace with hash 617949447, now seen corresponding path program 1 times [2025-03-04 00:30:29,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:29,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075062970] [2025-03-04 00:30:29,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:29,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:29,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-03-04 00:30:29,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-03-04 00:30:29,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:29,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:30:30,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:30,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075062970] [2025-03-04 00:30:30,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075062970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:30,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:30,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:30:30,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592147943] [2025-03-04 00:30:30,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:30,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:30:30,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:30,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:30:30,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:30:30,158 INFO L87 Difference]: Start difference. First operand 867 states and 1413 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) [2025-03-04 00:30:30,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:30,674 INFO L93 Difference]: Finished difference Result 2817 states and 4563 transitions. [2025-03-04 00:30:30,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:30:30,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) Word has length 516 [2025-03-04 00:30:30,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:30,683 INFO L225 Difference]: With dead ends: 2817 [2025-03-04 00:30:30,683 INFO L226 Difference]: Without dead ends: 1953 [2025-03-04 00:30:30,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:30:30,686 INFO L435 NwaCegarLoop]: 645 mSDtfsCounter, 1897 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1897 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:30,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1897 Valid, 1792 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:30:30,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2025-03-04 00:30:30,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1725. [2025-03-04 00:30:30,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1725 states, 1408 states have (on average 1.5610795454545454) internal successors, (2198), 1408 states have internal predecessors, (2198), 308 states have call successors, (308), 8 states have call predecessors, (308), 8 states have return successors, (308), 308 states have call predecessors, (308), 308 states have call successors, (308) [2025-03-04 00:30:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 2814 transitions. [2025-03-04 00:30:30,787 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 2814 transitions. Word has length 516 [2025-03-04 00:30:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:30,788 INFO L471 AbstractCegarLoop]: Abstraction has 1725 states and 2814 transitions. [2025-03-04 00:30:30,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 2 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) [2025-03-04 00:30:30,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2814 transitions. [2025-03-04 00:30:30,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2025-03-04 00:30:30,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:30,794 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:30:30,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:30:30,795 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:30,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:30,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1452100157, now seen corresponding path program 1 times [2025-03-04 00:30:30,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:30,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101002519] [2025-03-04 00:30:30,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:30,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:30,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-03-04 00:30:30,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-03-04 00:30:30,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:30,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:31,420 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:30:31,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:31,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101002519] [2025-03-04 00:30:31,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101002519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:31,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:31,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:31,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977480168] [2025-03-04 00:30:31,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:31,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:31,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:31,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:31,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:31,422 INFO L87 Difference]: Start difference. First operand 1725 states and 2814 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:30:31,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:31,887 INFO L93 Difference]: Finished difference Result 5355 states and 8743 transitions. [2025-03-04 00:30:31,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:30:31,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 516 [2025-03-04 00:30:31,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:31,904 INFO L225 Difference]: With dead ends: 5355 [2025-03-04 00:30:31,905 INFO L226 Difference]: Without dead ends: 3633 [2025-03-04 00:30:31,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:30:31,909 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 675 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:31,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 1635 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:30:31,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3633 states. [2025-03-04 00:30:32,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3633 to 2947. [2025-03-04 00:30:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2947 states, 2522 states have (on average 1.5757335448057097) internal successors, (3974), 2526 states have internal predecessors, (3974), 408 states have call successors, (408), 16 states have call predecessors, (408), 16 states have return successors, (408), 404 states have call predecessors, (408), 408 states have call successors, (408) [2025-03-04 00:30:32,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 4790 transitions. [2025-03-04 00:30:32,053 INFO L78 Accepts]: Start accepts. Automaton has 2947 states and 4790 transitions. Word has length 516 [2025-03-04 00:30:32,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:32,053 INFO L471 AbstractCegarLoop]: Abstraction has 2947 states and 4790 transitions. [2025-03-04 00:30:32,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:30:32,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 4790 transitions. [2025-03-04 00:30:32,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2025-03-04 00:30:32,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:32,060 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:30:32,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:30:32,061 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:32,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:32,061 INFO L85 PathProgramCache]: Analyzing trace with hash -656933092, now seen corresponding path program 1 times [2025-03-04 00:30:32,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:32,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528914249] [2025-03-04 00:30:32,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:32,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:32,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-03-04 00:30:32,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-03-04 00:30:32,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:32,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:32,805 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:30:32,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:32,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528914249] [2025-03-04 00:30:32,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528914249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:32,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:32,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:32,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180158562] [2025-03-04 00:30:32,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:32,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:32,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:32,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:32,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:32,807 INFO L87 Difference]: Start difference. First operand 2947 states and 4790 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:30:33,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:33,100 INFO L93 Difference]: Finished difference Result 7528 states and 12262 transitions. [2025-03-04 00:30:33,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:30:33,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 516 [2025-03-04 00:30:33,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:33,122 INFO L225 Difference]: With dead ends: 7528 [2025-03-04 00:30:33,123 INFO L226 Difference]: Without dead ends: 4584 [2025-03-04 00:30:33,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:33,132 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 443 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:33,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1113 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:30:33,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4584 states. [2025-03-04 00:30:33,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4584 to 2947. [2025-03-04 00:30:33,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2947 states, 2522 states have (on average 1.5741475019825535) internal successors, (3970), 2526 states have internal predecessors, (3970), 408 states have call successors, (408), 16 states have call predecessors, (408), 16 states have return successors, (408), 404 states have call predecessors, (408), 408 states have call successors, (408) [2025-03-04 00:30:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 4786 transitions. [2025-03-04 00:30:33,332 INFO L78 Accepts]: Start accepts. Automaton has 2947 states and 4786 transitions. Word has length 516 [2025-03-04 00:30:33,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:33,333 INFO L471 AbstractCegarLoop]: Abstraction has 2947 states and 4786 transitions. [2025-03-04 00:30:33,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:30:33,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 4786 transitions. [2025-03-04 00:30:33,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2025-03-04 00:30:33,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:33,338 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:30:33,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:30:33,338 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:33,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:33,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1823629411, now seen corresponding path program 1 times [2025-03-04 00:30:33,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:33,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406172688] [2025-03-04 00:30:33,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:33,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:33,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-03-04 00:30:33,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-03-04 00:30:33,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:33,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:34,005 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:30:34,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:34,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406172688] [2025-03-04 00:30:34,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406172688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:34,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:34,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:30:34,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597487678] [2025-03-04 00:30:34,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:34,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:30:34,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:34,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:30:34,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:30:34,008 INFO L87 Difference]: Start difference. First operand 2947 states and 4786 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:30:34,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:34,520 INFO L93 Difference]: Finished difference Result 7916 states and 12922 transitions. [2025-03-04 00:30:34,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:30:34,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 516 [2025-03-04 00:30:34,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:34,539 INFO L225 Difference]: With dead ends: 7916 [2025-03-04 00:30:34,539 INFO L226 Difference]: Without dead ends: 4972 [2025-03-04 00:30:34,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:30:34,547 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 539 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:34,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1388 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:30:34,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4972 states. [2025-03-04 00:30:34,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4972 to 3138. [2025-03-04 00:30:34,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3138 states, 2634 states have (on average 1.560364464692483) internal successors, (4110), 2638 states have internal predecessors, (4110), 485 states have call successors, (485), 18 states have call predecessors, (485), 18 states have return successors, (485), 481 states have call predecessors, (485), 485 states have call successors, (485) [2025-03-04 00:30:34,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 5080 transitions. [2025-03-04 00:30:34,749 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 5080 transitions. Word has length 516 [2025-03-04 00:30:34,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:34,750 INFO L471 AbstractCegarLoop]: Abstraction has 3138 states and 5080 transitions. [2025-03-04 00:30:34,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:30:34,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 5080 transitions. [2025-03-04 00:30:34,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2025-03-04 00:30:34,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:34,760 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:30:34,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:30:34,760 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:34,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:34,761 INFO L85 PathProgramCache]: Analyzing trace with hash -869400516, now seen corresponding path program 1 times [2025-03-04 00:30:34,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:34,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644498307] [2025-03-04 00:30:34,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:34,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:34,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-03-04 00:30:35,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-03-04 00:30:35,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:35,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:35,483 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:30:35,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:35,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644498307] [2025-03-04 00:30:35,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644498307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:35,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:35,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:35,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058308143] [2025-03-04 00:30:35,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:35,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:35,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:35,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:35,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:35,485 INFO L87 Difference]: Start difference. First operand 3138 states and 5080 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:30:35,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:35,923 INFO L93 Difference]: Finished difference Result 8426 states and 13690 transitions. [2025-03-04 00:30:35,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:30:35,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 516 [2025-03-04 00:30:35,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:35,960 INFO L225 Difference]: With dead ends: 8426 [2025-03-04 00:30:35,960 INFO L226 Difference]: Without dead ends: 5482 [2025-03-04 00:30:35,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:35,969 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 264 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:35,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1273 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:30:35,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5482 states. [2025-03-04 00:30:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5482 to 5476. [2025-03-04 00:30:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5476 states, 4708 states have (on average 1.5692438402718776) internal successors, (7388), 4720 states have internal predecessors, (7388), 733 states have call successors, (733), 34 states have call predecessors, (733), 34 states have return successors, (733), 721 states have call predecessors, (733), 733 states have call successors, (733) [2025-03-04 00:30:36,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5476 states to 5476 states and 8854 transitions. [2025-03-04 00:30:36,291 INFO L78 Accepts]: Start accepts. Automaton has 5476 states and 8854 transitions. Word has length 516 [2025-03-04 00:30:36,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:36,292 INFO L471 AbstractCegarLoop]: Abstraction has 5476 states and 8854 transitions. [2025-03-04 00:30:36,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:30:36,292 INFO L276 IsEmpty]: Start isEmpty. Operand 5476 states and 8854 transitions. [2025-03-04 00:30:36,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2025-03-04 00:30:36,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:36,299 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:30:36,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:30:36,301 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:36,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:36,301 INFO L85 PathProgramCache]: Analyzing trace with hash -768488549, now seen corresponding path program 1 times [2025-03-04 00:30:36,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:36,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828648816] [2025-03-04 00:30:36,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:36,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:36,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-03-04 00:30:36,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-03-04 00:30:36,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:36,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:36,521 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:30:36,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:36,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828648816] [2025-03-04 00:30:36,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828648816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:36,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:36,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:36,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011111862] [2025-03-04 00:30:36,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:36,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:36,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:36,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:36,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:36,522 INFO L87 Difference]: Start difference. First operand 5476 states and 8854 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:30:36,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:36,852 INFO L93 Difference]: Finished difference Result 15062 states and 24358 transitions. [2025-03-04 00:30:36,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:30:36,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 516 [2025-03-04 00:30:36,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:36,885 INFO L225 Difference]: With dead ends: 15062 [2025-03-04 00:30:36,885 INFO L226 Difference]: Without dead ends: 9780 [2025-03-04 00:30:36,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:30:36,898 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 284 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:36,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1671 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:30:36,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9780 states. [2025-03-04 00:30:37,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9780 to 9778. [2025-03-04 00:30:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9778 states, 8322 states have (on average 1.5585195866378274) internal successors, (12970), 8346 states have internal predecessors, (12970), 1389 states have call successors, (1389), 66 states have call predecessors, (1389), 66 states have return successors, (1389), 1365 states have call predecessors, (1389), 1389 states have call successors, (1389) [2025-03-04 00:30:37,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9778 states to 9778 states and 15748 transitions. [2025-03-04 00:30:37,308 INFO L78 Accepts]: Start accepts. Automaton has 9778 states and 15748 transitions. Word has length 516 [2025-03-04 00:30:37,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:37,309 INFO L471 AbstractCegarLoop]: Abstraction has 9778 states and 15748 transitions. [2025-03-04 00:30:37,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:30:37,309 INFO L276 IsEmpty]: Start isEmpty. Operand 9778 states and 15748 transitions. [2025-03-04 00:30:37,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-03-04 00:30:37,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:37,318 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:30:37,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:30:37,318 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:37,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:37,319 INFO L85 PathProgramCache]: Analyzing trace with hash -575532484, now seen corresponding path program 1 times [2025-03-04 00:30:37,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:37,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246556111] [2025-03-04 00:30:37,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:37,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:37,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-04 00:30:38,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-04 00:30:38,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:38,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:52,415 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:30:52,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:52,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246556111] [2025-03-04 00:30:52,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246556111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:52,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:52,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:30:52,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237424883] [2025-03-04 00:30:52,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:52,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:30:52,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:52,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:30:52,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:30:52,418 INFO L87 Difference]: Start difference. First operand 9778 states and 15748 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:30:54,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:54,464 INFO L93 Difference]: Finished difference Result 37762 states and 60887 transitions. [2025-03-04 00:30:54,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:30:54,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 517 [2025-03-04 00:30:54,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:54,553 INFO L225 Difference]: With dead ends: 37762 [2025-03-04 00:30:54,553 INFO L226 Difference]: Without dead ends: 28178 [2025-03-04 00:30:54,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:30:54,584 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 870 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:54,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 2391 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 00:30:54,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28178 states. [2025-03-04 00:30:55,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28178 to 26980. [2025-03-04 00:30:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26980 states, 23635 states have (on average 1.5771102178971863) internal successors, (37275), 23723 states have internal predecessors, (37275), 3117 states have call successors, (3117), 227 states have call predecessors, (3117), 227 states have return successors, (3117), 3029 states have call predecessors, (3117), 3117 states have call successors, (3117) [2025-03-04 00:30:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26980 states to 26980 states and 43509 transitions. [2025-03-04 00:30:55,850 INFO L78 Accepts]: Start accepts. Automaton has 26980 states and 43509 transitions. Word has length 517 [2025-03-04 00:30:55,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:55,851 INFO L471 AbstractCegarLoop]: Abstraction has 26980 states and 43509 transitions. [2025-03-04 00:30:55,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:30:55,852 INFO L276 IsEmpty]: Start isEmpty. Operand 26980 states and 43509 transitions. [2025-03-04 00:30:55,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-03-04 00:30:55,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:55,876 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:30:55,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:30:55,877 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:55,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:55,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1758879781, now seen corresponding path program 1 times [2025-03-04 00:30:55,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:55,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028446991] [2025-03-04 00:30:55,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:55,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:55,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-04 00:30:56,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-04 00:30:56,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:56,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:08,307 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:31:08,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:08,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028446991] [2025-03-04 00:31:08,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028446991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:08,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:08,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:31:08,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149724934] [2025-03-04 00:31:08,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:08,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:31:08,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:08,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:31:08,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:31:08,309 INFO L87 Difference]: Start difference. First operand 26980 states and 43509 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:31:10,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:10,397 INFO L93 Difference]: Finished difference Result 66848 states and 108082 transitions. [2025-03-04 00:31:10,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:31:10,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 517 [2025-03-04 00:31:10,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:10,516 INFO L225 Difference]: With dead ends: 66848 [2025-03-04 00:31:10,516 INFO L226 Difference]: Without dead ends: 40066 [2025-03-04 00:31:10,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:31:10,569 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 551 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1489 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:10,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1489 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 00:31:10,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40066 states. [2025-03-04 00:31:11,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40066 to 38910. [2025-03-04 00:31:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38910 states, 34637 states have (on average 1.5893120073909404) internal successors, (55049), 34753 states have internal predecessors, (55049), 3981 states have call successors, (3981), 291 states have call predecessors, (3981), 291 states have return successors, (3981), 3865 states have call predecessors, (3981), 3981 states have call successors, (3981) [2025-03-04 00:31:12,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38910 states to 38910 states and 63011 transitions. [2025-03-04 00:31:12,046 INFO L78 Accepts]: Start accepts. Automaton has 38910 states and 63011 transitions. Word has length 517 [2025-03-04 00:31:12,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:12,047 INFO L471 AbstractCegarLoop]: Abstraction has 38910 states and 63011 transitions. [2025-03-04 00:31:12,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:31:12,047 INFO L276 IsEmpty]: Start isEmpty. Operand 38910 states and 63011 transitions. [2025-03-04 00:31:12,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-03-04 00:31:12,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:12,082 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:12,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 00:31:12,082 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:12,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:12,085 INFO L85 PathProgramCache]: Analyzing trace with hash -971287621, now seen corresponding path program 1 times [2025-03-04 00:31:12,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:12,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107926021] [2025-03-04 00:31:12,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:12,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:12,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-04 00:31:12,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-04 00:31:12,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:12,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:12,226 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:31:12,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:12,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107926021] [2025-03-04 00:31:12,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107926021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:12,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:12,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:31:12,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81792071] [2025-03-04 00:31:12,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:12,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:31:12,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:12,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:31:12,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:31:12,230 INFO L87 Difference]: Start difference. First operand 38910 states and 63011 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:31:13,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:13,230 INFO L93 Difference]: Finished difference Result 61556 states and 99675 transitions. [2025-03-04 00:31:13,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:31:13,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 517 [2025-03-04 00:31:13,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:13,332 INFO L225 Difference]: With dead ends: 61556 [2025-03-04 00:31:13,332 INFO L226 Difference]: Without dead ends: 37104 [2025-03-04 00:31:13,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:31:13,376 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 434 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:13,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1250 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:31:13,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37104 states. [2025-03-04 00:31:14,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37104 to 37102. [2025-03-04 00:31:14,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37102 states, 32829 states have (on average 1.5763197173230985) internal successors, (51749), 32945 states have internal predecessors, (51749), 3981 states have call successors, (3981), 291 states have call predecessors, (3981), 291 states have return successors, (3981), 3865 states have call predecessors, (3981), 3981 states have call successors, (3981) [2025-03-04 00:31:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37102 states to 37102 states and 59711 transitions. [2025-03-04 00:31:14,745 INFO L78 Accepts]: Start accepts. Automaton has 37102 states and 59711 transitions. Word has length 517 [2025-03-04 00:31:14,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:14,746 INFO L471 AbstractCegarLoop]: Abstraction has 37102 states and 59711 transitions. [2025-03-04 00:31:14,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:31:14,746 INFO L276 IsEmpty]: Start isEmpty. Operand 37102 states and 59711 transitions. [2025-03-04 00:31:14,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-03-04 00:31:14,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:14,768 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:14,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 00:31:14,769 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:14,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:14,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1308778395, now seen corresponding path program 1 times [2025-03-04 00:31:14,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:14,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332322208] [2025-03-04 00:31:14,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:14,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:14,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-04 00:31:14,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-04 00:31:14,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:14,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:15,205 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-03-04 00:31:15,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:15,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332322208] [2025-03-04 00:31:15,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332322208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:15,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:15,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:31:15,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93063222] [2025-03-04 00:31:15,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:15,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:31:15,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:15,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:31:15,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:15,207 INFO L87 Difference]: Start difference. First operand 37102 states and 59711 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:31:17,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:17,513 INFO L93 Difference]: Finished difference Result 75016 states and 119898 transitions. [2025-03-04 00:31:17,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:31:17,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 517 [2025-03-04 00:31:17,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:17,622 INFO L225 Difference]: With dead ends: 75016 [2025-03-04 00:31:17,622 INFO L226 Difference]: Without dead ends: 52372 [2025-03-04 00:31:17,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:31:17,651 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 539 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:17,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1279 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:31:17,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52372 states. [2025-03-04 00:31:19,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52372 to 37066. [2025-03-04 00:31:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37066 states, 32793 states have (on average 1.5758546031165188) internal successors, (51677), 32909 states have internal predecessors, (51677), 3981 states have call successors, (3981), 291 states have call predecessors, (3981), 291 states have return successors, (3981), 3865 states have call predecessors, (3981), 3981 states have call successors, (3981) [2025-03-04 00:31:19,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37066 states to 37066 states and 59639 transitions. [2025-03-04 00:31:19,145 INFO L78 Accepts]: Start accepts. Automaton has 37066 states and 59639 transitions. Word has length 517 [2025-03-04 00:31:19,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:19,146 INFO L471 AbstractCegarLoop]: Abstraction has 37066 states and 59639 transitions. [2025-03-04 00:31:19,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-03-04 00:31:19,147 INFO L276 IsEmpty]: Start isEmpty. Operand 37066 states and 59639 transitions. [2025-03-04 00:31:19,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-03-04 00:31:19,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:19,166 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:19,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 00:31:19,167 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:19,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:19,167 INFO L85 PathProgramCache]: Analyzing trace with hash 557658109, now seen corresponding path program 1 times [2025-03-04 00:31:19,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:19,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23146206] [2025-03-04 00:31:19,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:19,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:19,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-04 00:31:20,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-04 00:31:20,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:20,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat