./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-34.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 11f663f31fd7e407dcb664c9f5df2c771bffa1ce1600c8629f9e6c1a07759991 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:07:53,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:07:53,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:07:53,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:07:53,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:07:53,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:07:53,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:07:53,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:07:53,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:07:53,907 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:07:53,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:07:53,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:07:53,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:07:53,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:07:53,908 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:07:53,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:07:53,908 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:07:53,908 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:07:53,908 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:07:53,908 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:07:53,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:07:53,908 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:07:53,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:07:53,908 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:07:53,908 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:07:53,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:07:53,908 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:07:53,908 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:07:53,909 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:07:53,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:07:53,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:07:53,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:07:53,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:07:53,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:07:53,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:07:53,909 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:07:53,909 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:07:53,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:07:53,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:07:53,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:07:53,909 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:07:53,909 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:07:53,909 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:07:53,909 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 -> 11f663f31fd7e407dcb664c9f5df2c771bffa1ce1600c8629f9e6c1a07759991 [2025-03-08 11:07:54,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:07:54,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:07:54,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:07:54,148 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:07:54,149 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:07:54,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-34.i [2025-03-08 11:07:55,267 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7f6d2779/b6200aaf3a15465aa54a9af414b22c68/FLAGd5bd8aec7 [2025-03-08 11:07:55,510 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:07:55,510 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-34.i [2025-03-08 11:07:55,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7f6d2779/b6200aaf3a15465aa54a9af414b22c68/FLAGd5bd8aec7 [2025-03-08 11:07:55,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7f6d2779/b6200aaf3a15465aa54a9af414b22c68 [2025-03-08 11:07:55,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:07:55,537 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:07:55,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:07:55,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:07:55,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:07:55,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23924919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55, skipping insertion in model container [2025-03-08 11:07:55,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:07:55,667 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_fillercode_fillercodesize_ps-cn-25_file-34.i[915,928] [2025-03-08 11:07:55,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:07:55,745 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:07:55,754 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_fillercode_fillercodesize_ps-cn-25_file-34.i[915,928] [2025-03-08 11:07:55,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:07:55,807 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:07:55,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55 WrapperNode [2025-03-08 11:07:55,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:07:55,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:07:55,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:07:55,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:07:55,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,858 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2025-03-08 11:07:55,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:07:55,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:07:55,864 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:07:55,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:07:55,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,872 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,898 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:07:55,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,909 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,916 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:07:55,921 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:07:55,922 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:07:55,922 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:07:55,922 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (1/1) ... [2025-03-08 11:07:55,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:07:55,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:07:55,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:07:55,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:07:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:07:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:07:55,970 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:07:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:07:55,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:07:55,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:07:56,050 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:07:56,051 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:07:56,406 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: havoc property_#t~bitwise21#1;havoc property_#t~ite23#1;havoc property_#t~bitwise22#1;havoc property_#t~short24#1; [2025-03-08 11:07:56,441 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-08 11:07:56,442 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:07:56,456 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:07:56,458 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:07:56,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:07:56 BoogieIcfgContainer [2025-03-08 11:07:56,459 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:07:56,461 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:07:56,461 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:07:56,464 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:07:56,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:07:55" (1/3) ... [2025-03-08 11:07:56,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41667d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:07:56, skipping insertion in model container [2025-03-08 11:07:56,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:55" (2/3) ... [2025-03-08 11:07:56,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41667d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:07:56, skipping insertion in model container [2025-03-08 11:07:56,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:07:56" (3/3) ... [2025-03-08 11:07:56,467 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-34.i [2025-03-08 11:07:56,476 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:07:56,478 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-34.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:07:56,519 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:07:56,528 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;@6fdb46e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:07:56,529 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:07:56,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 11:07:56,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 11:07:56,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:07:56,543 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:07:56,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:07:56,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:07:56,548 INFO L85 PathProgramCache]: Analyzing trace with hash -477743295, now seen corresponding path program 1 times [2025-03-08 11:07:56,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:07:56,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923957611] [2025-03-08 11:07:56,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:07:56,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:07:56,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 11:07:56,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 11:07:56,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:07:56,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:07:56,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-08 11:07:56,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:07:56,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923957611] [2025-03-08 11:07:56,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923957611] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:07:56,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364732867] [2025-03-08 11:07:56,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:07:56,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:07:56,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:07:56,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:07:56,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:07:56,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 11:07:56,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 11:07:56,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:07:56,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:07:56,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:07:56,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:07:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-08 11:07:57,004 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:07:57,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364732867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:07:57,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:07:57,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:07:57,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682390143] [2025-03-08 11:07:57,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:07:57,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:07:57,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:07:57,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:07:57,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:07:57,022 INFO L87 Difference]: Start difference. First operand has 98 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 11:07:57,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:07:57,055 INFO L93 Difference]: Finished difference Result 190 states and 328 transitions. [2025-03-08 11:07:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:07:57,056 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 177 [2025-03-08 11:07:57,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:07:57,062 INFO L225 Difference]: With dead ends: 190 [2025-03-08 11:07:57,063 INFO L226 Difference]: Without dead ends: 95 [2025-03-08 11:07:57,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:07:57,067 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:07:57,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:07:57,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-08 11:07:57,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-08 11:07:57,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 11:07:57,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 148 transitions. [2025-03-08 11:07:57,101 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 148 transitions. Word has length 177 [2025-03-08 11:07:57,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:07:57,101 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 148 transitions. [2025-03-08 11:07:57,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 11:07:57,102 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 148 transitions. [2025-03-08 11:07:57,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 11:07:57,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:07:57,106 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:07:57,113 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-08 11:07:57,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:07:57,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:07:57,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:07:57,312 INFO L85 PathProgramCache]: Analyzing trace with hash -561648414, now seen corresponding path program 1 times [2025-03-08 11:07:57,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:07:57,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997454540] [2025-03-08 11:07:57,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:07:57,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:07:57,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 11:07:57,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 11:07:57,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:07:57,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:07:57,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 11:07:57,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:07:57,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997454540] [2025-03-08 11:07:57,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997454540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:07:57,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:07:57,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:07:57,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007801507] [2025-03-08 11:07:57,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:07:57,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:07:57,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:07:57,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:07:57,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:07:57,663 INFO L87 Difference]: Start difference. First operand 95 states and 148 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:07:57,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:07:57,724 INFO L93 Difference]: Finished difference Result 279 states and 438 transitions. [2025-03-08 11:07:57,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:07:57,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2025-03-08 11:07:57,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:07:57,728 INFO L225 Difference]: With dead ends: 279 [2025-03-08 11:07:57,730 INFO L226 Difference]: Without dead ends: 187 [2025-03-08 11:07:57,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:07:57,731 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 143 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:07:57,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 362 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:07:57,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-08 11:07:57,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2025-03-08 11:07:57,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 128 states have (on average 1.4296875) internal successors, (183), 128 states have internal predecessors, (183), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 11:07:57,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 291 transitions. [2025-03-08 11:07:57,767 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 291 transitions. Word has length 177 [2025-03-08 11:07:57,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:07:57,768 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 291 transitions. [2025-03-08 11:07:57,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:07:57,768 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 291 transitions. [2025-03-08 11:07:57,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 11:07:57,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:07:57,770 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:07:57,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:07:57,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:07:57,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:07:57,773 INFO L85 PathProgramCache]: Analyzing trace with hash -350297501, now seen corresponding path program 1 times [2025-03-08 11:07:57,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:07:57,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918094839] [2025-03-08 11:07:57,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:07:57,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:07:57,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 11:07:57,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 11:07:57,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:07:57,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:07:58,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 11:07:58,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:07:58,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918094839] [2025-03-08 11:07:58,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918094839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:07:58,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:07:58,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:07:58,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42473439] [2025-03-08 11:07:58,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:07:58,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:07:58,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:07:58,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:07:58,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:07:58,043 INFO L87 Difference]: Start difference. First operand 185 states and 291 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:07:58,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:07:58,211 INFO L93 Difference]: Finished difference Result 607 states and 956 transitions. [2025-03-08 11:07:58,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:07:58,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2025-03-08 11:07:58,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:07:58,214 INFO L225 Difference]: With dead ends: 607 [2025-03-08 11:07:58,214 INFO L226 Difference]: Without dead ends: 425 [2025-03-08 11:07:58,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:07:58,215 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 154 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:07:58,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 448 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:07:58,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-08 11:07:58,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 369. [2025-03-08 11:07:58,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 256 states have (on average 1.421875) internal successors, (364), 256 states have internal predecessors, (364), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 11:07:58,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 580 transitions. [2025-03-08 11:07:58,268 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 580 transitions. Word has length 177 [2025-03-08 11:07:58,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:07:58,269 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 580 transitions. [2025-03-08 11:07:58,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:07:58,269 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 580 transitions. [2025-03-08 11:07:58,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-08 11:07:58,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:07:58,273 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:07:58,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:07:58,273 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:07:58,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:07:58,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1168845276, now seen corresponding path program 1 times [2025-03-08 11:07:58,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:07:58,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819755324] [2025-03-08 11:07:58,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:07:58,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:07:58,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 11:07:58,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 11:07:58,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:07:58,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:07:58,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 11:07:58,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:07:58,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819755324] [2025-03-08 11:07:58,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819755324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:07:58,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:07:58,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:07:58,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224581958] [2025-03-08 11:07:58,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:07:58,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:07:58,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:07:58,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:07:58,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:07:58,512 INFO L87 Difference]: Start difference. First operand 369 states and 580 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:07:58,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:07:58,861 INFO L93 Difference]: Finished difference Result 1090 states and 1711 transitions. [2025-03-08 11:07:58,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:07:58,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 178 [2025-03-08 11:07:58,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:07:58,869 INFO L225 Difference]: With dead ends: 1090 [2025-03-08 11:07:58,869 INFO L226 Difference]: Without dead ends: 724 [2025-03-08 11:07:58,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:07:58,872 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 173 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:07:58,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 563 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:07:58,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-03-08 11:07:58,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 377. [2025-03-08 11:07:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 264 states have (on average 1.4090909090909092) internal successors, (372), 264 states have internal predecessors, (372), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 11:07:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 588 transitions. [2025-03-08 11:07:58,920 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 588 transitions. Word has length 178 [2025-03-08 11:07:58,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:07:58,920 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 588 transitions. [2025-03-08 11:07:58,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:07:58,920 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 588 transitions. [2025-03-08 11:07:58,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 11:07:58,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:07:58,922 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:07:58,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:07:58,922 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:07:58,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:07:58,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1936599839, now seen corresponding path program 1 times [2025-03-08 11:07:58,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:07:58,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904922532] [2025-03-08 11:07:58,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:07:58,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:07:58,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 11:07:58,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 11:07:58,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:07:58,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:07:59,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 11:07:59,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:07:59,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904922532] [2025-03-08 11:07:59,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904922532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:07:59,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:07:59,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:07:59,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352253111] [2025-03-08 11:07:59,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:07:59,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:07:59,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:07:59,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:07:59,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:07:59,354 INFO L87 Difference]: Start difference. First operand 377 states and 588 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:07:59,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:07:59,642 INFO L93 Difference]: Finished difference Result 949 states and 1474 transitions. [2025-03-08 11:07:59,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:07:59,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 179 [2025-03-08 11:07:59,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:07:59,648 INFO L225 Difference]: With dead ends: 949 [2025-03-08 11:07:59,648 INFO L226 Difference]: Without dead ends: 575 [2025-03-08 11:07:59,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:07:59,652 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 107 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:07:59,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 369 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:07:59,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-08 11:07:59,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 465. [2025-03-08 11:07:59,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 324 states have (on average 1.4012345679012346) internal successors, (454), 324 states have internal predecessors, (454), 135 states have call successors, (135), 5 states have call predecessors, (135), 5 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-08 11:07:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 724 transitions. [2025-03-08 11:07:59,711 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 724 transitions. Word has length 179 [2025-03-08 11:07:59,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:07:59,712 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 724 transitions. [2025-03-08 11:07:59,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:07:59,712 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 724 transitions. [2025-03-08 11:07:59,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 11:07:59,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:07:59,713 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:07:59,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:07:59,714 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:07:59,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:07:59,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1852808832, now seen corresponding path program 1 times [2025-03-08 11:07:59,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:07:59,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481388048] [2025-03-08 11:07:59,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:07:59,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:07:59,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 11:07:59,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 11:07:59,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:07:59,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 11:08:01,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:08:01,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481388048] [2025-03-08 11:08:01,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481388048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:08:01,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:08:01,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 11:08:01,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392979515] [2025-03-08 11:08:01,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:08:01,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 11:08:01,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:08:01,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 11:08:01,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:08:01,643 INFO L87 Difference]: Start difference. First operand 465 states and 724 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:08:02,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:08:02,067 INFO L93 Difference]: Finished difference Result 965 states and 1494 transitions. [2025-03-08 11:08:02,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 11:08:02,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 179 [2025-03-08 11:08:02,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:08:02,071 INFO L225 Difference]: With dead ends: 965 [2025-03-08 11:08:02,071 INFO L226 Difference]: Without dead ends: 591 [2025-03-08 11:08:02,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-08 11:08:02,073 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 173 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:08:02,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 447 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:08:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-08 11:08:02,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 477. [2025-03-08 11:08:02,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 336 states have (on average 1.3988095238095237) internal successors, (470), 336 states have internal predecessors, (470), 135 states have call successors, (135), 5 states have call predecessors, (135), 5 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-08 11:08:02,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 740 transitions. [2025-03-08 11:08:02,135 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 740 transitions. Word has length 179 [2025-03-08 11:08:02,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:08:02,135 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 740 transitions. [2025-03-08 11:08:02,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:08:02,135 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 740 transitions. [2025-03-08 11:08:02,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 11:08:02,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:08:02,137 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:08:02,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:08:02,137 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:08:02,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:08:02,137 INFO L85 PathProgramCache]: Analyzing trace with hash 892583771, now seen corresponding path program 1 times [2025-03-08 11:08:02,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:08:02,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102714396] [2025-03-08 11:08:02,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:02,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:08:02,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 11:08:02,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 11:08:02,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:02,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 11:08:07,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:08:07,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102714396] [2025-03-08 11:08:07,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102714396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:08:07,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:08:07,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 11:08:07,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115737275] [2025-03-08 11:08:07,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:08:07,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 11:08:07,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:08:07,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 11:08:07,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-08 11:08:07,773 INFO L87 Difference]: Start difference. First operand 477 states and 740 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:08:10,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:08:10,247 INFO L93 Difference]: Finished difference Result 1381 states and 2070 transitions. [2025-03-08 11:08:10,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 11:08:10,248 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 179 [2025-03-08 11:08:10,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:08:10,252 INFO L225 Difference]: With dead ends: 1381 [2025-03-08 11:08:10,252 INFO L226 Difference]: Without dead ends: 973 [2025-03-08 11:08:10,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2025-03-08 11:08:10,253 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 547 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:08:10,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 915 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 11:08:10,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2025-03-08 11:08:10,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 627. [2025-03-08 11:08:10,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 486 states have (on average 1.3991769547325104) internal successors, (680), 486 states have internal predecessors, (680), 135 states have call successors, (135), 5 states have call predecessors, (135), 5 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-08 11:08:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 950 transitions. [2025-03-08 11:08:10,303 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 950 transitions. Word has length 179 [2025-03-08 11:08:10,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:08:10,304 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 950 transitions. [2025-03-08 11:08:10,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:08:10,305 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 950 transitions. [2025-03-08 11:08:10,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 11:08:10,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:08:10,307 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:08:10,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:08:10,307 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:08:10,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:08:10,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1780087452, now seen corresponding path program 1 times [2025-03-08 11:08:10,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:08:10,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963670618] [2025-03-08 11:08:10,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:10,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:08:10,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 11:08:10,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 11:08:10,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:10,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:12,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 11:08:12,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:08:12,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963670618] [2025-03-08 11:08:12,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963670618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:08:12,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:08:12,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 11:08:12,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796981760] [2025-03-08 11:08:12,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:08:12,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 11:08:12,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:08:12,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 11:08:12,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:08:12,139 INFO L87 Difference]: Start difference. First operand 627 states and 950 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:08:13,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:08:13,138 INFO L93 Difference]: Finished difference Result 1337 states and 2024 transitions. [2025-03-08 11:08:13,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 11:08:13,139 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 179 [2025-03-08 11:08:13,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:08:13,143 INFO L225 Difference]: With dead ends: 1337 [2025-03-08 11:08:13,144 INFO L226 Difference]: Without dead ends: 931 [2025-03-08 11:08:13,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-08 11:08:13,146 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 357 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 11:08:13,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 571 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 11:08:13,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-08 11:08:13,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 709. [2025-03-08 11:08:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 568 states have (on average 1.3767605633802817) internal successors, (782), 568 states have internal predecessors, (782), 135 states have call successors, (135), 5 states have call predecessors, (135), 5 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-08 11:08:13,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1052 transitions. [2025-03-08 11:08:13,195 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1052 transitions. Word has length 179 [2025-03-08 11:08:13,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:08:13,195 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 1052 transitions. [2025-03-08 11:08:13,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:08:13,195 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1052 transitions. [2025-03-08 11:08:13,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 11:08:13,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:08:13,200 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:08:13,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:08:13,201 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:08:13,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:08:13,201 INFO L85 PathProgramCache]: Analyzing trace with hash -914870692, now seen corresponding path program 1 times [2025-03-08 11:08:13,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:08:13,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092944769] [2025-03-08 11:08:13,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:13,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:08:13,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 11:08:13,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 11:08:13,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:13,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:14,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 11:08:14,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:08:14,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092944769] [2025-03-08 11:08:14,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092944769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:08:14,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:08:14,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 11:08:14,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127057269] [2025-03-08 11:08:14,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:08:14,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 11:08:14,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:08:14,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 11:08:14,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:08:14,338 INFO L87 Difference]: Start difference. First operand 709 states and 1052 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:08:15,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:08:15,074 INFO L93 Difference]: Finished difference Result 1321 states and 1964 transitions. [2025-03-08 11:08:15,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 11:08:15,075 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 179 [2025-03-08 11:08:15,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:08:15,079 INFO L225 Difference]: With dead ends: 1321 [2025-03-08 11:08:15,079 INFO L226 Difference]: Without dead ends: 911 [2025-03-08 11:08:15,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-08 11:08:15,081 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 276 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:08:15,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 634 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 11:08:15,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2025-03-08 11:08:15,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 705. [2025-03-08 11:08:15,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 564 states have (on average 1.3865248226950355) internal successors, (782), 564 states have internal predecessors, (782), 135 states have call successors, (135), 5 states have call predecessors, (135), 5 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-08 11:08:15,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1052 transitions. [2025-03-08 11:08:15,124 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1052 transitions. Word has length 179 [2025-03-08 11:08:15,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:08:15,125 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 1052 transitions. [2025-03-08 11:08:15,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:08:15,125 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1052 transitions. [2025-03-08 11:08:15,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 11:08:15,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:08:15,128 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:08:15,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:08:15,128 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:08:15,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:08:15,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1983263433, now seen corresponding path program 1 times [2025-03-08 11:08:15,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:08:15,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585987367] [2025-03-08 11:08:15,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:15,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:08:15,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 11:08:15,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 11:08:15,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:15,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:17,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 11:08:17,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:08:17,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585987367] [2025-03-08 11:08:17,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585987367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:08:17,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:08:17,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 11:08:17,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868895406] [2025-03-08 11:08:17,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:08:17,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 11:08:17,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:08:17,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 11:08:17,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-08 11:08:17,038 INFO L87 Difference]: Start difference. First operand 705 states and 1052 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:08:17,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:08:17,906 INFO L93 Difference]: Finished difference Result 1455 states and 2152 transitions. [2025-03-08 11:08:17,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 11:08:17,907 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 180 [2025-03-08 11:08:17,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:08:17,912 INFO L225 Difference]: With dead ends: 1455 [2025-03-08 11:08:17,912 INFO L226 Difference]: Without dead ends: 1081 [2025-03-08 11:08:17,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-08 11:08:17,914 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 419 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:08:17,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 760 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:08:17,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2025-03-08 11:08:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 753. [2025-03-08 11:08:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 608 states have (on average 1.3651315789473684) internal successors, (830), 608 states have internal predecessors, (830), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-08 11:08:17,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1100 transitions. [2025-03-08 11:08:17,959 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1100 transitions. Word has length 180 [2025-03-08 11:08:17,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:08:17,959 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1100 transitions. [2025-03-08 11:08:17,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:08:17,959 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1100 transitions. [2025-03-08 11:08:17,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 11:08:17,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:08:17,962 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:08:17,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:08:17,962 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:08:17,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:08:17,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1514009647, now seen corresponding path program 1 times [2025-03-08 11:08:17,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:08:17,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463798832] [2025-03-08 11:08:17,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:17,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:08:17,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 11:08:18,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 11:08:18,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:18,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:21,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 11:08:21,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:08:21,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463798832] [2025-03-08 11:08:21,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463798832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:08:21,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:08:21,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 11:08:21,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906598394] [2025-03-08 11:08:21,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:08:21,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 11:08:21,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:08:21,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 11:08:21,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-08 11:08:21,230 INFO L87 Difference]: Start difference. First operand 753 states and 1100 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:08:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:08:23,193 INFO L93 Difference]: Finished difference Result 1651 states and 2385 transitions. [2025-03-08 11:08:23,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 11:08:23,193 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 180 [2025-03-08 11:08:23,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:08:23,198 INFO L225 Difference]: With dead ends: 1651 [2025-03-08 11:08:23,198 INFO L226 Difference]: Without dead ends: 1051 [2025-03-08 11:08:23,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2025-03-08 11:08:23,200 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 409 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:08:23,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 890 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 11:08:23,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-03-08 11:08:23,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 835. [2025-03-08 11:08:23,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 690 states have (on average 1.373913043478261) internal successors, (948), 690 states have internal predecessors, (948), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-08 11:08:23,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1218 transitions. [2025-03-08 11:08:23,260 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1218 transitions. Word has length 180 [2025-03-08 11:08:23,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:08:23,261 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1218 transitions. [2025-03-08 11:08:23,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:08:23,262 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1218 transitions. [2025-03-08 11:08:23,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 11:08:23,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:08:23,264 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:08:23,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 11:08:23,265 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:08:23,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:08:23,265 INFO L85 PathProgramCache]: Analyzing trace with hash 973503186, now seen corresponding path program 1 times [2025-03-08 11:08:23,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:08:23,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594658316] [2025-03-08 11:08:23,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:23,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:08:23,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 11:08:23,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 11:08:23,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:23,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:27,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 11:08:27,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:08:27,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594658316] [2025-03-08 11:08:27,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594658316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:08:27,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:08:27,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 11:08:27,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829244393] [2025-03-08 11:08:27,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:08:27,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 11:08:27,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:08:27,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 11:08:27,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-08 11:08:27,276 INFO L87 Difference]: Start difference. First operand 835 states and 1218 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:08:29,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:08:29,169 INFO L93 Difference]: Finished difference Result 1461 states and 2111 transitions. [2025-03-08 11:08:29,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 11:08:29,169 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 180 [2025-03-08 11:08:29,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:08:29,173 INFO L225 Difference]: With dead ends: 1461 [2025-03-08 11:08:29,173 INFO L226 Difference]: Without dead ends: 1055 [2025-03-08 11:08:29,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2025-03-08 11:08:29,174 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 252 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:08:29,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 1095 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 11:08:29,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2025-03-08 11:08:29,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 819. [2025-03-08 11:08:29,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 674 states have (on average 1.3768545994065282) internal successors, (928), 674 states have internal predecessors, (928), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-08 11:08:29,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1198 transitions. [2025-03-08 11:08:29,220 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1198 transitions. Word has length 180 [2025-03-08 11:08:29,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:08:29,221 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1198 transitions. [2025-03-08 11:08:29,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:08:29,221 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1198 transitions. [2025-03-08 11:08:29,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 11:08:29,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:08:29,223 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:08:29,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 11:08:29,224 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:08:29,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:08:29,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1455902975, now seen corresponding path program 1 times [2025-03-08 11:08:29,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:08:29,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061178317] [2025-03-08 11:08:29,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:29,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:08:29,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 11:08:29,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 11:08:29,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:29,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 11:08:34,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:08:34,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061178317] [2025-03-08 11:08:34,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061178317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:08:34,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:08:34,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 11:08:34,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892397919] [2025-03-08 11:08:34,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:08:34,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 11:08:34,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:08:34,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 11:08:34,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-08 11:08:34,316 INFO L87 Difference]: Start difference. First operand 819 states and 1198 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:08:37,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:08:37,318 INFO L93 Difference]: Finished difference Result 1623 states and 2370 transitions. [2025-03-08 11:08:37,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 11:08:37,319 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-03-08 11:08:37,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:08:37,323 INFO L225 Difference]: With dead ends: 1623 [2025-03-08 11:08:37,323 INFO L226 Difference]: Without dead ends: 1217 [2025-03-08 11:08:37,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=237, Invalid=885, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 11:08:37,324 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 411 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:08:37,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 864 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 11:08:37,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2025-03-08 11:08:37,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 815. [2025-03-08 11:08:37,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 670 states have (on average 1.3791044776119403) internal successors, (924), 670 states have internal predecessors, (924), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-08 11:08:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1194 transitions. [2025-03-08 11:08:37,375 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1194 transitions. Word has length 181 [2025-03-08 11:08:37,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:08:37,375 INFO L471 AbstractCegarLoop]: Abstraction has 815 states and 1194 transitions. [2025-03-08 11:08:37,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:08:37,375 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1194 transitions. [2025-03-08 11:08:37,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 11:08:37,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:08:37,377 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:08:37,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 11:08:37,377 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:08:37,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:08:37,377 INFO L85 PathProgramCache]: Analyzing trace with hash -976107616, now seen corresponding path program 1 times [2025-03-08 11:08:37,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:08:37,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434316447] [2025-03-08 11:08:37,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:37,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:08:37,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 11:08:37,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 11:08:37,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:37,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:40,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 11:08:40,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:08:40,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434316447] [2025-03-08 11:08:40,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434316447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:08:40,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:08:40,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 11:08:40,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045290973] [2025-03-08 11:08:40,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:08:40,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 11:08:40,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:08:40,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 11:08:40,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 11:08:40,357 INFO L87 Difference]: Start difference. First operand 815 states and 1194 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:08:44,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:08:44,350 INFO L93 Difference]: Finished difference Result 1723 states and 2525 transitions. [2025-03-08 11:08:44,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 11:08:44,351 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-03-08 11:08:44,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:08:44,356 INFO L225 Difference]: With dead ends: 1723 [2025-03-08 11:08:44,356 INFO L226 Difference]: Without dead ends: 1305 [2025-03-08 11:08:44,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2025-03-08 11:08:44,358 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 353 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:08:44,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 640 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 11:08:44,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2025-03-08 11:08:44,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 871. [2025-03-08 11:08:44,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 726 states have (on average 1.3829201101928374) internal successors, (1004), 726 states have internal predecessors, (1004), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-08 11:08:44,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1274 transitions. [2025-03-08 11:08:44,406 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1274 transitions. Word has length 181 [2025-03-08 11:08:44,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:08:44,407 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1274 transitions. [2025-03-08 11:08:44,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:08:44,407 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1274 transitions. [2025-03-08 11:08:44,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 11:08:44,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:08:44,408 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:08:44,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 11:08:44,408 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:08:44,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:08:44,409 INFO L85 PathProgramCache]: Analyzing trace with hash 623901536, now seen corresponding path program 1 times [2025-03-08 11:08:44,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:08:44,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963642736] [2025-03-08 11:08:44,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:44,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:08:44,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 11:08:44,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 11:08:44,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:44,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:48,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 11:08:48,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:08:48,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963642736] [2025-03-08 11:08:48,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963642736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:08:48,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:08:48,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 11:08:48,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226315083] [2025-03-08 11:08:48,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:08:48,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 11:08:48,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:08:48,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 11:08:48,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:08:48,425 INFO L87 Difference]: Start difference. First operand 871 states and 1274 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:08:49,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:08:49,477 INFO L93 Difference]: Finished difference Result 1775 states and 2583 transitions. [2025-03-08 11:08:49,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 11:08:49,478 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-03-08 11:08:49,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:08:49,482 INFO L225 Difference]: With dead ends: 1775 [2025-03-08 11:08:49,482 INFO L226 Difference]: Without dead ends: 1171 [2025-03-08 11:08:49,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-03-08 11:08:49,483 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 382 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:08:49,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 684 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 11:08:49,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2025-03-08 11:08:49,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 879. [2025-03-08 11:08:49,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 734 states have (on average 1.3705722070844686) internal successors, (1006), 734 states have internal predecessors, (1006), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-08 11:08:49,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1276 transitions. [2025-03-08 11:08:49,529 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1276 transitions. Word has length 181 [2025-03-08 11:08:49,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:08:49,530 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1276 transitions. [2025-03-08 11:08:49,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:08:49,530 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1276 transitions. [2025-03-08 11:08:49,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 11:08:49,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:08:49,531 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:08:49,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 11:08:49,531 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:08:49,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:08:49,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1511405217, now seen corresponding path program 1 times [2025-03-08 11:08:49,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:08:49,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565055383] [2025-03-08 11:08:49,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:49,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:08:49,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 11:08:49,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 11:08:49,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:49,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:08:55,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 11:08:55,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:08:55,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565055383] [2025-03-08 11:08:55,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565055383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:08:55,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:08:55,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 11:08:55,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899558596] [2025-03-08 11:08:55,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:08:55,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 11:08:55,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:08:55,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 11:08:55,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-08 11:08:55,061 INFO L87 Difference]: Start difference. First operand 879 states and 1276 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:08:57,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:08:57,140 INFO L93 Difference]: Finished difference Result 1727 states and 2440 transitions. [2025-03-08 11:08:57,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 11:08:57,141 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-03-08 11:08:57,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:08:57,145 INFO L225 Difference]: With dead ends: 1727 [2025-03-08 11:08:57,145 INFO L226 Difference]: Without dead ends: 1277 [2025-03-08 11:08:57,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=171, Invalid=585, Unknown=0, NotChecked=0, Total=756 [2025-03-08 11:08:57,147 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 328 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:08:57,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 851 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 11:08:57,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2025-03-08 11:08:57,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 931. [2025-03-08 11:08:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 786 states have (on average 1.3638676844783715) internal successors, (1072), 786 states have internal predecessors, (1072), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-08 11:08:57,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1342 transitions. [2025-03-08 11:08:57,196 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1342 transitions. Word has length 181 [2025-03-08 11:08:57,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:08:57,196 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1342 transitions. [2025-03-08 11:08:57,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 11:08:57,197 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1342 transitions. [2025-03-08 11:08:57,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 11:08:57,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:08:57,198 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:08:57,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 11:08:57,198 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:08:57,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:08:57,199 INFO L85 PathProgramCache]: Analyzing trace with hash 399262388, now seen corresponding path program 1 times [2025-03-08 11:08:57,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:08:57,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010576286] [2025-03-08 11:08:57,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:08:57,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:08:57,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 11:08:57,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 11:08:57,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:08:57,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat