./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-86.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 5d0383a4e6cd736ce942b7c7434972bd19bfcd72f59366bdeede374768e8834f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:46:25,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:46:25,761 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:46:25,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:46:25,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:46:25,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:46:25,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:46:25,793 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:46:25,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:46:25,794 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:46:25,794 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:46:25,794 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:46:25,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:46:25,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:46:25,795 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:46:25,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:46:25,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:46:25,795 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:46:25,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:46:25,796 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:46:25,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:46:25,796 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:46:25,796 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:46:25,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:46:25,796 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:46:25,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:46:25,796 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:46:25,796 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:46:25,796 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:46:25,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:46:25,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:46:25,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:46:25,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:46:25,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:46:25,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:46:25,797 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:46:25,797 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:46:25,798 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:46:25,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:46:25,798 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:46:25,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:46:25,798 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:46:25,798 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:46:25,798 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 -> 5d0383a4e6cd736ce942b7c7434972bd19bfcd72f59366bdeede374768e8834f [2025-03-03 20:46:26,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:46:26,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:46:26,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:46:26,035 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:46:26,035 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:46:26,036 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-86.i [2025-03-03 20:46:27,224 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3435f6d4e/ad1c20aa4e994e3380ee083aa4bb02fb/FLAGd7791db68 [2025-03-03 20:46:27,446 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:46:27,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-86.i [2025-03-03 20:46:27,473 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3435f6d4e/ad1c20aa4e994e3380ee083aa4bb02fb/FLAGd7791db68 [2025-03-03 20:46:27,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3435f6d4e/ad1c20aa4e994e3380ee083aa4bb02fb [2025-03-03 20:46:27,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:46:27,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:46:27,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:46:27,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:46:27,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:46:27,807 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:46:27" (1/1) ... [2025-03-03 20:46:27,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c7d69b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:46:27, skipping insertion in model container [2025-03-03 20:46:27,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:46:27" (1/1) ... [2025-03-03 20:46:27,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:46:27,927 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_fillercodestructure_filler-pe-cn_file-86.i[919,932] [2025-03-03 20:46:27,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:46:27,999 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:46:28,007 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_fillercodestructure_filler-pe-cn_file-86.i[919,932] [2025-03-03 20:46:28,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:46:28,041 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:46:28,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:46:28 WrapperNode [2025-03-03 20:46:28,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:46:28,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:46:28,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:46:28,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:46:28,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:46:28" (1/1) ... [2025-03-03 20:46:28,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:46:28" (1/1) ... [2025-03-03 20:46:28,097 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2025-03-03 20:46:28,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:46:28,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:46:28,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:46:28,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:46:28,105 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:46:28" (1/1) ... [2025-03-03 20:46:28,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:46:28" (1/1) ... [2025-03-03 20:46:28,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:46:28" (1/1) ... [2025-03-03 20:46:28,133 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-03 20:46:28,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:46:28" (1/1) ... [2025-03-03 20:46:28,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:46:28" (1/1) ... [2025-03-03 20:46:28,141 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:46:28" (1/1) ... [2025-03-03 20:46:28,147 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:46:28" (1/1) ... [2025-03-03 20:46:28,148 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:46:28" (1/1) ... [2025-03-03 20:46:28,149 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:46:28" (1/1) ... [2025-03-03 20:46:28,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:46:28,156 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:46:28,158 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:46:28,158 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:46:28,159 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:46:28" (1/1) ... [2025-03-03 20:46:28,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:46:28,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:46:28,183 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-03 20:46:28,186 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-03 20:46:28,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:46:28,205 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:46:28,205 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:46:28,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:46:28,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:46:28,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:46:28,273 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:46:28,274 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:46:28,698 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-03 20:46:28,698 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:46:28,710 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:46:28,710 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:46:28,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:46:28 BoogieIcfgContainer [2025-03-03 20:46:28,711 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:46:28,712 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:46:28,712 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:46:28,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:46:28,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:46:27" (1/3) ... [2025-03-03 20:46:28,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8fb1dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:46:28, skipping insertion in model container [2025-03-03 20:46:28,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:46:28" (2/3) ... [2025-03-03 20:46:28,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8fb1dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:46:28, skipping insertion in model container [2025-03-03 20:46:28,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:46:28" (3/3) ... [2025-03-03 20:46:28,717 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-86.i [2025-03-03 20:46:28,726 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:46:28,728 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-86.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:46:28,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:46:28,771 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;@3df4c84d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:46:28,771 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:46:28,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 69 states have internal predecessors, (100), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 20:46:28,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 20:46:28,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:46:28,786 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:46:28,786 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:46:28,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:46:28,792 INFO L85 PathProgramCache]: Analyzing trace with hash -11174484, now seen corresponding path program 1 times [2025-03-03 20:46:28,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:46:28,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857303949] [2025-03-03 20:46:28,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:46:28,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:46:28,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 20:46:28,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 20:46:28,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:46:28,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:46:29,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-03 20:46:29,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:46:29,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857303949] [2025-03-03 20:46:29,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857303949] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:46:29,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254401373] [2025-03-03 20:46:29,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:46:29,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:46:29,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:46:29,076 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-03 20:46:29,077 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-03 20:46:29,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 20:46:29,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 20:46:29,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:46:29,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:46:29,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:46:29,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:46:29,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-03 20:46:29,250 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:46:29,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254401373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:46:29,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:46:29,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:46:29,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861989607] [2025-03-03 20:46:29,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:46:29,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:46:29,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:46:29,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:46:29,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:46:29,275 INFO L87 Difference]: Start difference. First operand has 102 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 69 states have internal predecessors, (100), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 20:46:29,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:46:29,313 INFO L93 Difference]: Finished difference Result 198 states and 350 transitions. [2025-03-03 20:46:29,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:46:29,316 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 196 [2025-03-03 20:46:29,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:46:29,320 INFO L225 Difference]: With dead ends: 198 [2025-03-03 20:46:29,322 INFO L226 Difference]: Without dead ends: 99 [2025-03-03 20:46:29,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 197 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-03 20:46:29,329 INFO L435 NwaCegarLoop]: 152 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, 152 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-03 20:46:29,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:46:29,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-03 20:46:29,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-03 20:46:29,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 20:46:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 156 transitions. [2025-03-03 20:46:29,370 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 156 transitions. Word has length 196 [2025-03-03 20:46:29,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:46:29,371 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 156 transitions. [2025-03-03 20:46:29,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 20:46:29,371 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 156 transitions. [2025-03-03 20:46:29,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 20:46:29,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:46:29,378 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:46:29,385 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-03 20:46:29,578 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-03 20:46:29,579 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:46:29,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:46:29,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1080847787, now seen corresponding path program 1 times [2025-03-03 20:46:29,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:46:29,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617448894] [2025-03-03 20:46:29,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:46:29,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:46:29,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 20:46:29,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 20:46:29,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:46:29,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:46:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 20:46:29,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:46:29,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617448894] [2025-03-03 20:46:29,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617448894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:46:29,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:46:29,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:46:29,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998514669] [2025-03-03 20:46:29,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:46:29,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:46:29,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:46:29,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:46:29,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:46:29,877 INFO L87 Difference]: Start difference. First operand 99 states and 156 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 20:46:29,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:46:29,917 INFO L93 Difference]: Finished difference Result 196 states and 311 transitions. [2025-03-03 20:46:29,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:46:29,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2025-03-03 20:46:29,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:46:29,920 INFO L225 Difference]: With dead ends: 196 [2025-03-03 20:46:29,920 INFO L226 Difference]: Without dead ends: 100 [2025-03-03 20:46:29,920 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-03 20:46:29,921 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:46:29,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 297 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:46:29,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-03 20:46:29,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-03 20:46:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 67 states have internal predecessors, (95), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 20:46:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 157 transitions. [2025-03-03 20:46:29,937 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 157 transitions. Word has length 196 [2025-03-03 20:46:29,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:46:29,939 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 157 transitions. [2025-03-03 20:46:29,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 20:46:29,940 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 157 transitions. [2025-03-03 20:46:29,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 20:46:29,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:46:29,944 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:46:29,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:46:29,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:46:29,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:46:29,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1968351468, now seen corresponding path program 1 times [2025-03-03 20:46:29,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:46:29,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362305604] [2025-03-03 20:46:29,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:46:29,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:46:29,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 20:46:30,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 20:46:30,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:46:30,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:46:30,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 20:46:30,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:46:30,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362305604] [2025-03-03 20:46:30,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362305604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:46:30,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:46:30,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:46:30,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563671402] [2025-03-03 20:46:30,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:46:30,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:46:30,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:46:30,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:46:30,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:46:30,274 INFO L87 Difference]: Start difference. First operand 100 states and 157 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 20:46:30,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:46:30,513 INFO L93 Difference]: Finished difference Result 295 states and 466 transitions. [2025-03-03 20:46:30,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:46:30,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2025-03-03 20:46:30,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:46:30,517 INFO L225 Difference]: With dead ends: 295 [2025-03-03 20:46:30,518 INFO L226 Difference]: Without dead ends: 198 [2025-03-03 20:46:30,519 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-03 20:46:30,521 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 116 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:46:30,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 516 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:46:30,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-03 20:46:30,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 153. [2025-03-03 20:46:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 88 states have internal predecessors, (116), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-03 20:46:30,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 240 transitions. [2025-03-03 20:46:30,558 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 240 transitions. Word has length 196 [2025-03-03 20:46:30,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:46:30,560 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 240 transitions. [2025-03-03 20:46:30,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 20:46:30,560 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 240 transitions. [2025-03-03 20:46:30,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 20:46:30,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:46:30,562 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:46:30,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:46:30,562 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:46:30,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:46:30,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2115264915, now seen corresponding path program 1 times [2025-03-03 20:46:30,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:46:30,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97149426] [2025-03-03 20:46:30,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:46:30,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:46:30,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 20:46:30,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 20:46:30,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:46:30,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:46:38,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 20:46:38,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:46:38,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97149426] [2025-03-03 20:46:38,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97149426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:46:38,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:46:38,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 20:46:38,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318843113] [2025-03-03 20:46:38,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:46:38,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 20:46:38,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:46:38,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 20:46:38,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:46:38,939 INFO L87 Difference]: Start difference. First operand 153 states and 240 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 20:46:43,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:46:43,990 INFO L93 Difference]: Finished difference Result 442 states and 695 transitions. [2025-03-03 20:46:43,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 20:46:43,991 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2025-03-03 20:46:43,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:46:43,994 INFO L225 Difference]: With dead ends: 442 [2025-03-03 20:46:43,994 INFO L226 Difference]: Without dead ends: 345 [2025-03-03 20:46:43,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=221, Invalid=649, Unknown=0, NotChecked=0, Total=870 [2025-03-03 20:46:43,995 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 676 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:46:43,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1281 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 20:46:43,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-03 20:46:44,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 194. [2025-03-03 20:46:44,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 129 states have (on average 1.3953488372093024) internal successors, (180), 129 states have internal predecessors, (180), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-03 20:46:44,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 304 transitions. [2025-03-03 20:46:44,007 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 304 transitions. Word has length 196 [2025-03-03 20:46:44,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:46:44,008 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 304 transitions. [2025-03-03 20:46:44,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 20:46:44,008 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 304 transitions. [2025-03-03 20:46:44,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 20:46:44,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:46:44,017 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:46:44,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:46:44,017 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:46:44,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:46:44,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1182630028, now seen corresponding path program 1 times [2025-03-03 20:46:44,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:46:44,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391592135] [2025-03-03 20:46:44,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:46:44,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:46:44,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 20:46:44,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 20:46:44,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:46:44,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:46:44,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 20:46:44,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:46:44,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391592135] [2025-03-03 20:46:44,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391592135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:46:44,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:46:44,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:46:44,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871732816] [2025-03-03 20:46:44,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:46:44,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:46:44,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:46:44,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:46:44,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:46:44,080 INFO L87 Difference]: Start difference. First operand 194 states and 304 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 20:46:44,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:46:44,122 INFO L93 Difference]: Finished difference Result 387 states and 610 transitions. [2025-03-03 20:46:44,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:46:44,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2025-03-03 20:46:44,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:46:44,125 INFO L225 Difference]: With dead ends: 387 [2025-03-03 20:46:44,125 INFO L226 Difference]: Without dead ends: 290 [2025-03-03 20:46:44,126 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-03 20:46:44,126 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 148 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:46:44,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 340 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:46:44,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-03 20:46:44,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2025-03-03 20:46:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 191 states have (on average 1.3926701570680629) internal successors, (266), 191 states have internal predecessors, (266), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 20:46:44,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 452 transitions. [2025-03-03 20:46:44,149 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 452 transitions. Word has length 196 [2025-03-03 20:46:44,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:46:44,149 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 452 transitions. [2025-03-03 20:46:44,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 20:46:44,149 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 452 transitions. [2025-03-03 20:46:44,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 20:46:44,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:46:44,151 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:46:44,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:46:44,151 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:46:44,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:46:44,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1905095842, now seen corresponding path program 1 times [2025-03-03 20:46:44,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:46:44,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556785150] [2025-03-03 20:46:44,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:46:44,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:46:44,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 20:46:44,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 20:46:44,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:46:44,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:46:44,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 20:46:44,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:46:44,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556785150] [2025-03-03 20:46:44,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556785150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:46:44,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:46:44,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:46:44,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163783412] [2025-03-03 20:46:44,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:46:44,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:46:44,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:46:44,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:46:44,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:46:44,436 INFO L87 Difference]: Start difference. First operand 288 states and 452 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 20:46:44,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:46:44,499 INFO L93 Difference]: Finished difference Result 541 states and 854 transitions. [2025-03-03 20:46:44,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:46:44,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 197 [2025-03-03 20:46:44,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:46:44,501 INFO L225 Difference]: With dead ends: 541 [2025-03-03 20:46:44,501 INFO L226 Difference]: Without dead ends: 347 [2025-03-03 20:46:44,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:46:44,504 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 201 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:46:44,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 315 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:46:44,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-03 20:46:44,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 288. [2025-03-03 20:46:44,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 191 states have internal predecessors, (263), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 20:46:44,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 449 transitions. [2025-03-03 20:46:44,523 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 449 transitions. Word has length 197 [2025-03-03 20:46:44,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:46:44,524 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 449 transitions. [2025-03-03 20:46:44,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 20:46:44,524 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 449 transitions. [2025-03-03 20:46:44,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 20:46:44,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:46:44,526 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:46:44,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:46:44,526 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:46:44,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:46:44,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1399537217, now seen corresponding path program 1 times [2025-03-03 20:46:44,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:46:44,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664283896] [2025-03-03 20:46:44,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:46:44,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:46:44,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 20:46:44,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 20:46:44,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:46:44,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:46:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 20:46:47,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:46:47,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664283896] [2025-03-03 20:46:47,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664283896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:46:47,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:46:47,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 20:46:47,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038238610] [2025-03-03 20:46:47,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:46:47,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 20:46:47,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:46:47,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 20:46:47,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:46:47,016 INFO L87 Difference]: Start difference. First operand 288 states and 449 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 20:46:48,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:46:48,009 INFO L93 Difference]: Finished difference Result 658 states and 1021 transitions. [2025-03-03 20:46:48,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 20:46:48,010 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2025-03-03 20:46:48,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:46:48,012 INFO L225 Difference]: With dead ends: 658 [2025-03-03 20:46:48,012 INFO L226 Difference]: Without dead ends: 467 [2025-03-03 20:46:48,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2025-03-03 20:46:48,014 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 497 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:46:48,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 1587 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:46:48,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-03 20:46:48,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 287. [2025-03-03 20:46:48,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 190 states have (on average 1.3736842105263158) internal successors, (261), 190 states have internal predecessors, (261), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 20:46:48,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 447 transitions. [2025-03-03 20:46:48,040 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 447 transitions. Word has length 197 [2025-03-03 20:46:48,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:46:48,041 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 447 transitions. [2025-03-03 20:46:48,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 20:46:48,042 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 447 transitions. [2025-03-03 20:46:48,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 20:46:48,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:46:48,044 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:46:48,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:46:48,044 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:46:48,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:46:48,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1183956609, now seen corresponding path program 1 times [2025-03-03 20:46:48,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:46:48,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343015179] [2025-03-03 20:46:48,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:46:48,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:46:48,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 20:46:48,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 20:46:48,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:46:48,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:46:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 20:46:52,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:46:52,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343015179] [2025-03-03 20:46:52,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343015179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:46:52,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:46:52,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 20:46:52,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057402279] [2025-03-03 20:46:52,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:46:52,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 20:46:52,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:46:52,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 20:46:52,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-03 20:46:52,332 INFO L87 Difference]: Start difference. First operand 287 states and 447 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 20:46:55,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:46:55,639 INFO L93 Difference]: Finished difference Result 467 states and 719 transitions. [2025-03-03 20:46:55,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 20:46:55,639 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2025-03-03 20:46:55,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:46:55,642 INFO L225 Difference]: With dead ends: 467 [2025-03-03 20:46:55,642 INFO L226 Difference]: Without dead ends: 465 [2025-03-03 20:46:55,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2025-03-03 20:46:55,645 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 802 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:46:55,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 1571 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 20:46:55,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-03 20:46:55,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 290. [2025-03-03 20:46:55,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 193 states have (on average 1.3730569948186528) internal successors, (265), 193 states have internal predecessors, (265), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 20:46:55,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 451 transitions. [2025-03-03 20:46:55,672 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 451 transitions. Word has length 197 [2025-03-03 20:46:55,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:46:55,673 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 451 transitions. [2025-03-03 20:46:55,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 20:46:55,673 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 451 transitions. [2025-03-03 20:46:55,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 20:46:55,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:46:55,676 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:46:55,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:46:55,677 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:46:55,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:46:55,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1209890531, now seen corresponding path program 1 times [2025-03-03 20:46:55,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:46:55,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647658157] [2025-03-03 20:46:55,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:46:55,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:46:55,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 20:46:55,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 20:46:55,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:46:55,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:46:58,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 20:46:58,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:46:58,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647658157] [2025-03-03 20:46:58,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647658157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:46:58,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:46:58,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 20:46:58,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997093075] [2025-03-03 20:46:58,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:46:58,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 20:46:58,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:46:58,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 20:46:58,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:46:58,606 INFO L87 Difference]: Start difference. First operand 290 states and 451 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 20:47:01,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:47:01,025 INFO L93 Difference]: Finished difference Result 510 states and 782 transitions. [2025-03-03 20:47:01,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 20:47:01,026 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2025-03-03 20:47:01,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:47:01,028 INFO L225 Difference]: With dead ends: 510 [2025-03-03 20:47:01,028 INFO L226 Difference]: Without dead ends: 508 [2025-03-03 20:47:01,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=262, Invalid=668, Unknown=0, NotChecked=0, Total=930 [2025-03-03 20:47:01,029 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 510 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:47:01,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1699 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 20:47:01,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-03-03 20:47:01,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 325. [2025-03-03 20:47:01,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 228 states have (on average 1.4035087719298245) internal successors, (320), 228 states have internal predecessors, (320), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 20:47:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 506 transitions. [2025-03-03 20:47:01,055 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 506 transitions. Word has length 197 [2025-03-03 20:47:01,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:47:01,055 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 506 transitions. [2025-03-03 20:47:01,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 20:47:01,056 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 506 transitions. [2025-03-03 20:47:01,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 20:47:01,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:47:01,058 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:47:01,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:47:01,058 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:47:01,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:47:01,058 INFO L85 PathProgramCache]: Analyzing trace with hash 699356354, now seen corresponding path program 1 times [2025-03-03 20:47:01,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:47:01,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755901961] [2025-03-03 20:47:01,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:47:01,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:47:01,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 20:47:01,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 20:47:01,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:47:01,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:47:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 20:47:07,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:47:07,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755901961] [2025-03-03 20:47:07,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755901961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:47:07,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:47:07,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 20:47:07,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990776008] [2025-03-03 20:47:07,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:47:07,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 20:47:07,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:47:07,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 20:47:07,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-03 20:47:07,276 INFO L87 Difference]: Start difference. First operand 325 states and 506 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 20:47:14,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:47:14,346 INFO L93 Difference]: Finished difference Result 504 states and 776 transitions. [2025-03-03 20:47:14,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 20:47:14,346 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2025-03-03 20:47:14,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:47:14,349 INFO L225 Difference]: With dead ends: 504 [2025-03-03 20:47:14,349 INFO L226 Difference]: Without dead ends: 502 [2025-03-03 20:47:14,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=281, Invalid=711, Unknown=0, NotChecked=0, Total=992 [2025-03-03 20:47:14,349 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 726 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:47:14,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1235 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 20:47:14,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-03-03 20:47:14,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 325. [2025-03-03 20:47:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 228 states have (on average 1.4035087719298245) internal successors, (320), 228 states have internal predecessors, (320), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 20:47:14,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 506 transitions. [2025-03-03 20:47:14,366 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 506 transitions. Word has length 197 [2025-03-03 20:47:14,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:47:14,366 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 506 transitions. [2025-03-03 20:47:14,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 20:47:14,366 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 506 transitions. [2025-03-03 20:47:14,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 20:47:14,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:47:14,367 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:47:14,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:47:14,368 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:47:14,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:47:14,368 INFO L85 PathProgramCache]: Analyzing trace with hash 400727083, now seen corresponding path program 1 times [2025-03-03 20:47:14,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:47:14,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102917859] [2025-03-03 20:47:14,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:47:14,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:47:14,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 20:47:14,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 20:47:14,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:47:14,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:47:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 20:47:19,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:47:19,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102917859] [2025-03-03 20:47:19,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102917859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:47:19,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:47:19,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 20:47:19,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572710236] [2025-03-03 20:47:19,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:47:19,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 20:47:19,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:47:19,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 20:47:19,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:47:19,220 INFO L87 Difference]: Start difference. First operand 325 states and 506 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 20:47:23,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:47:23,147 INFO L93 Difference]: Finished difference Result 465 states and 718 transitions. [2025-03-03 20:47:23,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 20:47:23,148 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 198 [2025-03-03 20:47:23,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:47:23,150 INFO L225 Difference]: With dead ends: 465 [2025-03-03 20:47:23,150 INFO L226 Difference]: Without dead ends: 463 [2025-03-03 20:47:23,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=208, Invalid=722, Unknown=0, NotChecked=0, Total=930 [2025-03-03 20:47:23,152 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 594 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:47:23,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1683 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 20:47:23,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-03-03 20:47:23,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 322. [2025-03-03 20:47:23,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 225 states have (on average 1.4044444444444444) internal successors, (316), 225 states have internal predecessors, (316), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 20:47:23,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 502 transitions. [2025-03-03 20:47:23,174 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 502 transitions. Word has length 198 [2025-03-03 20:47:23,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:47:23,175 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 502 transitions. [2025-03-03 20:47:23,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 20:47:23,175 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 502 transitions. [2025-03-03 20:47:23,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 20:47:23,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:47:23,177 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:47:23,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:47:23,177 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:47:23,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:47:23,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1400140939, now seen corresponding path program 1 times [2025-03-03 20:47:23,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:47:23,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676434405] [2025-03-03 20:47:23,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:47:23,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:47:23,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 20:47:23,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 20:47:23,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:47:23,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:47:29,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 20:47:29,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:47:29,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676434405] [2025-03-03 20:47:29,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676434405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:47:29,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:47:29,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 20:47:29,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755215303] [2025-03-03 20:47:29,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:47:29,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 20:47:29,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:47:29,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 20:47:29,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-03 20:47:29,327 INFO L87 Difference]: Start difference. First operand 322 states and 502 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-03 20:47:36,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:47:36,131 INFO L93 Difference]: Finished difference Result 535 states and 824 transitions. [2025-03-03 20:47:36,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 20:47:36,132 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 198 [2025-03-03 20:47:36,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:47:36,134 INFO L225 Difference]: With dead ends: 535 [2025-03-03 20:47:36,134 INFO L226 Difference]: Without dead ends: 533 [2025-03-03 20:47:36,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 20:47:36,135 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 637 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1966 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 20:47:36,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1966 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 20:47:36,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-03 20:47:36,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 325. [2025-03-03 20:47:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 228 states have (on average 1.4035087719298245) internal successors, (320), 228 states have internal predecessors, (320), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 20:47:36,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 506 transitions. [2025-03-03 20:47:36,151 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 506 transitions. Word has length 198 [2025-03-03 20:47:36,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:47:36,151 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 506 transitions. [2025-03-03 20:47:36,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-03 20:47:36,151 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 506 transitions. [2025-03-03 20:47:36,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 20:47:36,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:47:36,152 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:47:36,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:47:36,153 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:47:36,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:47:36,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1054270168, now seen corresponding path program 1 times [2025-03-03 20:47:36,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:47:36,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735763629] [2025-03-03 20:47:36,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:47:36,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:47:36,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 20:47:36,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 20:47:36,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:47:36,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:47:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 20:47:39,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:47:39,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735763629] [2025-03-03 20:47:39,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735763629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:47:39,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:47:39,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 20:47:39,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992274568] [2025-03-03 20:47:39,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:47:39,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 20:47:39,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:47:39,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 20:47:39,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-03-03 20:47:39,905 INFO L87 Difference]: Start difference. First operand 325 states and 506 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 20:47:42,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:47:42,287 INFO L93 Difference]: Finished difference Result 533 states and 822 transitions. [2025-03-03 20:47:42,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 20:47:42,288 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2025-03-03 20:47:42,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:47:42,290 INFO L225 Difference]: With dead ends: 533 [2025-03-03 20:47:42,290 INFO L226 Difference]: Without dead ends: 531 [2025-03-03 20:47:42,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=293, Invalid=763, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 20:47:42,292 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 604 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:47:42,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 1774 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 20:47:42,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-03 20:47:42,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 328. [2025-03-03 20:47:42,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 231 states have (on average 1.4025974025974026) internal successors, (324), 231 states have internal predecessors, (324), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 20:47:42,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 510 transitions. [2025-03-03 20:47:42,309 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 510 transitions. Word has length 198 [2025-03-03 20:47:42,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:47:42,309 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 510 transitions. [2025-03-03 20:47:42,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-03 20:47:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 510 transitions. [2025-03-03 20:47:42,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 20:47:42,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:47:42,311 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:47:42,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:47:42,311 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:47:42,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:47:42,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1541516660, now seen corresponding path program 1 times [2025-03-03 20:47:42,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:47:42,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751142815] [2025-03-03 20:47:42,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:47:42,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:47:42,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 20:47:42,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 20:47:42,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:47:42,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:47:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-03 20:47:49,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:47:49,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751142815] [2025-03-03 20:47:49,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751142815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:47:49,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:47:49,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 20:47:49,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657585203] [2025-03-03 20:47:49,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:47:49,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 20:47:49,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:47:49,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 20:47:49,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:47:49,234 INFO L87 Difference]: Start difference. First operand 328 states and 510 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31)