./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de52c08fb0028bef519c22f81b06d40dd6144270e7f5fea59e5bb117b888da23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:30:47,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:30:47,544 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:30:47,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:30:47,552 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:30:47,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:30:47,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:30:47,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:30:47,581 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:30:47,581 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:30:47,581 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:30:47,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:30:47,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:30:47,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:30:47,582 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:30:47,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:30:47,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:30:47,584 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:30:47,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:30:47,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:30:47,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:30:47,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:30:47,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:30:47,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:30:47,586 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:30:47,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:30:47,586 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:30:47,586 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:30:47,586 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:30:47,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:30:47,587 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:30:47,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:30:47,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:30:47,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:30:47,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:30:47,587 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:30:47,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:30:47,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:30:47,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:30:47,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:30:47,587 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:30:47,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:30:47,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:30:47,587 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de52c08fb0028bef519c22f81b06d40dd6144270e7f5fea59e5bb117b888da23 [2025-03-17 04:30:47,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:30:47,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:30:47,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:30:47,858 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:30:47,858 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:30:47,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i [2025-03-17 04:30:49,001 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd0739dd5/2de1859acd3f46d5b374b61992757aac/FLAG097587c99 [2025-03-17 04:30:49,277 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:30:49,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i [2025-03-17 04:30:49,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd0739dd5/2de1859acd3f46d5b374b61992757aac/FLAG097587c99 [2025-03-17 04:30:49,563 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd0739dd5/2de1859acd3f46d5b374b61992757aac [2025-03-17 04:30:49,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:30:49,566 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:30:49,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:30:49,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:30:49,570 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:30:49,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:30:49" (1/1) ... [2025-03-17 04:30:49,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5540f65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:49, skipping insertion in model container [2025-03-17 04:30:49,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:30:49" (1/1) ... [2025-03-17 04:30:49,594 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:30:49,702 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i[916,929] [2025-03-17 04:30:49,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:30:49,859 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:30:49,868 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i[916,929] [2025-03-17 04:30:49,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:30:49,951 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:30:49,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:49 WrapperNode [2025-03-17 04:30:49,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:30:49,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:30:49,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:30:49,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:30:49,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:49" (1/1) ... [2025-03-17 04:30:49,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:49" (1/1) ... [2025-03-17 04:30:50,012 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 367 [2025-03-17 04:30:50,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:30:50,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:30:50,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:30:50,013 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:30:50,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:49" (1/1) ... [2025-03-17 04:30:50,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:49" (1/1) ... [2025-03-17 04:30:50,034 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:49" (1/1) ... [2025-03-17 04:30:50,058 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 04:30:50,059 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:49" (1/1) ... [2025-03-17 04:30:50,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:49" (1/1) ... [2025-03-17 04:30:50,070 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:49" (1/1) ... [2025-03-17 04:30:50,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:49" (1/1) ... [2025-03-17 04:30:50,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:49" (1/1) ... [2025-03-17 04:30:50,081 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:49" (1/1) ... [2025-03-17 04:30:50,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:30:50,094 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:30:50,094 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:30:50,094 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:30:50,094 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:49" (1/1) ... [2025-03-17 04:30:50,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:30:50,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:30:50,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:30:50,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:30:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:30:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:30:50,142 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:30:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:30:50,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:30:50,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:30:50,220 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:30:50,221 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:30:50,762 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L345: havoc property_#t~bitwise34#1;havoc property_#t~short35#1; [2025-03-17 04:30:50,825 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-03-17 04:30:50,825 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:30:50,842 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:30:50,843 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:30:50,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:30:50 BoogieIcfgContainer [2025-03-17 04:30:50,843 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:30:50,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:30:50,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:30:50,847 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:30:50,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:30:49" (1/3) ... [2025-03-17 04:30:50,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58fb1290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:30:50, skipping insertion in model container [2025-03-17 04:30:50,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:49" (2/3) ... [2025-03-17 04:30:50,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58fb1290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:30:50, skipping insertion in model container [2025-03-17 04:30:50,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:30:50" (3/3) ... [2025-03-17 04:30:50,849 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-56.i [2025-03-17 04:30:50,859 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:30:50,862 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-56.i that has 2 procedures, 152 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:30:50,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:30:50,919 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;@36be9145, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:30:50,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:30:50,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 152 states, 99 states have (on average 1.494949494949495) internal successors, (148), 100 states have internal predecessors, (148), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 04:30:50,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-17 04:30:50,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:30:50,944 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] [2025-03-17 04:30:50,945 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:30:50,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:30:50,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1786525469, now seen corresponding path program 1 times [2025-03-17 04:30:50,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:30:50,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004009287] [2025-03-17 04:30:50,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:50,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:30:51,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-17 04:30:51,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-17 04:30:51,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:51,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-03-17 04:30:51,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:30:51,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004009287] [2025-03-17 04:30:51,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004009287] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:30:51,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377986779] [2025-03-17 04:30:51,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:51,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:30:51,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:30:51,378 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:30:51,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 04:30:51,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-17 04:30:51,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-17 04:30:51,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:51,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:51,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:30:51,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:30:51,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-03-17 04:30:51,662 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:30:51,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377986779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:30:51,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:30:51,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:30:51,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039951152] [2025-03-17 04:30:51,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:30:51,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:30:51,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:30:51,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:30:51,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:30:51,689 INFO L87 Difference]: Start difference. First operand has 152 states, 99 states have (on average 1.494949494949495) internal successors, (148), 100 states have internal predecessors, (148), 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 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 04:30:51,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:30:51,727 INFO L93 Difference]: Finished difference Result 298 states and 538 transitions. [2025-03-17 04:30:51,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:30:51,729 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 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 321 [2025-03-17 04:30:51,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:30:51,735 INFO L225 Difference]: With dead ends: 298 [2025-03-17 04:30:51,736 INFO L226 Difference]: Without dead ends: 147 [2025-03-17 04:30:51,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:30:51,744 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:30:51,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:30:51,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-17 04:30:51,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-03-17 04:30:51,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 95 states have (on average 1.4421052631578948) internal successors, (137), 95 states have internal predecessors, (137), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 04:30:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 237 transitions. [2025-03-17 04:30:51,814 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 237 transitions. Word has length 321 [2025-03-17 04:30:51,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:30:51,815 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 237 transitions. [2025-03-17 04:30:51,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 04:30:51,815 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 237 transitions. [2025-03-17 04:30:51,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-17 04:30:51,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:30:51,823 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] [2025-03-17 04:30:51,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 04:30:52,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 04:30:52,024 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:30:52,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:30:52,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1157475245, now seen corresponding path program 1 times [2025-03-17 04:30:52,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:30:52,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941883177] [2025-03-17 04:30:52,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:52,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:30:52,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-17 04:30:52,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-17 04:30:52,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:52,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:52,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 04:30:52,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:30:52,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941883177] [2025-03-17 04:30:52,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941883177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:30:52,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:30:52,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:30:52,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411528880] [2025-03-17 04:30:52,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:30:52,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:30:52,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:30:52,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:30:52,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:30:52,376 INFO L87 Difference]: Start difference. First operand 147 states and 237 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 04:30:52,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:30:52,506 INFO L93 Difference]: Finished difference Result 433 states and 698 transitions. [2025-03-17 04:30:52,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:30:52,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 321 [2025-03-17 04:30:52,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:30:52,509 INFO L225 Difference]: With dead ends: 433 [2025-03-17 04:30:52,509 INFO L226 Difference]: Without dead ends: 287 [2025-03-17 04:30:52,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:30:52,511 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 210 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:30:52,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 613 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:30:52,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-17 04:30:52,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 187. [2025-03-17 04:30:52,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 135 states have (on average 1.4962962962962962) internal successors, (202), 135 states have internal predecessors, (202), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 04:30:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 302 transitions. [2025-03-17 04:30:52,542 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 302 transitions. Word has length 321 [2025-03-17 04:30:52,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:30:52,543 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 302 transitions. [2025-03-17 04:30:52,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 04:30:52,546 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 302 transitions. [2025-03-17 04:30:52,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-17 04:30:52,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:30:52,551 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] [2025-03-17 04:30:52,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:30:52,551 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:30:52,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:30:52,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1187191796, now seen corresponding path program 1 times [2025-03-17 04:30:52,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:30:52,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316645158] [2025-03-17 04:30:52,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:52,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:30:52,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-17 04:30:52,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-17 04:30:52,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:52,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 04:30:52,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:30:52,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316645158] [2025-03-17 04:30:52,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316645158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:30:52,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:30:52,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:30:52,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945955404] [2025-03-17 04:30:52,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:30:52,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:30:52,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:30:52,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:30:52,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:30:52,842 INFO L87 Difference]: Start difference. First operand 187 states and 302 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 04:30:52,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:30:52,927 INFO L93 Difference]: Finished difference Result 555 states and 896 transitions. [2025-03-17 04:30:52,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:30:52,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 321 [2025-03-17 04:30:52,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:30:52,931 INFO L225 Difference]: With dead ends: 555 [2025-03-17 04:30:52,931 INFO L226 Difference]: Without dead ends: 369 [2025-03-17 04:30:52,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:30:52,933 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 211 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:30:52,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 441 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:30:52,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-17 04:30:52,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 244. [2025-03-17 04:30:52,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 192 states have (on average 1.5260416666666667) internal successors, (293), 192 states have internal predecessors, (293), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 04:30:52,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 393 transitions. [2025-03-17 04:30:52,959 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 393 transitions. Word has length 321 [2025-03-17 04:30:52,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:30:52,960 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 393 transitions. [2025-03-17 04:30:52,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 04:30:52,960 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 393 transitions. [2025-03-17 04:30:52,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-17 04:30:52,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:30:52,964 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] [2025-03-17 04:30:52,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:30:52,964 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:30:52,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:30:52,965 INFO L85 PathProgramCache]: Analyzing trace with hash -871346111, now seen corresponding path program 1 times [2025-03-17 04:30:52,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:30:52,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483128327] [2025-03-17 04:30:52,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:52,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:30:52,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-17 04:30:53,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-17 04:30:53,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:53,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 04:30:53,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:30:53,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483128327] [2025-03-17 04:30:53,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483128327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:30:53,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:30:53,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:30:53,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142681750] [2025-03-17 04:30:53,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:30:53,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:30:53,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:30:53,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:30:53,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:30:53,697 INFO L87 Difference]: Start difference. First operand 244 states and 393 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 04:30:53,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:30:53,986 INFO L93 Difference]: Finished difference Result 785 states and 1255 transitions. [2025-03-17 04:30:53,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:30:53,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 322 [2025-03-17 04:30:53,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:30:53,991 INFO L225 Difference]: With dead ends: 785 [2025-03-17 04:30:53,991 INFO L226 Difference]: Without dead ends: 542 [2025-03-17 04:30:53,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:30:53,993 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 371 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:30:53,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 868 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:30:53,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-17 04:30:54,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 462. [2025-03-17 04:30:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 373 states have (on average 1.5361930294906165) internal successors, (573), 374 states have internal predecessors, (573), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 04:30:54,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 745 transitions. [2025-03-17 04:30:54,037 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 745 transitions. Word has length 322 [2025-03-17 04:30:54,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:30:54,039 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 745 transitions. [2025-03-17 04:30:54,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 04:30:54,039 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 745 transitions. [2025-03-17 04:30:54,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-17 04:30:54,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:30:54,042 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] [2025-03-17 04:30:54,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:30:54,042 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:30:54,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:30:54,043 INFO L85 PathProgramCache]: Analyzing trace with hash 761457888, now seen corresponding path program 1 times [2025-03-17 04:30:54,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:30:54,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679617250] [2025-03-17 04:30:54,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:54,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:30:54,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-17 04:30:54,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-17 04:30:54,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:54,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:54,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 04:30:54,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:30:54,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679617250] [2025-03-17 04:30:54,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679617250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:30:54,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:30:54,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:30:54,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631767315] [2025-03-17 04:30:54,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:30:54,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:30:54,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:30:54,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:30:54,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:30:54,969 INFO L87 Difference]: Start difference. First operand 462 states and 745 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 04:30:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:30:55,472 INFO L93 Difference]: Finished difference Result 1003 states and 1606 transitions. [2025-03-17 04:30:55,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:30:55,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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 322 [2025-03-17 04:30:55,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:30:55,478 INFO L225 Difference]: With dead ends: 1003 [2025-03-17 04:30:55,481 INFO L226 Difference]: Without dead ends: 542 [2025-03-17 04:30:55,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:30:55,483 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 454 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 04:30:55,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 725 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 04:30:55,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-17 04:30:55,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 462. [2025-03-17 04:30:55,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 373 states have (on average 1.522788203753351) internal successors, (568), 374 states have internal predecessors, (568), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 04:30:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 740 transitions. [2025-03-17 04:30:55,533 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 740 transitions. Word has length 322 [2025-03-17 04:30:55,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:30:55,536 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 740 transitions. [2025-03-17 04:30:55,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 04:30:55,536 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 740 transitions. [2025-03-17 04:30:55,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-17 04:30:55,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:30:55,540 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] [2025-03-17 04:30:55,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 04:30:55,540 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:30:55,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:30:55,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1808028511, now seen corresponding path program 1 times [2025-03-17 04:30:55,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:30:55,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797896412] [2025-03-17 04:30:55,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:55,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:30:55,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-17 04:30:55,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-17 04:30:55,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:55,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 04:30:56,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:30:56,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797896412] [2025-03-17 04:30:56,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797896412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:30:56,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:30:56,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:30:56,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081639440] [2025-03-17 04:30:56,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:30:56,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:30:56,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:30:56,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:30:56,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:30:56,468 INFO L87 Difference]: Start difference. First operand 462 states and 740 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 04:30:56,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:30:56,891 INFO L93 Difference]: Finished difference Result 1003 states and 1596 transitions. [2025-03-17 04:30:56,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:30:56,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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 322 [2025-03-17 04:30:56,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:30:56,894 INFO L225 Difference]: With dead ends: 1003 [2025-03-17 04:30:56,895 INFO L226 Difference]: Without dead ends: 542 [2025-03-17 04:30:56,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:30:56,896 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 448 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 04:30:56,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 725 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 04:30:56,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-17 04:30:56,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 462. [2025-03-17 04:30:56,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 373 states have (on average 1.520107238605898) internal successors, (567), 374 states have internal predecessors, (567), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 04:30:56,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 739 transitions. [2025-03-17 04:30:56,928 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 739 transitions. Word has length 322 [2025-03-17 04:30:56,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:30:56,928 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 739 transitions. [2025-03-17 04:30:56,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 04:30:56,928 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 739 transitions. [2025-03-17 04:30:56,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-17 04:30:56,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:30:56,931 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] [2025-03-17 04:30:56,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 04:30:56,932 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:30:56,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:30:56,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1457228574, now seen corresponding path program 1 times [2025-03-17 04:30:56,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:30:56,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927017333] [2025-03-17 04:30:56,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:56,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:30:56,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-17 04:30:57,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-17 04:30:57,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:57,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 04:30:58,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:30:58,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927017333] [2025-03-17 04:30:58,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927017333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:30:58,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:30:58,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 04:30:58,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246840543] [2025-03-17 04:30:58,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:30:58,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 04:30:58,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:30:58,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 04:30:58,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:30:58,250 INFO L87 Difference]: Start difference. First operand 462 states and 739 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 04:30:59,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:30:59,954 INFO L93 Difference]: Finished difference Result 2031 states and 3242 transitions. [2025-03-17 04:30:59,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:30:59,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 322 [2025-03-17 04:30:59,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:30:59,964 INFO L225 Difference]: With dead ends: 2031 [2025-03-17 04:30:59,965 INFO L226 Difference]: Without dead ends: 1570 [2025-03-17 04:30:59,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:30:59,968 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 523 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:30:59,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1516 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 04:30:59,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2025-03-17 04:31:00,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1549. [2025-03-17 04:31:00,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1549 states, 1196 states have (on average 1.4983277591973243) internal successors, (1792), 1200 states have internal predecessors, (1792), 344 states have call successors, (344), 8 states have call predecessors, (344), 8 states have return successors, (344), 340 states have call predecessors, (344), 344 states have call successors, (344) [2025-03-17 04:31:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 2480 transitions. [2025-03-17 04:31:00,101 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 2480 transitions. Word has length 322 [2025-03-17 04:31:00,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:31:00,102 INFO L471 AbstractCegarLoop]: Abstraction has 1549 states and 2480 transitions. [2025-03-17 04:31:00,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 04:31:00,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 2480 transitions. [2025-03-17 04:31:00,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-17 04:31:00,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:31:00,107 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] [2025-03-17 04:31:00,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 04:31:00,107 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:31:00,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:31:00,107 INFO L85 PathProgramCache]: Analyzing trace with hash 969058717, now seen corresponding path program 1 times [2025-03-17 04:31:00,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:31:00,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705660873] [2025-03-17 04:31:00,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:31:00,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:31:00,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-17 04:31:00,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-17 04:31:00,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:31:00,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:31:01,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 04:31:01,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:31:01,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705660873] [2025-03-17 04:31:01,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705660873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:31:01,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:31:01,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:31:01,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156498760] [2025-03-17 04:31:01,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:31:01,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:31:01,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:31:01,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:31:01,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:31:01,325 INFO L87 Difference]: Start difference. First operand 1549 states and 2480 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 04:31:02,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:31:02,450 INFO L93 Difference]: Finished difference Result 4194 states and 6714 transitions. [2025-03-17 04:31:02,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:31:02,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 322 [2025-03-17 04:31:02,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:31:02,464 INFO L225 Difference]: With dead ends: 4194 [2025-03-17 04:31:02,464 INFO L226 Difference]: Without dead ends: 2646 [2025-03-17 04:31:02,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:31:02,470 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 323 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 04:31:02,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1253 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 04:31:02,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2025-03-17 04:31:02,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2632. [2025-03-17 04:31:02,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2632 states, 2015 states have (on average 1.4952853598014888) internal successors, (3013), 2022 states have internal predecessors, (3013), 602 states have call successors, (602), 14 states have call predecessors, (602), 14 states have return successors, (602), 595 states have call predecessors, (602), 602 states have call successors, (602) [2025-03-17 04:31:02,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2632 states to 2632 states and 4217 transitions. [2025-03-17 04:31:02,678 INFO L78 Accepts]: Start accepts. Automaton has 2632 states and 4217 transitions. Word has length 322 [2025-03-17 04:31:02,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:31:02,678 INFO L471 AbstractCegarLoop]: Abstraction has 2632 states and 4217 transitions. [2025-03-17 04:31:02,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 04:31:02,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 4217 transitions. [2025-03-17 04:31:02,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-17 04:31:02,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:31:02,685 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] [2025-03-17 04:31:02,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 04:31:02,685 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:31:02,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:31:02,685 INFO L85 PathProgramCache]: Analyzing trace with hash 590233888, now seen corresponding path program 1 times [2025-03-17 04:31:02,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:31:02,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665836199] [2025-03-17 04:31:02,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:31:02,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:31:02,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-17 04:31:02,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-17 04:31:02,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:31:02,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:31:03,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 04:31:03,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:31:03,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665836199] [2025-03-17 04:31:03,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665836199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:31:03,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:31:03,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:31:03,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418559768] [2025-03-17 04:31:03,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:31:03,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:31:03,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:31:03,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:31:03,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:31:03,022 INFO L87 Difference]: Start difference. First operand 2632 states and 4217 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 04:31:03,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:31:03,502 INFO L93 Difference]: Finished difference Result 5633 states and 8999 transitions. [2025-03-17 04:31:03,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:31:03,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 322 [2025-03-17 04:31:03,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:31:03,522 INFO L225 Difference]: With dead ends: 5633 [2025-03-17 04:31:03,522 INFO L226 Difference]: Without dead ends: 3002 [2025-03-17 04:31:03,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:31:03,532 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 462 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:31:03,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 853 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:31:03,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3002 states. [2025-03-17 04:31:03,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3002 to 2824. [2025-03-17 04:31:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2824 states, 2094 states have (on average 1.4765998089780326) internal successors, (3092), 2102 states have internal predecessors, (3092), 708 states have call successors, (708), 21 states have call predecessors, (708), 21 states have return successors, (708), 700 states have call predecessors, (708), 708 states have call successors, (708) [2025-03-17 04:31:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 4508 transitions. [2025-03-17 04:31:03,751 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 4508 transitions. Word has length 322 [2025-03-17 04:31:03,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:31:03,752 INFO L471 AbstractCegarLoop]: Abstraction has 2824 states and 4508 transitions. [2025-03-17 04:31:03,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 04:31:03,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 4508 transitions. [2025-03-17 04:31:03,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-17 04:31:03,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:31:03,758 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] [2025-03-17 04:31:03,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 04:31:03,758 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:31:03,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:31:03,759 INFO L85 PathProgramCache]: Analyzing trace with hash -2071929409, now seen corresponding path program 1 times [2025-03-17 04:31:03,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:31:03,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087164635] [2025-03-17 04:31:03,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:31:03,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:31:03,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-17 04:31:03,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-17 04:31:03,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:31:03,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:31:04,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 04:31:04,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:31:04,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087164635] [2025-03-17 04:31:04,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087164635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:31:04,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:31:04,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:31:04,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715993806] [2025-03-17 04:31:04,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:31:04,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:31:04,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:31:04,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:31:04,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:31:04,143 INFO L87 Difference]: Start difference. First operand 2824 states and 4508 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 04:31:04,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:31:04,796 INFO L93 Difference]: Finished difference Result 5435 states and 8659 transitions. [2025-03-17 04:31:04,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:31:04,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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 322 [2025-03-17 04:31:04,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:31:04,814 INFO L225 Difference]: With dead ends: 5435 [2025-03-17 04:31:04,814 INFO L226 Difference]: Without dead ends: 2670 [2025-03-17 04:31:04,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:31:04,822 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 462 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:31:04,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 921 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:31:04,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2025-03-17 04:31:05,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2492. [2025-03-17 04:31:05,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2492 states, 1798 states have (on average 1.4404894327030033) internal successors, (2590), 1805 states have internal predecessors, (2590), 672 states have call successors, (672), 21 states have call predecessors, (672), 21 states have return successors, (672), 665 states have call predecessors, (672), 672 states have call successors, (672) [2025-03-17 04:31:05,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 3934 transitions. [2025-03-17 04:31:05,022 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 3934 transitions. Word has length 322 [2025-03-17 04:31:05,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:31:05,022 INFO L471 AbstractCegarLoop]: Abstraction has 2492 states and 3934 transitions. [2025-03-17 04:31:05,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 04:31:05,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 3934 transitions. [2025-03-17 04:31:05,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-17 04:31:05,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:31:05,026 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] [2025-03-17 04:31:05,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 04:31:05,027 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:31:05,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:31:05,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1649768942, now seen corresponding path program 1 times [2025-03-17 04:31:05,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:31:05,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115663420] [2025-03-17 04:31:05,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:31:05,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:31:05,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-17 04:31:05,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-17 04:31:05,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:31:05,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:31:06,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 04:31:06,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:31:06,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115663420] [2025-03-17 04:31:06,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115663420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:31:06,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:31:06,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:31:06,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003422713] [2025-03-17 04:31:06,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:31:06,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:31:06,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:31:06,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:31:06,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:31:06,199 INFO L87 Difference]: Start difference. First operand 2492 states and 3934 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 04:31:10,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-17 04:31:11,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:31:11,563 INFO L93 Difference]: Finished difference Result 4507 states and 7101 transitions. [2025-03-17 04:31:11,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:31:11,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 323 [2025-03-17 04:31:11,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:31:11,586 INFO L225 Difference]: With dead ends: 4507 [2025-03-17 04:31:11,586 INFO L226 Difference]: Without dead ends: 4026 [2025-03-17 04:31:11,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:31:11,591 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 393 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 101 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:31:11,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1369 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 542 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2025-03-17 04:31:11,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4026 states. [2025-03-17 04:31:11,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4026 to 2335. [2025-03-17 04:31:11,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 1740 states have (on average 1.4540229885057472) internal successors, (2530), 1746 states have internal predecessors, (2530), 576 states have call successors, (576), 18 states have call predecessors, (576), 18 states have return successors, (576), 570 states have call predecessors, (576), 576 states have call successors, (576) [2025-03-17 04:31:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 3682 transitions. [2025-03-17 04:31:11,874 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 3682 transitions. Word has length 323 [2025-03-17 04:31:11,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:31:11,875 INFO L471 AbstractCegarLoop]: Abstraction has 2335 states and 3682 transitions. [2025-03-17 04:31:11,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 04:31:11,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3682 transitions. [2025-03-17 04:31:11,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-17 04:31:11,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:31:11,879 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] [2025-03-17 04:31:11,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 04:31:11,880 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:31:11,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:31:11,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1165212660, now seen corresponding path program 1 times [2025-03-17 04:31:11,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:31:11,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184055233] [2025-03-17 04:31:11,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:31:11,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:31:11,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-17 04:31:12,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-17 04:31:12,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:31:12,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:31:12,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 04:31:12,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:31:12,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184055233] [2025-03-17 04:31:12,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184055233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:31:12,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:31:12,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:31:12,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904520526] [2025-03-17 04:31:12,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:31:12,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:31:12,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:31:12,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:31:12,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:31:12,769 INFO L87 Difference]: Start difference. First operand 2335 states and 3682 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 04:31:13,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:31:13,367 INFO L93 Difference]: Finished difference Result 4677 states and 7370 transitions. [2025-03-17 04:31:13,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:31:13,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 323 [2025-03-17 04:31:13,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:31:13,379 INFO L225 Difference]: With dead ends: 4677 [2025-03-17 04:31:13,379 INFO L226 Difference]: Without dead ends: 2343 [2025-03-17 04:31:13,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:31:13,385 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 219 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:31:13,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 599 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:31:13,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2025-03-17 04:31:13,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 945. [2025-03-17 04:31:13,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 746 states have (on average 1.479892761394102) internal successors, (1104), 748 states have internal predecessors, (1104), 192 states have call successors, (192), 6 states have call predecessors, (192), 6 states have return successors, (192), 190 states have call predecessors, (192), 192 states have call successors, (192) [2025-03-17 04:31:13,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1488 transitions. [2025-03-17 04:31:13,483 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1488 transitions. Word has length 323 [2025-03-17 04:31:13,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:31:13,483 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1488 transitions. [2025-03-17 04:31:13,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 04:31:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1488 transitions. [2025-03-17 04:31:13,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-17 04:31:13,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:31:13,485 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] [2025-03-17 04:31:13,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 04:31:13,485 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:31:13,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:31:13,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1586316150, now seen corresponding path program 1 times [2025-03-17 04:31:13,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:31:13,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731427680] [2025-03-17 04:31:13,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:31:13,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:31:13,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-17 04:31:13,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-17 04:31:13,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:31:13,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:31:13,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 138 proven. 9 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-17 04:31:13,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:31:13,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731427680] [2025-03-17 04:31:13,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731427680] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:31:13,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551532403] [2025-03-17 04:31:13,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:31:13,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:31:13,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:31:13,806 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:31:13,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 04:31:13,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-17 04:31:13,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-17 04:31:13,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:31:13,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:31:13,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 04:31:13,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:31:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2074 proven. 39 refuted. 0 times theorem prover too weak. 2787 trivial. 0 not checked. [2025-03-17 04:31:14,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:31:14,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 108 proven. 39 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-17 04:31:14,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551532403] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:31:14,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:31:14,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 8] total 18 [2025-03-17 04:31:14,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440685116] [2025-03-17 04:31:14,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:31:14,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 04:31:14,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:31:14,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 04:31:14,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-17 04:31:14,584 INFO L87 Difference]: Start difference. First operand 945 states and 1488 transitions. Second operand has 18 states, 18 states have (on average 7.333333333333333) internal successors, (132), 18 states have internal predecessors, (132), 5 states have call successors, (76), 3 states have call predecessors, (76), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) [2025-03-17 04:31:18,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:31:18,501 INFO L93 Difference]: Finished difference Result 2299 states and 3464 transitions. [2025-03-17 04:31:18,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-17 04:31:18,502 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.333333333333333) internal successors, (132), 18 states have internal predecessors, (132), 5 states have call successors, (76), 3 states have call predecessors, (76), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) Word has length 323 [2025-03-17 04:31:18,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:31:18,512 INFO L225 Difference]: With dead ends: 2299 [2025-03-17 04:31:18,512 INFO L226 Difference]: Without dead ends: 1355 [2025-03-17 04:31:18,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2062 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1018, Invalid=5302, Unknown=0, NotChecked=0, Total=6320 [2025-03-17 04:31:18,518 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 1884 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 2702 mSolverCounterSat, 1558 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1884 SdHoareTripleChecker+Valid, 2269 SdHoareTripleChecker+Invalid, 4260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1558 IncrementalHoareTripleChecker+Valid, 2702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-17 04:31:18,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1884 Valid, 2269 Invalid, 4260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1558 Valid, 2702 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-17 04:31:18,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2025-03-17 04:31:18,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 431. [2025-03-17 04:31:18,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 322 states have (on average 1.3416149068322982) internal successors, (432), 323 states have internal predecessors, (432), 98 states have call successors, (98), 10 states have call predecessors, (98), 10 states have return successors, (98), 97 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 04:31:18,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 628 transitions. [2025-03-17 04:31:18,598 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 628 transitions. Word has length 323 [2025-03-17 04:31:18,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:31:18,599 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 628 transitions. [2025-03-17 04:31:18,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.333333333333333) internal successors, (132), 18 states have internal predecessors, (132), 5 states have call successors, (76), 3 states have call predecessors, (76), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) [2025-03-17 04:31:18,599 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 628 transitions. [2025-03-17 04:31:18,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-17 04:31:18,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:31:18,601 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:31:18,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 04:31:18,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 04:31:18,802 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:31:18,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:31:18,802 INFO L85 PathProgramCache]: Analyzing trace with hash -992833928, now seen corresponding path program 1 times [2025-03-17 04:31:18,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:31:18,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783795890] [2025-03-17 04:31:18,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:31:18,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:31:18,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-17 04:31:19,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-17 04:31:19,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:31:19,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:31:19,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 132 proven. 15 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-17 04:31:19,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:31:19,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783795890] [2025-03-17 04:31:19,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783795890] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:31:19,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673398469] [2025-03-17 04:31:19,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:31:19,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:31:19,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:31:19,592 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:31:19,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 04:31:19,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-17 04:31:19,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-17 04:31:19,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:31:19,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:31:19,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 04:31:19,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:31:20,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 1017 proven. 15 refuted. 0 times theorem prover too weak. 3868 trivial. 0 not checked. [2025-03-17 04:31:20,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:31:20,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 132 proven. 15 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-17 04:31:20,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673398469] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:31:20,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:31:20,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 23 [2025-03-17 04:31:20,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100098302] [2025-03-17 04:31:20,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:31:20,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 04:31:20,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:31:20,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 04:31:20,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2025-03-17 04:31:20,896 INFO L87 Difference]: Start difference. First operand 431 states and 628 transitions. Second operand has 23 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 4 states have call successors, (150), 3 states have call predecessors, (150), 6 states have return successors, (150), 4 states have call predecessors, (150), 4 states have call successors, (150) [2025-03-17 04:31:23,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:31:23,665 INFO L93 Difference]: Finished difference Result 1745 states and 2498 transitions. [2025-03-17 04:31:23,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-17 04:31:23,666 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 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 324 [2025-03-17 04:31:23,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:31:23,671 INFO L225 Difference]: With dead ends: 1745 [2025-03-17 04:31:23,672 INFO L226 Difference]: Without dead ends: 1315 [2025-03-17 04:31:23,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=509, Invalid=2247, Unknown=0, NotChecked=0, Total=2756 [2025-03-17 04:31:23,674 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 1664 mSDsluCounter, 2010 mSDsCounter, 0 mSdLazyCounter, 2725 mSolverCounterSat, 867 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1666 SdHoareTripleChecker+Valid, 2310 SdHoareTripleChecker+Invalid, 3592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 867 IncrementalHoareTripleChecker+Valid, 2725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:31:23,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1666 Valid, 2310 Invalid, 3592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [867 Valid, 2725 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 04:31:23,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2025-03-17 04:31:23,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 789. [2025-03-17 04:31:23,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 520 states have (on average 1.25) internal successors, (650), 523 states have internal predecessors, (650), 241 states have call successors, (241), 27 states have call predecessors, (241), 27 states have return successors, (241), 238 states have call predecessors, (241), 241 states have call successors, (241) [2025-03-17 04:31:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1132 transitions. [2025-03-17 04:31:23,915 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1132 transitions. Word has length 324 [2025-03-17 04:31:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:31:23,916 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1132 transitions. [2025-03-17 04:31:23,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.173913043478261) internal successors, (142), 23 states have internal predecessors, (142), 4 states have call successors, (150), 3 states have call predecessors, (150), 6 states have return successors, (150), 4 states have call predecessors, (150), 4 states have call successors, (150) [2025-03-17 04:31:23,916 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1132 transitions. [2025-03-17 04:31:23,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-17 04:31:23,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:31:23,918 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:31:23,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 04:31:24,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:31:24,119 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:31:24,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:31:24,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1477390210, now seen corresponding path program 1 times [2025-03-17 04:31:24,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:31:24,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764138268] [2025-03-17 04:31:24,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:31:24,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:31:24,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-17 04:31:24,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-17 04:31:24,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:31:24,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:31:25,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 108 proven. 39 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-17 04:31:25,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:31:25,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764138268] [2025-03-17 04:31:25,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764138268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:31:25,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128396024] [2025-03-17 04:31:25,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:31:25,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:31:25,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:31:25,266 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:31:25,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 04:31:25,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-17 04:31:25,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-17 04:31:25,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:31:25,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:31:25,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 04:31:25,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:31:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 3340 proven. 249 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2025-03-17 04:31:26,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:31:27,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 303 proven. 267 refuted. 0 times theorem prover too weak. 4330 trivial. 0 not checked. [2025-03-17 04:31:27,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128396024] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:31:27,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:31:27,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 31 [2025-03-17 04:31:27,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768097284] [2025-03-17 04:31:27,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:31:27,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 04:31:27,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:31:27,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 04:31:27,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2025-03-17 04:31:27,684 INFO L87 Difference]: Start difference. First operand 789 states and 1132 transitions. Second operand has 31 states, 29 states have (on average 6.827586206896552) internal successors, (198), 29 states have internal predecessors, (198), 11 states have call successors, (108), 5 states have call predecessors, (108), 12 states have return successors, (110), 10 states have call predecessors, (110), 11 states have call successors, (110) [2025-03-17 04:31:31,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:31:31,347 INFO L93 Difference]: Finished difference Result 2091 states and 2921 transitions. [2025-03-17 04:31:31,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-17 04:31:31,348 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 6.827586206896552) internal successors, (198), 29 states have internal predecessors, (198), 11 states have call successors, (108), 5 states have call predecessors, (108), 12 states have return successors, (110), 10 states have call predecessors, (110), 11 states have call successors, (110) Word has length 324 [2025-03-17 04:31:31,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:31:31,361 INFO L225 Difference]: With dead ends: 2091 [2025-03-17 04:31:31,364 INFO L226 Difference]: Without dead ends: 1391 [2025-03-17 04:31:31,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 631 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1527 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1430, Invalid=4576, Unknown=0, NotChecked=0, Total=6006 [2025-03-17 04:31:31,370 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 957 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 1555 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 670 IncrementalHoareTripleChecker+Valid, 1555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:31:31,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 1213 Invalid, 2225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [670 Valid, 1555 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-17 04:31:31,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2025-03-17 04:31:31,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 869. [2025-03-17 04:31:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 580 states have (on average 1.196551724137931) internal successors, (694), 583 states have internal predecessors, (694), 241 states have call successors, (241), 47 states have call predecessors, (241), 47 states have return successors, (241), 238 states have call predecessors, (241), 241 states have call successors, (241) [2025-03-17 04:31:31,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1176 transitions. [2025-03-17 04:31:31,574 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1176 transitions. Word has length 324 [2025-03-17 04:31:31,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:31:31,574 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1176 transitions. [2025-03-17 04:31:31,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 6.827586206896552) internal successors, (198), 29 states have internal predecessors, (198), 11 states have call successors, (108), 5 states have call predecessors, (108), 12 states have return successors, (110), 10 states have call predecessors, (110), 11 states have call successors, (110) [2025-03-17 04:31:31,575 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1176 transitions. [2025-03-17 04:31:31,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-17 04:31:31,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:31:31,576 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:31:31,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 04:31:31,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 04:31:31,780 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:31:31,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:31:31,781 INFO L85 PathProgramCache]: Analyzing trace with hash -673211143, now seen corresponding path program 1 times [2025-03-17 04:31:31,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:31:31,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572373481] [2025-03-17 04:31:31,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:31:31,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:31:31,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-17 04:31:32,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-17 04:31:32,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:31:32,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 04:31:32,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1290711096] [2025-03-17 04:31:32,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:31:32,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:31:32,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:31:32,182 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:31:32,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 04:31:32,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-17 04:31:32,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-17 04:31:32,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:31:32,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:31:32,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 04:31:32,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:31:33,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 1239 proven. 126 refuted. 0 times theorem prover too weak. 3535 trivial. 0 not checked. [2025-03-17 04:31:33,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:31:33,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:31:33,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572373481] [2025-03-17 04:31:33,862 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 04:31:33,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290711096] [2025-03-17 04:31:33,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290711096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:31:33,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:31:33,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-17 04:31:33,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995839307] [2025-03-17 04:31:33,863 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 04:31:33,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 04:31:33,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:31:33,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 04:31:33,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-17 04:31:33,864 INFO L87 Difference]: Start difference. First operand 869 states and 1176 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (50), 2 states have call predecessors, (50), 3 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 04:31:34,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:31:34,713 INFO L93 Difference]: Finished difference Result 1988 states and 2674 transitions. [2025-03-17 04:31:34,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 04:31:34,713 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (50), 2 states have call predecessors, (50), 3 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 326 [2025-03-17 04:31:34,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:31:34,718 INFO L225 Difference]: With dead ends: 1988 [2025-03-17 04:31:34,718 INFO L226 Difference]: Without dead ends: 1224 [2025-03-17 04:31:34,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2025-03-17 04:31:34,720 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 243 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:31:34,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1423 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:31:34,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2025-03-17 04:31:34,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1071. [2025-03-17 04:31:34,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 760 states have (on average 1.2105263157894737) internal successors, (920), 764 states have internal predecessors, (920), 256 states have call successors, (256), 54 states have call predecessors, (256), 54 states have return successors, (256), 252 states have call predecessors, (256), 256 states have call successors, (256) [2025-03-17 04:31:34,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1432 transitions. [2025-03-17 04:31:34,917 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1432 transitions. Word has length 326 [2025-03-17 04:31:34,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:31:34,918 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1432 transitions. [2025-03-17 04:31:34,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (50), 2 states have call predecessors, (50), 3 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 04:31:34,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1432 transitions. [2025-03-17 04:31:34,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-17 04:31:34,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:31:34,920 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:31:34,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 04:31:35,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 04:31:35,121 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:31:35,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:31:35,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1921015674, now seen corresponding path program 1 times [2025-03-17 04:31:35,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:31:35,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121102168] [2025-03-17 04:31:35,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:31:35,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:31:35,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-17 04:31:35,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-17 04:31:35,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:31:35,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 04:31:35,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [781625868] [2025-03-17 04:31:35,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:31:35,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:31:35,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:31:35,624 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:31:35,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 04:31:35,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes.