./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de52c08fb0028bef519c22f81b06d40dd6144270e7f5fea59e5bb117b888da23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:25:35,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:25:35,303 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:25:35,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:25:35,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:25:35,326 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:25:35,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:25:35,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:25:35,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:25:35,329 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:25:35,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:25:35,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:25:35,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:25:35,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:25:35,331 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:25:35,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:25:35,331 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:25:35,331 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:25:35,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:25:35,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:25:35,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:25:35,331 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:25:35,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:25:35,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:25:35,332 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:25:35,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:25:35,332 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:25:35,332 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:25:35,332 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:25:35,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:25:35,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:25:35,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:25:35,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:25:35,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:25:35,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:25:35,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:25:35,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:25:35,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:25:35,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:25:35,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:25:35,333 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:25:35,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:25:35,334 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:25:35,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:25:35,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:25:35,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:25:35,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:25:35,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:25:35,334 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de52c08fb0028bef519c22f81b06d40dd6144270e7f5fea59e5bb117b888da23 [2025-01-09 14:25:35,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:25:35,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:25:35,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:25:35,566 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:25:35,566 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:25:35,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i [2025-01-09 14:25:36,706 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1fb3b4176/79b30fadf47a422d94e6b89c2b6258d7/FLAG05dc23537 [2025-01-09 14:25:37,086 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:25:37,087 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i [2025-01-09 14:25:37,103 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1fb3b4176/79b30fadf47a422d94e6b89c2b6258d7/FLAG05dc23537 [2025-01-09 14:25:37,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1fb3b4176/79b30fadf47a422d94e6b89c2b6258d7 [2025-01-09 14:25:37,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:25:37,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:25:37,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:25:37,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:25:37,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:25:37,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:25:37" (1/1) ... [2025-01-09 14:25:37,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a317b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:37, skipping insertion in model container [2025-01-09 14:25:37,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:25:37" (1/1) ... [2025-01-09 14:25:37,316 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:25:37,433 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i[916,929] [2025-01-09 14:25:37,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:25:37,547 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:25:37,554 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i[916,929] [2025-01-09 14:25:37,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:25:37,636 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:25:37,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:37 WrapperNode [2025-01-09 14:25:37,639 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:25:37,640 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:25:37,640 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:25:37,640 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:25:37,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:37" (1/1) ... [2025-01-09 14:25:37,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:37" (1/1) ... [2025-01-09 14:25:37,692 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 367 [2025-01-09 14:25:37,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:25:37,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:25:37,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:25:37,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:25:37,699 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:37" (1/1) ... [2025-01-09 14:25:37,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:37" (1/1) ... [2025-01-09 14:25:37,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:37" (1/1) ... [2025-01-09 14:25:37,735 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-01-09 14:25:37,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:37" (1/1) ... [2025-01-09 14:25:37,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:37" (1/1) ... [2025-01-09 14:25:37,756 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:37" (1/1) ... [2025-01-09 14:25:37,761 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:37" (1/1) ... [2025-01-09 14:25:37,764 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:37" (1/1) ... [2025-01-09 14:25:37,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:37" (1/1) ... [2025-01-09 14:25:37,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:37" (1/1) ... [2025-01-09 14:25:37,783 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:25:37,785 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:25:37,785 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:25:37,785 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:25:37,786 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:37" (1/1) ... [2025-01-09 14:25:37,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:25:37,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:25:37,813 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:25:37,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:25:37,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:25:37,830 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:25:37,830 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:25:37,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:25:37,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:25:37,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:25:37,905 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:25:37,906 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:25:38,520 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-01-09 14:25:38,520 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:25:38,527 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:25:38,527 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:25:38,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:25:38 BoogieIcfgContainer [2025-01-09 14:25:38,527 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:25:38,529 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:25:38,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:25:38,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:25:38,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:25:37" (1/3) ... [2025-01-09 14:25:38,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b6e49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:25:38, skipping insertion in model container [2025-01-09 14:25:38,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:25:37" (2/3) ... [2025-01-09 14:25:38,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b6e49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:25:38, skipping insertion in model container [2025-01-09 14:25:38,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:25:38" (3/3) ... [2025-01-09 14:25:38,533 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-56.i [2025-01-09 14:25:38,542 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:25:38,544 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-56.i that has 2 procedures, 156 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:25:38,577 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:25:38,584 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;@74eb4574, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:25:38,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:25:38,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 156 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 104 states have internal predecessors, (152), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 14:25:38,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-01-09 14:25:38,597 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:38,597 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:25:38,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:38,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:38,601 INFO L85 PathProgramCache]: Analyzing trace with hash 846488390, now seen corresponding path program 1 times [2025-01-09 14:25:38,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:38,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983646738] [2025-01-09 14:25:38,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:38,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:38,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-09 14:25:38,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-09 14:25:38,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:38,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:38,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-01-09 14:25:38,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:38,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983646738] [2025-01-09 14:25:38,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983646738] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:25:38,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397483359] [2025-01-09 14:25:38,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:38,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:25:38,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:25:38,962 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:25:38,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:25:39,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-09 14:25:39,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-09 14:25:39,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:39,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:39,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:25:39,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:25:39,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-01-09 14:25:39,218 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:25:39,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397483359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:39,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:25:39,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:25:39,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871109785] [2025-01-09 14:25:39,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:39,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:25:39,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:39,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:25:39,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:25:39,237 INFO L87 Difference]: Start difference. First operand has 156 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 104 states have internal predecessors, (152), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 14:25:39,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:39,274 INFO L93 Difference]: Finished difference Result 303 states and 543 transitions. [2025-01-09 14:25:39,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:25:39,276 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 324 [2025-01-09 14:25:39,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:39,283 INFO L225 Difference]: With dead ends: 303 [2025-01-09 14:25:39,283 INFO L226 Difference]: Without dead ends: 150 [2025-01-09 14:25:39,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:25:39,293 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:39,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:25:39,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-09 14:25:39,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-01-09 14:25:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 98 states have internal predecessors, (140), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 14:25:39,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 240 transitions. [2025-01-09 14:25:39,339 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 240 transitions. Word has length 324 [2025-01-09 14:25:39,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:39,339 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 240 transitions. [2025-01-09 14:25:39,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 14:25:39,340 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 240 transitions. [2025-01-09 14:25:39,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-01-09 14:25:39,344 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:39,344 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:25:39,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:25:39,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:25:39,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:39,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:39,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1855444774, now seen corresponding path program 1 times [2025-01-09 14:25:39,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:39,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827403553] [2025-01-09 14:25:39,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:39,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:39,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-09 14:25:39,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-09 14:25:39,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:39,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:39,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:25:39,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:39,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827403553] [2025-01-09 14:25:39,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827403553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:39,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:39,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:25:39,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403428068] [2025-01-09 14:25:39,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:39,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:25:39,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:39,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:25:39,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:25:39,886 INFO L87 Difference]: Start difference. First operand 150 states and 240 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:40,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:40,032 INFO L93 Difference]: Finished difference Result 438 states and 703 transitions. [2025-01-09 14:25:40,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:25:40,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 324 [2025-01-09 14:25:40,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:40,039 INFO L225 Difference]: With dead ends: 438 [2025-01-09 14:25:40,040 INFO L226 Difference]: Without dead ends: 291 [2025-01-09 14:25:40,041 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-01-09 14:25:40,042 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 211 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:40,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 626 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:25:40,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-01-09 14:25:40,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 190. [2025-01-09 14:25:40,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 138 states have (on average 1.4855072463768115) internal successors, (205), 138 states have internal predecessors, (205), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 14:25:40,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 305 transitions. [2025-01-09 14:25:40,074 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 305 transitions. Word has length 324 [2025-01-09 14:25:40,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:40,076 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 305 transitions. [2025-01-09 14:25:40,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:40,076 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 305 transitions. [2025-01-09 14:25:40,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-01-09 14:25:40,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:40,080 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:25:40,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:25:40,080 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:40,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:40,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2045155736, now seen corresponding path program 1 times [2025-01-09 14:25:40,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:40,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590579131] [2025-01-09 14:25:40,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:40,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:40,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-09 14:25:40,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-09 14:25:40,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:40,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:25:40,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:40,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590579131] [2025-01-09 14:25:40,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590579131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:40,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:40,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:25:40,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796989510] [2025-01-09 14:25:40,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:40,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:25:40,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:40,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:25:40,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:25:40,312 INFO L87 Difference]: Start difference. First operand 190 states and 305 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:40,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:40,393 INFO L93 Difference]: Finished difference Result 560 states and 901 transitions. [2025-01-09 14:25:40,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:25:40,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 324 [2025-01-09 14:25:40,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:40,400 INFO L225 Difference]: With dead ends: 560 [2025-01-09 14:25:40,400 INFO L226 Difference]: Without dead ends: 373 [2025-01-09 14:25:40,402 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-01-09 14:25:40,402 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 214 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:40,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 449 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:25:40,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-01-09 14:25:40,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 247. [2025-01-09 14:25:40,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 195 states have (on average 1.5179487179487179) internal successors, (296), 195 states have internal predecessors, (296), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 14:25:40,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 396 transitions. [2025-01-09 14:25:40,433 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 396 transitions. Word has length 324 [2025-01-09 14:25:40,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:40,434 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 396 transitions. [2025-01-09 14:25:40,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:40,434 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 396 transitions. [2025-01-09 14:25:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-01-09 14:25:40,439 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:40,440 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:25:40,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:25:40,440 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:40,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:40,441 INFO L85 PathProgramCache]: Analyzing trace with hash 254527718, now seen corresponding path program 1 times [2025-01-09 14:25:40,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:40,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043881852] [2025-01-09 14:25:40,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:40,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:40,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-01-09 14:25:40,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-01-09 14:25:40,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:40,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:41,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:25:41,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:41,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043881852] [2025-01-09 14:25:41,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043881852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:41,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:41,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:25:41,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483288218] [2025-01-09 14:25:41,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:41,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:25:41,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:41,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:25:41,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:25:41,173 INFO L87 Difference]: Start difference. First operand 247 states and 396 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:41,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:41,506 INFO L93 Difference]: Finished difference Result 791 states and 1261 transitions. [2025-01-09 14:25:41,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:25:41,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 325 [2025-01-09 14:25:41,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:41,510 INFO L225 Difference]: With dead ends: 791 [2025-01-09 14:25:41,510 INFO L226 Difference]: Without dead ends: 547 [2025-01-09 14:25:41,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:25:41,511 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 410 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:41,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 752 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:25:41,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-01-09 14:25:41,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 466. [2025-01-09 14:25:41,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 377 states have (on average 1.530503978779841) internal successors, (577), 378 states have internal predecessors, (577), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 14:25:41,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 749 transitions. [2025-01-09 14:25:41,546 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 749 transitions. Word has length 325 [2025-01-09 14:25:41,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:41,546 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 749 transitions. [2025-01-09 14:25:41,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:41,546 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 749 transitions. [2025-01-09 14:25:41,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-01-09 14:25:41,549 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:41,549 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:25:41,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:25:41,549 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:41,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:41,550 INFO L85 PathProgramCache]: Analyzing trace with hash -774831580, now seen corresponding path program 1 times [2025-01-09 14:25:41,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:41,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417365576] [2025-01-09 14:25:41,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:41,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:41,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-01-09 14:25:41,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-01-09 14:25:41,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:41,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:25:42,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:42,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417365576] [2025-01-09 14:25:42,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417365576] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:42,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:42,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:25:42,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649941798] [2025-01-09 14:25:42,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:42,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:25:42,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:42,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:25:42,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:25:42,207 INFO L87 Difference]: Start difference. First operand 466 states and 749 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:42,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:42,482 INFO L93 Difference]: Finished difference Result 1251 states and 2026 transitions. [2025-01-09 14:25:42,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:25:42,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 325 [2025-01-09 14:25:42,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:42,487 INFO L225 Difference]: With dead ends: 1251 [2025-01-09 14:25:42,487 INFO L226 Difference]: Without dead ends: 788 [2025-01-09 14:25:42,488 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-01-09 14:25:42,489 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 231 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:42,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 911 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:25:42,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2025-01-09 14:25:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 416. [2025-01-09 14:25:42,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 327 states have (on average 1.507645259938838) internal successors, (493), 328 states have internal predecessors, (493), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 14:25:42,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 665 transitions. [2025-01-09 14:25:42,534 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 665 transitions. Word has length 325 [2025-01-09 14:25:42,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:42,535 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 665 transitions. [2025-01-09 14:25:42,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:42,535 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 665 transitions. [2025-01-09 14:25:42,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-01-09 14:25:42,538 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:42,538 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:25:42,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:25:42,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:42,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:42,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1454889950, now seen corresponding path program 1 times [2025-01-09 14:25:42,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:42,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133097959] [2025-01-09 14:25:42,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:42,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:42,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-01-09 14:25:42,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-01-09 14:25:42,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:42,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:25:43,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:43,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133097959] [2025-01-09 14:25:43,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133097959] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:43,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:43,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:25:43,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712587602] [2025-01-09 14:25:43,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:43,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:25:43,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:43,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:25:43,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:25:43,296 INFO L87 Difference]: Start difference. First operand 416 states and 665 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:43,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:43,703 INFO L93 Difference]: Finished difference Result 935 states and 1486 transitions. [2025-01-09 14:25:43,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:25:43,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 325 [2025-01-09 14:25:43,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:43,707 INFO L225 Difference]: With dead ends: 935 [2025-01-09 14:25:43,707 INFO L226 Difference]: Without dead ends: 522 [2025-01-09 14:25:43,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:25:43,709 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 369 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:43,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 899 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:25:43,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-01-09 14:25:43,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 416. [2025-01-09 14:25:43,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 327 states have (on average 1.492354740061162) internal successors, (488), 328 states have internal predecessors, (488), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 14:25:43,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 660 transitions. [2025-01-09 14:25:43,752 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 660 transitions. Word has length 325 [2025-01-09 14:25:43,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:43,753 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 660 transitions. [2025-01-09 14:25:43,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:43,753 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 660 transitions. [2025-01-09 14:25:43,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-01-09 14:25:43,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:43,757 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:25:43,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:25:43,758 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:43,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:43,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1996071844, now seen corresponding path program 1 times [2025-01-09 14:25:43,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:43,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429888864] [2025-01-09 14:25:43,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:43,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:43,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-01-09 14:25:43,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-01-09 14:25:43,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:43,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:45,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:25:45,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:45,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429888864] [2025-01-09 14:25:45,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429888864] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:45,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:45,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:25:45,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964884413] [2025-01-09 14:25:45,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:45,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:25:45,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:45,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:25:45,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:25:45,050 INFO L87 Difference]: Start difference. First operand 416 states and 660 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:46,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:46,241 INFO L93 Difference]: Finished difference Result 1868 states and 2962 transitions. [2025-01-09 14:25:46,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:25:46,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 325 [2025-01-09 14:25:46,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:46,249 INFO L225 Difference]: With dead ends: 1868 [2025-01-09 14:25:46,249 INFO L226 Difference]: Without dead ends: 1455 [2025-01-09 14:25:46,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:25:46,251 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 669 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:46,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1108 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 14:25:46,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2025-01-09 14:25:46,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1434. [2025-01-09 14:25:46,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1081 states have (on average 1.4736355226641997) internal successors, (1593), 1085 states have internal predecessors, (1593), 344 states have call successors, (344), 8 states have call predecessors, (344), 8 states have return successors, (344), 340 states have call predecessors, (344), 344 states have call successors, (344) [2025-01-09 14:25:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 2281 transitions. [2025-01-09 14:25:46,403 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 2281 transitions. Word has length 325 [2025-01-09 14:25:46,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:46,405 INFO L471 AbstractCegarLoop]: Abstraction has 1434 states and 2281 transitions. [2025-01-09 14:25:46,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:46,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2281 transitions. [2025-01-09 14:25:46,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-01-09 14:25:46,410 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:46,411 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:25:46,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:25:46,411 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:46,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:46,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1783258600, now seen corresponding path program 1 times [2025-01-09 14:25:46,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:46,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196558355] [2025-01-09 14:25:46,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:46,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:46,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-01-09 14:25:46,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-01-09 14:25:46,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:46,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:46,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:25:46,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:46,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196558355] [2025-01-09 14:25:46,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196558355] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:46,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:46,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:25:46,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539321755] [2025-01-09 14:25:46,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:46,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:25:46,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:46,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:25:46,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:25:46,781 INFO L87 Difference]: Start difference. First operand 1434 states and 2281 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:47,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:47,273 INFO L93 Difference]: Finished difference Result 4707 states and 7440 transitions. [2025-01-09 14:25:47,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:25:47,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 325 [2025-01-09 14:25:47,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:47,293 INFO L225 Difference]: With dead ends: 4707 [2025-01-09 14:25:47,293 INFO L226 Difference]: Without dead ends: 3276 [2025-01-09 14:25:47,297 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-01-09 14:25:47,298 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 368 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:47,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1078 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:25:47,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2025-01-09 14:25:47,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 2313. [2025-01-09 14:25:47,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 1735 states have (on average 1.4697406340057637) internal successors, (2550), 1744 states have internal predecessors, (2550), 564 states have call successors, (564), 13 states have call predecessors, (564), 13 states have return successors, (564), 555 states have call predecessors, (564), 564 states have call successors, (564) [2025-01-09 14:25:47,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3678 transitions. [2025-01-09 14:25:47,444 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3678 transitions. Word has length 325 [2025-01-09 14:25:47,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:47,444 INFO L471 AbstractCegarLoop]: Abstraction has 2313 states and 3678 transitions. [2025-01-09 14:25:47,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:47,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3678 transitions. [2025-01-09 14:25:47,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-01-09 14:25:47,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:47,448 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:25:47,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:25:47,448 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:47,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:47,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1081658726, now seen corresponding path program 1 times [2025-01-09 14:25:47,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:47,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899702798] [2025-01-09 14:25:47,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:47,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:47,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-01-09 14:25:47,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-01-09 14:25:47,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:47,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:48,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:25:48,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:48,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899702798] [2025-01-09 14:25:48,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899702798] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:48,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:48,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:25:48,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334996330] [2025-01-09 14:25:48,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:48,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:25:48,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:48,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:25:48,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:25:48,812 INFO L87 Difference]: Start difference. First operand 2313 states and 3678 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) [2025-01-09 14:25:49,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:49,858 INFO L93 Difference]: Finished difference Result 5685 states and 9041 transitions. [2025-01-09 14:25:49,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:25:49,859 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) Word has length 325 [2025-01-09 14:25:49,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:49,875 INFO L225 Difference]: With dead ends: 5685 [2025-01-09 14:25:49,875 INFO L226 Difference]: Without dead ends: 3375 [2025-01-09 14:25:49,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:25:49,881 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 661 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:49,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1147 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:25:49,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3375 states. [2025-01-09 14:25:50,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3375 to 3353. [2025-01-09 14:25:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3353 states, 2505 states have (on average 1.469061876247505) internal successors, (3680), 2518 states have internal predecessors, (3680), 828 states have call successors, (828), 19 states have call predecessors, (828), 19 states have return successors, (828), 815 states have call predecessors, (828), 828 states have call successors, (828) [2025-01-09 14:25:50,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3353 states to 3353 states and 5336 transitions. [2025-01-09 14:25:50,097 INFO L78 Accepts]: Start accepts. Automaton has 3353 states and 5336 transitions. Word has length 325 [2025-01-09 14:25:50,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:50,098 INFO L471 AbstractCegarLoop]: Abstraction has 3353 states and 5336 transitions. [2025-01-09 14:25:50,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) [2025-01-09 14:25:50,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3353 states and 5336 transitions. [2025-01-09 14:25:50,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-01-09 14:25:50,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:50,102 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:25:50,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:25:50,103 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:50,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:50,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1797337950, now seen corresponding path program 1 times [2025-01-09 14:25:50,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:50,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072480094] [2025-01-09 14:25:50,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:50,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:50,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-01-09 14:25:50,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-01-09 14:25:50,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:50,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:25:50,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:50,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072480094] [2025-01-09 14:25:50,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072480094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:50,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:50,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:25:50,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767468956] [2025-01-09 14:25:50,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:50,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:25:50,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:50,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:25:50,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:25:50,547 INFO L87 Difference]: Start difference. First operand 3353 states and 5336 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:50,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:50,971 INFO L93 Difference]: Finished difference Result 5998 states and 9491 transitions. [2025-01-09 14:25:50,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:25:50,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 325 [2025-01-09 14:25:50,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:50,987 INFO L225 Difference]: With dead ends: 5998 [2025-01-09 14:25:50,987 INFO L226 Difference]: Without dead ends: 2648 [2025-01-09 14:25:50,994 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-01-09 14:25:50,994 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 429 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:50,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1035 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:25:50,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2025-01-09 14:25:51,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 2488. [2025-01-09 14:25:51,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2488 states, 1794 states have (on average 1.4364548494983278) internal successors, (2577), 1802 states have internal predecessors, (2577), 668 states have call successors, (668), 25 states have call predecessors, (668), 25 states have return successors, (668), 660 states have call predecessors, (668), 668 states have call successors, (668) [2025-01-09 14:25:51,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 3913 transitions. [2025-01-09 14:25:51,166 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 3913 transitions. Word has length 325 [2025-01-09 14:25:51,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:51,166 INFO L471 AbstractCegarLoop]: Abstraction has 2488 states and 3913 transitions. [2025-01-09 14:25:51,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:51,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 3913 transitions. [2025-01-09 14:25:51,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-01-09 14:25:51,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:51,169 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:25:51,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:25:51,169 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:51,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:51,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1468270048, now seen corresponding path program 1 times [2025-01-09 14:25:51,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:51,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386306019] [2025-01-09 14:25:51,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:51,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:51,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-01-09 14:25:51,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-01-09 14:25:51,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:51,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:25:52,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:52,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386306019] [2025-01-09 14:25:52,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386306019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:52,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:52,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:25:52,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152609032] [2025-01-09 14:25:52,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:52,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:25:52,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:52,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:25:52,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:25:52,301 INFO L87 Difference]: Start difference. First operand 2488 states and 3913 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:53,159 INFO L93 Difference]: Finished difference Result 4154 states and 6508 transitions. [2025-01-09 14:25:53,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:25:53,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 325 [2025-01-09 14:25:53,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:53,177 INFO L225 Difference]: With dead ends: 4154 [2025-01-09 14:25:53,177 INFO L226 Difference]: Without dead ends: 3562 [2025-01-09 14:25:53,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:25:53,181 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 491 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:53,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 878 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:25:53,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2025-01-09 14:25:53,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 3538. [2025-01-09 14:25:53,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3538 states, 2550 states have (on average 1.4298039215686273) internal successors, (3646), 2562 states have internal predecessors, (3646), 952 states have call successors, (952), 35 states have call predecessors, (952), 35 states have return successors, (952), 940 states have call predecessors, (952), 952 states have call successors, (952) [2025-01-09 14:25:53,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3538 states to 3538 states and 5550 transitions. [2025-01-09 14:25:53,454 INFO L78 Accepts]: Start accepts. Automaton has 3538 states and 5550 transitions. Word has length 325 [2025-01-09 14:25:53,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:53,455 INFO L471 AbstractCegarLoop]: Abstraction has 3538 states and 5550 transitions. [2025-01-09 14:25:53,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:53,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3538 states and 5550 transitions. [2025-01-09 14:25:53,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-01-09 14:25:53,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:53,458 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:25:53,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:25:53,458 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:53,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:53,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1609460522, now seen corresponding path program 1 times [2025-01-09 14:25:53,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:53,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605032709] [2025-01-09 14:25:53,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:53,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:53,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-01-09 14:25:53,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-01-09 14:25:53,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:53,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:25:53,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:53,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605032709] [2025-01-09 14:25:53,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605032709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:53,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:53,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:25:53,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943942814] [2025-01-09 14:25:53,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:53,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:25:53,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:53,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:25:53,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:25:53,745 INFO L87 Difference]: Start difference. First operand 3538 states and 5550 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:54,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:54,358 INFO L93 Difference]: Finished difference Result 7225 states and 11320 transitions. [2025-01-09 14:25:54,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:25:54,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 325 [2025-01-09 14:25:54,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:54,378 INFO L225 Difference]: With dead ends: 7225 [2025-01-09 14:25:54,379 INFO L226 Difference]: Without dead ends: 3764 [2025-01-09 14:25:54,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:25:54,389 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 494 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:54,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 894 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:25:54,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2025-01-09 14:25:54,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3337. [2025-01-09 14:25:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 2395 states have (on average 1.4096033402922756) internal successors, (3376), 2406 states have internal predecessors, (3376), 906 states have call successors, (906), 35 states have call predecessors, (906), 35 states have return successors, (906), 895 states have call predecessors, (906), 906 states have call successors, (906) [2025-01-09 14:25:54,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 5188 transitions. [2025-01-09 14:25:54,780 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 5188 transitions. Word has length 325 [2025-01-09 14:25:54,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:54,783 INFO L471 AbstractCegarLoop]: Abstraction has 3337 states and 5188 transitions. [2025-01-09 14:25:54,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 5188 transitions. [2025-01-09 14:25:54,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-01-09 14:25:54,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:54,785 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:25:54,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:25:54,789 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:54,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:54,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2067599854, now seen corresponding path program 1 times [2025-01-09 14:25:54,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:54,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269895308] [2025-01-09 14:25:54,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:54,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:54,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-01-09 14:25:54,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-01-09 14:25:54,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:54,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:25:55,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:55,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269895308] [2025-01-09 14:25:55,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269895308] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:55,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:55,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:25:55,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789024768] [2025-01-09 14:25:55,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:55,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:25:55,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:55,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:25:55,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:25:55,072 INFO L87 Difference]: Start difference. First operand 3337 states and 5188 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:55,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:55,850 INFO L93 Difference]: Finished difference Result 5286 states and 8196 transitions. [2025-01-09 14:25:55,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:25:55,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 326 [2025-01-09 14:25:55,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:55,876 INFO L225 Difference]: With dead ends: 5286 [2025-01-09 14:25:55,876 INFO L226 Difference]: Without dead ends: 3667 [2025-01-09 14:25:55,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:25:55,881 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 512 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:55,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 901 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:25:55,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3667 states. [2025-01-09 14:25:56,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3667 to 3337. [2025-01-09 14:25:56,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 2395 states have (on average 1.407098121085595) internal successors, (3370), 2406 states have internal predecessors, (3370), 906 states have call successors, (906), 35 states have call predecessors, (906), 35 states have return successors, (906), 895 states have call predecessors, (906), 906 states have call successors, (906) [2025-01-09 14:25:56,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 5182 transitions. [2025-01-09 14:25:56,160 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 5182 transitions. Word has length 326 [2025-01-09 14:25:56,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:56,161 INFO L471 AbstractCegarLoop]: Abstraction has 3337 states and 5182 transitions. [2025-01-09 14:25:56,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:56,161 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 5182 transitions. [2025-01-09 14:25:56,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-01-09 14:25:56,163 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:56,163 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:25:56,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:25:56,164 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:56,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:56,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2005560240, now seen corresponding path program 1 times [2025-01-09 14:25:56,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:56,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132823286] [2025-01-09 14:25:56,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:56,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:56,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-01-09 14:25:56,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-01-09 14:25:56,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:56,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:57,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:25:57,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:57,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132823286] [2025-01-09 14:25:57,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132823286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:57,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:57,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:25:57,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512802568] [2025-01-09 14:25:57,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:57,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:25:57,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:57,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:25:57,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:25:57,057 INFO L87 Difference]: Start difference. First operand 3337 states and 5182 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:58,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:58,085 INFO L93 Difference]: Finished difference Result 6429 states and 9976 transitions. [2025-01-09 14:25:58,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:25:58,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 326 [2025-01-09 14:25:58,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:58,116 INFO L225 Difference]: With dead ends: 6429 [2025-01-09 14:25:58,116 INFO L226 Difference]: Without dead ends: 3781 [2025-01-09 14:25:58,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:25:58,131 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 451 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:58,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 820 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:25:58,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3781 states. [2025-01-09 14:25:58,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3781 to 2218. [2025-01-09 14:25:58,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2218 states, 1623 states have (on average 1.4115834873690696) internal successors, (2291), 1630 states have internal predecessors, (2291), 572 states have call successors, (572), 22 states have call predecessors, (572), 22 states have return successors, (572), 565 states have call predecessors, (572), 572 states have call successors, (572) [2025-01-09 14:25:58,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 3435 transitions. [2025-01-09 14:25:58,415 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 3435 transitions. Word has length 326 [2025-01-09 14:25:58,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:58,415 INFO L471 AbstractCegarLoop]: Abstraction has 2218 states and 3435 transitions. [2025-01-09 14:25:58,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:58,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 3435 transitions. [2025-01-09 14:25:58,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-01-09 14:25:58,418 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:58,418 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:25:58,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:25:58,418 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:58,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:58,419 INFO L85 PathProgramCache]: Analyzing trace with hash 885450903, now seen corresponding path program 1 times [2025-01-09 14:25:58,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:58,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211446385] [2025-01-09 14:25:58,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:58,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:58,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-01-09 14:25:58,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-01-09 14:25:58,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:58,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:58,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:25:58,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:58,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211446385] [2025-01-09 14:25:58,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211446385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:25:58,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:25:58,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:25:58,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633574523] [2025-01-09 14:25:58,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:25:58,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:25:58,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:58,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:25:58,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:25:58,932 INFO L87 Difference]: Start difference. First operand 2218 states and 3435 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:59,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:59,412 INFO L93 Difference]: Finished difference Result 4612 states and 7138 transitions. [2025-01-09 14:25:59,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:25:59,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 326 [2025-01-09 14:25:59,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:59,421 INFO L225 Difference]: With dead ends: 4612 [2025-01-09 14:25:59,422 INFO L226 Difference]: Without dead ends: 2397 [2025-01-09 14:25:59,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:25:59,426 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 363 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:59,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 899 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:25:59,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2025-01-09 14:25:59,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 2213. [2025-01-09 14:25:59,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2213 states, 1618 states have (on average 1.4097651421508035) internal successors, (2281), 1625 states have internal predecessors, (2281), 572 states have call successors, (572), 22 states have call predecessors, (572), 22 states have return successors, (572), 565 states have call predecessors, (572), 572 states have call successors, (572) [2025-01-09 14:25:59,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 3425 transitions. [2025-01-09 14:25:59,586 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 3425 transitions. Word has length 326 [2025-01-09 14:25:59,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:59,587 INFO L471 AbstractCegarLoop]: Abstraction has 2213 states and 3425 transitions. [2025-01-09 14:25:59,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:25:59,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 3425 transitions. [2025-01-09 14:25:59,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-01-09 14:25:59,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:59,590 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:25:59,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:25:59,590 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:59,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:59,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1160210517, now seen corresponding path program 1 times [2025-01-09 14:25:59,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:59,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413676564] [2025-01-09 14:25:59,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:59,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:59,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-01-09 14:25:59,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-01-09 14:25:59,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:59,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 108 proven. 39 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-01-09 14:26:00,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:00,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413676564] [2025-01-09 14:26:00,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413676564] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:26:00,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342380385] [2025-01-09 14:26:00,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:00,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:00,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:00,062 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:26:00,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 14:26:00,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-01-09 14:26:00,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-01-09 14:26:00,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:00,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:00,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 14:26:00,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:26:00,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2074 proven. 39 refuted. 0 times theorem prover too weak. 2787 trivial. 0 not checked. [2025-01-09 14:26:00,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:26:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 108 proven. 39 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-01-09 14:26:00,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342380385] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:26:00,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:26:00,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 8] total 18 [2025-01-09 14:26:00,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846969477] [2025-01-09 14:26:00,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:26:00,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 14:26:00,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:00,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 14:26:00,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:26:00,858 INFO L87 Difference]: Start difference. First operand 2213 states and 3425 transitions. Second operand has 18 states, 18 states have (on average 7.166666666666667) internal successors, (129), 18 states have internal predecessors, (129), 4 states have call successors, (76), 3 states have call predecessors, (76), 6 states have return successors, (77), 4 states have call predecessors, (77), 4 states have call successors, (77) [2025-01-09 14:26:04,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:04,447 INFO L93 Difference]: Finished difference Result 5741 states and 8622 transitions. [2025-01-09 14:26:04,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-01-09 14:26:04,448 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.166666666666667) internal successors, (129), 18 states have internal predecessors, (129), 4 states have call successors, (76), 3 states have call predecessors, (76), 6 states have return successors, (77), 4 states have call predecessors, (77), 4 states have call successors, (77) Word has length 326 [2025-01-09 14:26:04,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:04,460 INFO L225 Difference]: With dead ends: 5741 [2025-01-09 14:26:04,460 INFO L226 Difference]: Without dead ends: 3531 [2025-01-09 14:26:04,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 650 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1439 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=778, Invalid=4052, Unknown=0, NotChecked=0, Total=4830 [2025-01-09 14:26:04,466 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 1386 mSDsluCounter, 3453 mSDsCounter, 0 mSdLazyCounter, 3463 mSolverCounterSat, 843 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1426 SdHoareTripleChecker+Valid, 3960 SdHoareTripleChecker+Invalid, 4306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 843 IncrementalHoareTripleChecker+Valid, 3463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:04,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1426 Valid, 3960 Invalid, 4306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [843 Valid, 3463 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 14:26:04,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3531 states. [2025-01-09 14:26:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3531 to 1276. [2025-01-09 14:26:04,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 904 states have (on average 1.3174778761061947) internal successors, (1191), 908 states have internal predecessors, (1191), 342 states have call successors, (342), 29 states have call predecessors, (342), 29 states have return successors, (342), 338 states have call predecessors, (342), 342 states have call successors, (342) [2025-01-09 14:26:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1875 transitions. [2025-01-09 14:26:04,619 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1875 transitions. Word has length 326 [2025-01-09 14:26:04,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:04,620 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1875 transitions. [2025-01-09 14:26:04,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.166666666666667) internal successors, (129), 18 states have internal predecessors, (129), 4 states have call successors, (76), 3 states have call predecessors, (76), 6 states have return successors, (77), 4 states have call predecessors, (77), 4 states have call successors, (77) [2025-01-09 14:26:04,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1875 transitions. [2025-01-09 14:26:04,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-01-09 14:26:04,622 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:04,622 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:26:04,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:26:04,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 14:26:04,823 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:04,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:04,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1309097625, now seen corresponding path program 1 times [2025-01-09 14:26:04,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:04,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887464622] [2025-01-09 14:26:04,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:04,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:04,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-01-09 14:26:04,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-01-09 14:26:04,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:04,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:05,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:26:05,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:05,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887464622] [2025-01-09 14:26:05,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887464622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:05,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:05,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:26:05,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615937463] [2025-01-09 14:26:05,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:05,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:26:05,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:05,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:26:05,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:26:05,135 INFO L87 Difference]: Start difference. First operand 1276 states and 1875 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:26:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:05,734 INFO L93 Difference]: Finished difference Result 2892 states and 4253 transitions. [2025-01-09 14:26:05,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:26:05,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 326 [2025-01-09 14:26:05,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:05,745 INFO L225 Difference]: With dead ends: 2892 [2025-01-09 14:26:05,745 INFO L226 Difference]: Without dead ends: 1619 [2025-01-09 14:26:05,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:26:05,749 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 412 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:05,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 954 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:26:05,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2025-01-09 14:26:05,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1276. [2025-01-09 14:26:05,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 904 states have (on average 1.3141592920353982) internal successors, (1188), 908 states have internal predecessors, (1188), 342 states have call successors, (342), 29 states have call predecessors, (342), 29 states have return successors, (342), 338 states have call predecessors, (342), 342 states have call successors, (342) [2025-01-09 14:26:05,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1872 transitions. [2025-01-09 14:26:05,898 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1872 transitions. Word has length 326 [2025-01-09 14:26:05,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:05,899 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1872 transitions. [2025-01-09 14:26:05,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:26:05,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1872 transitions. [2025-01-09 14:26:05,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-01-09 14:26:05,901 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:05,901 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:26:05,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 14:26:05,901 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:05,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:05,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1583857239, now seen corresponding path program 1 times [2025-01-09 14:26:05,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:05,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569968435] [2025-01-09 14:26:05,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:05,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:05,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-01-09 14:26:06,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-01-09 14:26:06,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:06,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:06,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 138 proven. 9 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-01-09 14:26:06,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:06,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569968435] [2025-01-09 14:26:06,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569968435] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:26:06,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618567389] [2025-01-09 14:26:06,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:06,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:06,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:06,238 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:26:06,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:26:06,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-01-09 14:26:06,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-01-09 14:26:06,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:06,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:06,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:26:06,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:26:06,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 693 proven. 9 refuted. 0 times theorem prover too weak. 4198 trivial. 0 not checked. [2025-01-09 14:26:06,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:26:06,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 138 proven. 9 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-01-09 14:26:06,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618567389] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:26:06,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:26:06,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 14:26:06,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183684638] [2025-01-09 14:26:06,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:26:06,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:26:06,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:06,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:26:06,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:26:06,671 INFO L87 Difference]: Start difference. First operand 1276 states and 1872 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-01-09 14:26:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:07,028 INFO L93 Difference]: Finished difference Result 2211 states and 3228 transitions. [2025-01-09 14:26:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:26:07,029 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 326 [2025-01-09 14:26:07,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:07,036 INFO L225 Difference]: With dead ends: 2211 [2025-01-09 14:26:07,036 INFO L226 Difference]: Without dead ends: 938 [2025-01-09 14:26:07,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 649 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:26:07,039 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 286 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:07,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 419 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:26:07,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-01-09 14:26:07,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 782. [2025-01-09 14:26:07,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 559 states have (on average 1.3059033989266546) internal successors, (730), 561 states have internal predecessors, (730), 200 states have call successors, (200), 22 states have call predecessors, (200), 22 states have return successors, (200), 198 states have call predecessors, (200), 200 states have call successors, (200) [2025-01-09 14:26:07,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1130 transitions. [2025-01-09 14:26:07,194 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1130 transitions. Word has length 326 [2025-01-09 14:26:07,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:07,194 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 1130 transitions. [2025-01-09 14:26:07,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-01-09 14:26:07,194 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1130 transitions. [2025-01-09 14:26:07,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-01-09 14:26:07,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:07,197 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:26:07,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 14:26:07,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:07,398 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:07,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:07,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1831347417, now seen corresponding path program 1 times [2025-01-09 14:26:07,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:07,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206050996] [2025-01-09 14:26:07,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:07,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:07,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-09 14:26:07,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-09 14:26:07,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:07,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:08,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 132 proven. 15 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-01-09 14:26:08,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:08,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206050996] [2025-01-09 14:26:08,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206050996] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:26:08,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045266439] [2025-01-09 14:26:08,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:08,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:08,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:08,255 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:26:08,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:26:08,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-09 14:26:08,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-09 14:26:08,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:08,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:08,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 14:26:08,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:26:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 1017 proven. 15 refuted. 0 times theorem prover too weak. 3868 trivial. 0 not checked. [2025-01-09 14:26:08,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:26:09,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 132 proven. 15 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-01-09 14:26:09,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045266439] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:26:09,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:26:09,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 23 [2025-01-09 14:26:09,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053224148] [2025-01-09 14:26:09,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:26:09,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 14:26:09,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:09,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 14:26:09,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2025-01-09 14:26:09,297 INFO L87 Difference]: Start difference. First operand 782 states and 1130 transitions. Second operand has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 23 states have internal predecessors, (147), 4 states have call successors, (150), 3 states have call predecessors, (150), 6 states have return successors, (150), 4 states have call predecessors, (150), 4 states have call successors, (150) [2025-01-09 14:26:11,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:11,555 INFO L93 Difference]: Finished difference Result 3102 states and 4416 transitions. [2025-01-09 14:26:11,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-01-09 14:26:11,556 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 23 states have internal predecessors, (147), 4 states have call successors, (150), 3 states have call predecessors, (150), 6 states have return successors, (150), 4 states have call predecessors, (150), 4 states have call successors, (150) Word has length 327 [2025-01-09 14:26:11,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:11,577 INFO L225 Difference]: With dead ends: 3102 [2025-01-09 14:26:11,578 INFO L226 Difference]: Without dead ends: 2323 [2025-01-09 14:26:11,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=509, Invalid=2247, Unknown=0, NotChecked=0, Total=2756 [2025-01-09 14:26:11,582 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 2038 mSDsluCounter, 2288 mSDsCounter, 0 mSdLazyCounter, 2811 mSolverCounterSat, 1156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2040 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 3967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1156 IncrementalHoareTripleChecker+Valid, 2811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:11,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2040 Valid, 2597 Invalid, 3967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1156 Valid, 2811 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 14:26:11,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2025-01-09 14:26:11,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 1410. [2025-01-09 14:26:11,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 910 states have (on average 1.2263736263736265) internal successors, (1116), 915 states have internal predecessors, (1116), 445 states have call successors, (445), 54 states have call predecessors, (445), 54 states have return successors, (445), 440 states have call predecessors, (445), 445 states have call successors, (445) [2025-01-09 14:26:11,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2006 transitions. [2025-01-09 14:26:11,792 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2006 transitions. Word has length 327 [2025-01-09 14:26:11,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:11,792 INFO L471 AbstractCegarLoop]: Abstraction has 1410 states and 2006 transitions. [2025-01-09 14:26:11,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 23 states have internal predecessors, (147), 4 states have call successors, (150), 3 states have call predecessors, (150), 6 states have return successors, (150), 4 states have call predecessors, (150), 4 states have call successors, (150) [2025-01-09 14:26:11,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2006 transitions. [2025-01-09 14:26:11,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-01-09 14:26:11,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:11,794 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:26:11,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 14:26:11,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:11,995 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:11,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:11,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1890288043, now seen corresponding path program 1 times [2025-01-09 14:26:11,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:11,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238666179] [2025-01-09 14:26:11,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:11,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:12,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-09 14:26:12,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-09 14:26:12,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:12,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:12,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 231 proven. 192 refuted. 0 times theorem prover too weak. 4477 trivial. 0 not checked. [2025-01-09 14:26:12,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:12,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238666179] [2025-01-09 14:26:12,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238666179] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:26:12,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492338531] [2025-01-09 14:26:12,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:12,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:12,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:12,931 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:26:12,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 14:26:13,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-09 14:26:13,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-09 14:26:13,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:13,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:13,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 14:26:13,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:26:14,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 3340 proven. 249 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2025-01-09 14:26:14,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:26:14,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 303 proven. 267 refuted. 0 times theorem prover too weak. 4330 trivial. 0 not checked. [2025-01-09 14:26:14,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492338531] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:26:14,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:26:14,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 14] total 29 [2025-01-09 14:26:14,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78475304] [2025-01-09 14:26:14,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:26:14,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 14:26:14,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:14,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 14:26:14,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2025-01-09 14:26:14,904 INFO L87 Difference]: Start difference. First operand 1410 states and 2006 transitions. Second operand has 29 states, 27 states have (on average 7.37037037037037) internal successors, (199), 27 states have internal predecessors, (199), 12 states have call successors, (108), 5 states have call predecessors, (108), 12 states have return successors, (109), 11 states have call predecessors, (109), 12 states have call successors, (109) [2025-01-09 14:26:15,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:15,858 INFO L93 Difference]: Finished difference Result 2908 states and 4014 transitions. [2025-01-09 14:26:15,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 14:26:15,859 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 7.37037037037037) internal successors, (199), 27 states have internal predecessors, (199), 12 states have call successors, (108), 5 states have call predecessors, (108), 12 states have return successors, (109), 11 states have call predecessors, (109), 12 states have call successors, (109) Word has length 327 [2025-01-09 14:26:15,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:15,866 INFO L225 Difference]: With dead ends: 2908 [2025-01-09 14:26:15,866 INFO L226 Difference]: Without dead ends: 1590 [2025-01-09 14:26:15,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 679 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=526, Invalid=1196, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 14:26:15,870 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 193 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:15,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 700 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:26:15,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2025-01-09 14:26:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1590. [2025-01-09 14:26:16,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1045 states have (on average 1.1665071770334927) internal successors, (1219), 1050 states have internal predecessors, (1219), 445 states have call successors, (445), 99 states have call predecessors, (445), 99 states have return successors, (445), 440 states have call predecessors, (445), 445 states have call successors, (445) [2025-01-09 14:26:16,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 2109 transitions. [2025-01-09 14:26:16,147 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 2109 transitions. Word has length 327 [2025-01-09 14:26:16,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:16,148 INFO L471 AbstractCegarLoop]: Abstraction has 1590 states and 2109 transitions. [2025-01-09 14:26:16,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 7.37037037037037) internal successors, (199), 27 states have internal predecessors, (199), 12 states have call successors, (108), 5 states have call predecessors, (108), 12 states have return successors, (109), 11 states have call predecessors, (109), 12 states have call successors, (109) [2025-01-09 14:26:16,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2109 transitions. [2025-01-09 14:26:16,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-01-09 14:26:16,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:16,151 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:26:16,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 14:26:16,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:16,351 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:16,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:16,352 INFO L85 PathProgramCache]: Analyzing trace with hash 807206670, now seen corresponding path program 1 times [2025-01-09 14:26:16,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:16,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25599570] [2025-01-09 14:26:16,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:16,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:16,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-01-09 14:26:16,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-01-09 14:26:16,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:16,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:26:16,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2002319350] [2025-01-09 14:26:16,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:16,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:16,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:16,515 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:26:16,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 14:26:16,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-01-09 14:26:16,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-01-09 14:26:16,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:16,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:16,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 14:26:16,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:26:18,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 1284 proven. 126 refuted. 0 times theorem prover too weak. 3490 trivial. 0 not checked. [2025-01-09 14:26:18,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:26:18,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:18,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25599570] [2025-01-09 14:26:18,499 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 14:26:18,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002319350] [2025-01-09 14:26:18,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002319350] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:26:18,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:26:18,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-01-09 14:26:18,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681476943] [2025-01-09 14:26:18,499 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 14:26:18,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:26:18,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:18,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:26:18,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:26:18,500 INFO L87 Difference]: Start difference. First operand 1590 states and 2109 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 9 states have internal predecessors, (91), 3 states have call successors, (50), 3 states have call predecessors, (50), 4 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) [2025-01-09 14:26:19,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:19,503 INFO L93 Difference]: Finished difference Result 3613 states and 4774 transitions. [2025-01-09 14:26:19,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 14:26:19,504 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 9 states have internal predecessors, (91), 3 states have call successors, (50), 3 states have call predecessors, (50), 4 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) Word has length 329 [2025-01-09 14:26:19,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:19,511 INFO L225 Difference]: With dead ends: 3613 [2025-01-09 14:26:19,511 INFO L226 Difference]: Without dead ends: 2135 [2025-01-09 14:26:19,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2025-01-09 14:26:19,514 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 364 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:19,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1534 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:26:19,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2025-01-09 14:26:19,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 1900. [2025-01-09 14:26:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1900 states, 1321 states have (on average 1.1801665404996216) internal successors, (1559), 1329 states have internal predecessors, (1559), 470 states have call successors, (470), 108 states have call predecessors, (470), 108 states have return successors, (470), 462 states have call predecessors, (470), 470 states have call successors, (470) [2025-01-09 14:26:19,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 2499 transitions. [2025-01-09 14:26:19,801 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 2499 transitions. Word has length 329 [2025-01-09 14:26:19,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:19,801 INFO L471 AbstractCegarLoop]: Abstraction has 1900 states and 2499 transitions. [2025-01-09 14:26:19,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 9 states have internal predecessors, (91), 3 states have call successors, (50), 3 states have call predecessors, (50), 4 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) [2025-01-09 14:26:19,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2499 transitions. [2025-01-09 14:26:19,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-01-09 14:26:19,803 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:19,803 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:26:19,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 14:26:20,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-09 14:26:20,004 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:20,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:20,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1700693008, now seen corresponding path program 1 times [2025-01-09 14:26:20,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:20,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548902379] [2025-01-09 14:26:20,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:20,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:20,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-01-09 14:26:20,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-01-09 14:26:20,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:20,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:26:20,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [194662627] [2025-01-09 14:26:20,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:20,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:20,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:20,490 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:26:20,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 14:26:20,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes.