./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-45.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-ci_file-45.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 bbb30f5a716e95823cb1372888b0a3f5fc4a46205d14c7acf98f1ada42093098 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:29:23,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:29:23,625 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:29:23,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:29:23,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:29:23,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:29:23,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:29:23,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:29:23,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:29:23,650 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:29:23,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:29:23,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:29:23,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:29:23,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:29:23,651 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:29:23,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:29:23,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:29:23,652 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:29:23,652 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:29:23,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:29:23,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:29:23,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:29:23,652 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:29:23,652 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:29:23,652 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:29:23,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:29:23,653 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:29:23,653 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:29:23,653 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:29:23,653 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:29:23,653 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:29:23,653 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:29:23,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:29:23,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:29:23,654 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:29:23,654 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:29:23,654 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:29:23,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:29:23,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:29:23,654 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:29:23,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:29:23,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:29:23,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:29:23,654 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 -> bbb30f5a716e95823cb1372888b0a3f5fc4a46205d14c7acf98f1ada42093098 [2025-03-03 20:29:23,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:29:23,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:29:23,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:29:23,877 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:29:23,877 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:29:23,878 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-ci_file-45.i [2025-03-03 20:29:25,017 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09c9f54f4/88357ea70f0d43ea8d99e890e2121ef0/FLAG0195dac04 [2025-03-03 20:29:25,252 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:29:25,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-45.i [2025-03-03 20:29:25,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09c9f54f4/88357ea70f0d43ea8d99e890e2121ef0/FLAG0195dac04 [2025-03-03 20:29:25,578 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09c9f54f4/88357ea70f0d43ea8d99e890e2121ef0 [2025-03-03 20:29:25,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:29:25,580 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:29:25,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:29:25,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:29:25,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:29:25,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:29:25" (1/1) ... [2025-03-03 20:29:25,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@492d8ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:29:25, skipping insertion in model container [2025-03-03 20:29:25,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:29:25" (1/1) ... [2025-03-03 20:29:25,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:29:25,691 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-ci_file-45.i[919,932] [2025-03-03 20:29:25,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:29:25,774 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:29:25,782 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-ci_file-45.i[919,932] [2025-03-03 20:29:25,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:29:25,837 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:29:25,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:29:25 WrapperNode [2025-03-03 20:29:25,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:29:25,839 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:29:25,839 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:29:25,839 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:29:25,843 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:29:25" (1/1) ... [2025-03-03 20:29:25,850 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:29:25" (1/1) ... [2025-03-03 20:29:25,883 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2025-03-03 20:29:25,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:29:25,884 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:29:25,884 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:29:25,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:29:25,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:29:25" (1/1) ... [2025-03-03 20:29:25,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:29:25" (1/1) ... [2025-03-03 20:29:25,895 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:29:25" (1/1) ... [2025-03-03 20:29:25,911 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:29:25,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:29:25" (1/1) ... [2025-03-03 20:29:25,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:29:25" (1/1) ... [2025-03-03 20:29:25,921 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:29:25" (1/1) ... [2025-03-03 20:29:25,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:29:25" (1/1) ... [2025-03-03 20:29:25,922 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:29:25" (1/1) ... [2025-03-03 20:29:25,923 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:29:25" (1/1) ... [2025-03-03 20:29:25,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:29:25,925 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:29:25,925 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:29:25,925 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:29:25,926 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:29:25" (1/1) ... [2025-03-03 20:29:25,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:29:25,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:29:25,953 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:29:25,958 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:29:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:29:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:29:25,971 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:29:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:29:25,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:29:25,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:29:26,035 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:29:26,037 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:29:26,304 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 20:29:26,304 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:29:26,311 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:29:26,311 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:29:26,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:29:26 BoogieIcfgContainer [2025-03-03 20:29:26,313 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:29:26,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:29:26,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:29:26,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:29:26,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:29:25" (1/3) ... [2025-03-03 20:29:26,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1397b869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:29:26, skipping insertion in model container [2025-03-03 20:29:26,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:29:25" (2/3) ... [2025-03-03 20:29:26,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1397b869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:29:26, skipping insertion in model container [2025-03-03 20:29:26,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:29:26" (3/3) ... [2025-03-03 20:29:26,322 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-45.i [2025-03-03 20:29:26,331 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:29:26,333 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-45.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:29:26,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:29:26,384 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;@53bec4ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:29:26,384 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:29:26,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 20:29:26,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 20:29:26,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:29:26,399 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:26,399 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:29:26,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:29:26,403 INFO L85 PathProgramCache]: Analyzing trace with hash 35698000, now seen corresponding path program 1 times [2025-03-03 20:29:26,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:29:26,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381945273] [2025-03-03 20:29:26,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:29:26,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:29:26,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 20:29:26,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 20:29:26,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:29:26,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:29:26,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-03 20:29:26,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:29:26,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381945273] [2025-03-03 20:29:26,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381945273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:29:26,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508858489] [2025-03-03 20:29:26,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:29:26,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:29:26,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:29:26,707 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:29:26,709 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:29:26,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 20:29:26,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 20:29:26,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:29:26,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:29:26,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:29:26,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:29:26,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-03 20:29:26,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:29:26,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508858489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:29:26,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:29:26,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:29:26,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542874165] [2025-03-03 20:29:26,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:29:26,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:29:26,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:29:26,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:29:26,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:29:26,904 INFO L87 Difference]: Start difference. First operand has 84 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 20:29:26,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:29:26,931 INFO L93 Difference]: Finished difference Result 162 states and 281 transitions. [2025-03-03 20:29:26,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:29:26,933 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 173 [2025-03-03 20:29:26,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:29:26,940 INFO L225 Difference]: With dead ends: 162 [2025-03-03 20:29:26,940 INFO L226 Difference]: Without dead ends: 81 [2025-03-03 20:29:26,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 174 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:29:26,946 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:29:26,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:29:26,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-03 20:29:26,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-03 20:29:26,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 20:29:26,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 124 transitions. [2025-03-03 20:29:26,987 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 124 transitions. Word has length 173 [2025-03-03 20:29:26,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:29:26,988 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 124 transitions. [2025-03-03 20:29:26,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 20:29:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 124 transitions. [2025-03-03 20:29:26,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 20:29:26,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:29:26,992 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:26,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 20:29:27,193 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:29:27,193 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:29:27,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:29:27,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1475615798, now seen corresponding path program 1 times [2025-03-03 20:29:27,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:29:27,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194731180] [2025-03-03 20:29:27,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:29:27,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:29:27,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 20:29:27,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 20:29:27,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:29:27,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:29:27,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 20:29:27,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:29:27,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194731180] [2025-03-03 20:29:27,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194731180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:29:27,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:29:27,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:29:27,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790871335] [2025-03-03 20:29:27,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:29:27,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:29:27,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:29:27,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:29:27,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:29:27,432 INFO L87 Difference]: Start difference. First operand 81 states and 124 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:29:27,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:29:27,481 INFO L93 Difference]: Finished difference Result 234 states and 360 transitions. [2025-03-03 20:29:27,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:29:27,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2025-03-03 20:29:27,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:29:27,485 INFO L225 Difference]: With dead ends: 234 [2025-03-03 20:29:27,485 INFO L226 Difference]: Without dead ends: 156 [2025-03-03 20:29:27,486 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:29:27,487 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 113 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:29:27,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 259 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:29:27,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-03 20:29:27,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2025-03-03 20:29:27,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 99 states have (on average 1.3232323232323233) internal successors, (131), 99 states have internal predecessors, (131), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 20:29:27,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 235 transitions. [2025-03-03 20:29:27,543 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 235 transitions. Word has length 173 [2025-03-03 20:29:27,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:29:27,543 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 235 transitions. [2025-03-03 20:29:27,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:29:27,544 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 235 transitions. [2025-03-03 20:29:27,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 20:29:27,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:29:27,545 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:27,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:29:27,546 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:29:27,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:29:27,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1908896121, now seen corresponding path program 1 times [2025-03-03 20:29:27,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:29:27,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263042570] [2025-03-03 20:29:27,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:29:27,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:29:27,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 20:29:27,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 20:29:27,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:29:27,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:29:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 20:29:27,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:29:27,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263042570] [2025-03-03 20:29:27,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263042570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:29:27,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:29:27,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:29:27,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902175520] [2025-03-03 20:29:27,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:29:27,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:29:27,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:29:27,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:29:27,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:29:27,691 INFO L87 Difference]: Start difference. First operand 154 states and 235 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:29:27,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:29:27,729 INFO L93 Difference]: Finished difference Result 353 states and 538 transitions. [2025-03-03 20:29:27,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:29:27,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-03-03 20:29:27,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:29:27,732 INFO L225 Difference]: With dead ends: 353 [2025-03-03 20:29:27,732 INFO L226 Difference]: Without dead ends: 202 [2025-03-03 20:29:27,733 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:29:27,734 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 33 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:29:27,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 254 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:29:27,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-03 20:29:27,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 174. [2025-03-03 20:29:27,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 119 states have (on average 1.3529411764705883) internal successors, (161), 119 states have internal predecessors, (161), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 20:29:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 265 transitions. [2025-03-03 20:29:27,747 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 265 transitions. Word has length 174 [2025-03-03 20:29:27,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:29:27,748 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 265 transitions. [2025-03-03 20:29:27,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:29:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 265 transitions. [2025-03-03 20:29:27,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 20:29:27,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:29:27,750 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:27,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:29:27,750 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:29:27,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:29:27,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1545171619, now seen corresponding path program 1 times [2025-03-03 20:29:27,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:29:27,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809267360] [2025-03-03 20:29:27,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:29:27,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:29:27,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 20:29:27,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 20:29:27,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:29:27,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:29:35,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 20:29:35,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:29:35,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809267360] [2025-03-03 20:29:35,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809267360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:29:35,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:29:35,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:29:35,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320403394] [2025-03-03 20:29:35,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:29:35,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:29:35,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:29:35,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:29:35,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:29:35,827 INFO L87 Difference]: Start difference. First operand 174 states and 265 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 20:29:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:29:37,587 INFO L93 Difference]: Finished difference Result 463 states and 698 transitions. [2025-03-03 20:29:37,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:29:37,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 174 [2025-03-03 20:29:37,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:29:37,590 INFO L225 Difference]: With dead ends: 463 [2025-03-03 20:29:37,590 INFO L226 Difference]: Without dead ends: 292 [2025-03-03 20:29:37,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:29:37,591 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 253 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:29:37,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 305 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 20:29:37,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-03 20:29:37,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 259. [2025-03-03 20:29:37,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 186 states have (on average 1.3763440860215055) internal successors, (256), 188 states have internal predecessors, (256), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 20:29:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 392 transitions. [2025-03-03 20:29:37,633 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 392 transitions. Word has length 174 [2025-03-03 20:29:37,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:29:37,634 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 392 transitions. [2025-03-03 20:29:37,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 20:29:37,634 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 392 transitions. [2025-03-03 20:29:37,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 20:29:37,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:29:37,637 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:37,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:29:37,637 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:29:37,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:29:37,637 INFO L85 PathProgramCache]: Analyzing trace with hash -262282844, now seen corresponding path program 1 times [2025-03-03 20:29:37,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:29:37,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096339617] [2025-03-03 20:29:37,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:29:37,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:29:37,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 20:29:37,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 20:29:37,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:29:37,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:29:47,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 20:29:47,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:29:47,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096339617] [2025-03-03 20:29:47,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096339617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:29:47,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:29:47,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:29:47,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909267005] [2025-03-03 20:29:47,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:29:47,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:29:47,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:29:47,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:29:47,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:29:47,490 INFO L87 Difference]: Start difference. First operand 259 states and 392 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:29:48,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:29:48,013 INFO L93 Difference]: Finished difference Result 706 states and 1062 transitions. [2025-03-03 20:29:48,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:29:48,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-03-03 20:29:48,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:29:48,018 INFO L225 Difference]: With dead ends: 706 [2025-03-03 20:29:48,018 INFO L226 Difference]: Without dead ends: 450 [2025-03-03 20:29:48,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:29:48,019 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 150 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:29:48,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 378 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:29:48,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-03-03 20:29:48,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 306. [2025-03-03 20:29:48,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 233 states have (on average 1.3948497854077253) internal successors, (325), 235 states have internal predecessors, (325), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 20:29:48,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 461 transitions. [2025-03-03 20:29:48,060 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 461 transitions. Word has length 174 [2025-03-03 20:29:48,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:29:48,061 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 461 transitions. [2025-03-03 20:29:48,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:29:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 461 transitions. [2025-03-03 20:29:48,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 20:29:48,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:29:48,062 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:48,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:29:48,062 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:29:48,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:29:48,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1034637442, now seen corresponding path program 1 times [2025-03-03 20:29:48,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:29:48,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107420182] [2025-03-03 20:29:48,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:29:48,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:29:48,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 20:29:48,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 20:29:48,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:29:48,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:29:48,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 20:29:48,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:29:48,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107420182] [2025-03-03 20:29:48,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107420182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:29:48,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:29:48,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:29:48,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108790131] [2025-03-03 20:29:48,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:29:48,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:29:48,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:29:48,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:29:48,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:29:48,866 INFO L87 Difference]: Start difference. First operand 306 states and 461 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 20:29:49,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:29:49,521 INFO L93 Difference]: Finished difference Result 771 states and 1153 transitions. [2025-03-03 20:29:49,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:29:49,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 174 [2025-03-03 20:29:49,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:29:49,526 INFO L225 Difference]: With dead ends: 771 [2025-03-03 20:29:49,526 INFO L226 Difference]: Without dead ends: 468 [2025-03-03 20:29:49,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:29:49,527 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 243 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:29:49,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 319 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:29:49,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-03 20:29:49,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 239. [2025-03-03 20:29:49,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 174 states have (on average 1.367816091954023) internal successors, (238), 175 states have internal predecessors, (238), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 20:29:49,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 358 transitions. [2025-03-03 20:29:49,561 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 358 transitions. Word has length 174 [2025-03-03 20:29:49,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:29:49,562 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 358 transitions. [2025-03-03 20:29:49,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 20:29:49,562 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 358 transitions. [2025-03-03 20:29:49,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 20:29:49,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:29:49,563 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:49,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:29:49,564 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:29:49,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:29:49,564 INFO L85 PathProgramCache]: Analyzing trace with hash -772817021, now seen corresponding path program 1 times [2025-03-03 20:29:49,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:29:49,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885688421] [2025-03-03 20:29:49,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:29:49,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:29:49,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 20:29:49,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 20:29:49,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:29:49,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:29:50,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 20:29:50,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:29:50,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885688421] [2025-03-03 20:29:50,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885688421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:29:50,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:29:50,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:29:50,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755876565] [2025-03-03 20:29:50,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:29:50,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:29:50,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:29:50,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:29:50,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:29:50,829 INFO L87 Difference]: Start difference. First operand 239 states and 358 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:29:51,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:29:51,137 INFO L93 Difference]: Finished difference Result 616 states and 916 transitions. [2025-03-03 20:29:51,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:29:51,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-03-03 20:29:51,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:29:51,140 INFO L225 Difference]: With dead ends: 616 [2025-03-03 20:29:51,140 INFO L226 Difference]: Without dead ends: 393 [2025-03-03 20:29:51,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:29:51,141 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 149 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:29:51,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 341 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:29:51,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-03 20:29:51,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 239. [2025-03-03 20:29:51,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 174 states have (on average 1.367816091954023) internal successors, (238), 175 states have internal predecessors, (238), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 20:29:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 358 transitions. [2025-03-03 20:29:51,173 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 358 transitions. Word has length 174 [2025-03-03 20:29:51,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:29:51,173 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 358 transitions. [2025-03-03 20:29:51,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:29:51,174 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 358 transitions. [2025-03-03 20:29:51,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 20:29:51,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:29:51,176 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:51,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:29:51,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:29:51,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:29:51,178 INFO L85 PathProgramCache]: Analyzing trace with hash 982481637, now seen corresponding path program 1 times [2025-03-03 20:29:51,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:29:51,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754309609] [2025-03-03 20:29:51,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:29:51,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:29:51,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 20:29:51,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 20:29:51,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:29:51,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:29:57,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 20:29:57,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:29:57,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754309609] [2025-03-03 20:29:57,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754309609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:29:57,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:29:57,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:29:57,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476927311] [2025-03-03 20:29:57,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:29:57,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:29:57,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:29:57,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:29:57,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:29:57,812 INFO L87 Difference]: Start difference. First operand 239 states and 358 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:29:58,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:29:58,736 INFO L93 Difference]: Finished difference Result 630 states and 932 transitions. [2025-03-03 20:29:58,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:29:58,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-03-03 20:29:58,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:29:58,740 INFO L225 Difference]: With dead ends: 630 [2025-03-03 20:29:58,740 INFO L226 Difference]: Without dead ends: 407 [2025-03-03 20:29:58,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:29:58,743 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 137 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 20:29:58,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 518 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 20:29:58,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-03 20:29:58,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 331. [2025-03-03 20:29:58,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 242 states have (on average 1.3553719008264462) internal successors, (328), 245 states have internal predecessors, (328), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 20:29:58,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 488 transitions. [2025-03-03 20:29:58,799 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 488 transitions. Word has length 174 [2025-03-03 20:29:58,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:29:58,799 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 488 transitions. [2025-03-03 20:29:58,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:29:58,800 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 488 transitions. [2025-03-03 20:29:58,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 20:29:58,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:29:58,801 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:58,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:29:58,801 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:29:58,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:29:58,804 INFO L85 PathProgramCache]: Analyzing trace with hash 471947460, now seen corresponding path program 1 times [2025-03-03 20:29:58,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:29:58,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474630254] [2025-03-03 20:29:58,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:29:58,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:29:58,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 20:29:58,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 20:29:58,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:29:58,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:29:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 20:29:59,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:29:59,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474630254] [2025-03-03 20:29:59,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474630254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:29:59,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:29:59,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:29:59,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207221958] [2025-03-03 20:29:59,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:29:59,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:29:59,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:29:59,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:29:59,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:29:59,600 INFO L87 Difference]: Start difference. First operand 331 states and 488 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:30:00,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:30:00,128 INFO L93 Difference]: Finished difference Result 715 states and 1049 transitions. [2025-03-03 20:30:00,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:30:00,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2025-03-03 20:30:00,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:30:00,131 INFO L225 Difference]: With dead ends: 715 [2025-03-03 20:30:00,131 INFO L226 Difference]: Without dead ends: 400 [2025-03-03 20:30:00,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:30:00,133 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 136 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:30:00,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 563 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:30:00,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-03-03 20:30:00,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 314. [2025-03-03 20:30:00,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 225 states have (on average 1.3466666666666667) internal successors, (303), 228 states have internal predecessors, (303), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 20:30:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 463 transitions. [2025-03-03 20:30:00,224 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 463 transitions. Word has length 174 [2025-03-03 20:30:00,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:30:00,224 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 463 transitions. [2025-03-03 20:30:00,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:30:00,224 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 463 transitions. [2025-03-03 20:30:00,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 20:30:00,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:30:00,226 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:00,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:30:00,226 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:30:00,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:30:00,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1258364483, now seen corresponding path program 1 times [2025-03-03 20:30:00,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:30:00,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032579364] [2025-03-03 20:30:00,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:30:00,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:30:00,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 20:30:00,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 20:30:00,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:30:00,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:30:00,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-03 20:30:00,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:30:00,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032579364] [2025-03-03 20:30:00,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032579364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:30:00,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:30:00,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:30:00,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037873626] [2025-03-03 20:30:00,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:30:00,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:30:00,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:30:00,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:30:00,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:30:00,487 INFO L87 Difference]: Start difference. First operand 314 states and 463 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:30:00,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:30:00,637 INFO L93 Difference]: Finished difference Result 758 states and 1093 transitions. [2025-03-03 20:30:00,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:30:00,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2025-03-03 20:30:00,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:30:00,642 INFO L225 Difference]: With dead ends: 758 [2025-03-03 20:30:00,642 INFO L226 Difference]: Without dead ends: 460 [2025-03-03 20:30:00,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:30:00,644 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 77 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:30:00,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 343 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:30:00,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-03-03 20:30:00,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 422. [2025-03-03 20:30:00,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 320 states have (on average 1.3375) internal successors, (428), 327 states have internal predecessors, (428), 88 states have call successors, (88), 13 states have call predecessors, (88), 13 states have return successors, (88), 81 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 20:30:00,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 604 transitions. [2025-03-03 20:30:00,720 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 604 transitions. Word has length 175 [2025-03-03 20:30:00,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:30:00,720 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 604 transitions. [2025-03-03 20:30:00,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 20:30:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 604 transitions. [2025-03-03 20:30:00,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 20:30:00,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:30:00,722 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:00,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:30:00,722 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:30:00,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:30:00,723 INFO L85 PathProgramCache]: Analyzing trace with hash 964961476, now seen corresponding path program 1 times [2025-03-03 20:30:00,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:30:00,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766398897] [2025-03-03 20:30:00,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:30:00,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:30:00,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 20:30:00,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 20:30:00,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:30:00,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat