./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef5fa028017d876074069fbbea93055df8f895424627b4673992e11de8e7d01a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:54:39,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:54:39,241 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 22:54:39,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:54:39,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:54:39,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:54:39,262 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:54:39,263 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:54:39,263 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:54:39,263 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:54:39,264 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:54:39,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:54:39,264 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:54:39,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:54:39,264 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:54:39,265 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:54:39,265 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:54:39,265 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 22:54:39,265 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:54:39,265 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 22:54:39,265 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:54:39,265 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:54:39,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:54:39,266 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:54:39,266 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 22:54:39,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:54:39,266 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:54:39,266 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:54:39,266 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:54:39,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:54:39,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:54:39,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:54:39,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:54:39,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:54:39,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:54:39,267 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:54:39,267 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:54:39,267 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:54:39,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:54:39,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:54:39,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:54:39,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:54:39,267 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:54:39,267 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 -> ef5fa028017d876074069fbbea93055df8f895424627b4673992e11de8e7d01a [2025-03-16 22:54:39,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:54:39,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:54:39,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:54:39,486 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:54:39,486 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:54:39,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.i [2025-03-16 22:54:40,663 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4b83e036/a5caee8b70f94dd9b9092d2f038d7bb5/FLAG401c5888e [2025-03-16 22:54:40,889 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:54:40,891 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.i [2025-03-16 22:54:40,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4b83e036/a5caee8b70f94dd9b9092d2f038d7bb5/FLAG401c5888e [2025-03-16 22:54:41,220 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4b83e036/a5caee8b70f94dd9b9092d2f038d7bb5 [2025-03-16 22:54:41,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:54:41,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:54:41,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:54:41,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:54:41,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:54:41,227 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:54:41" (1/1) ... [2025-03-16 22:54:41,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6332adaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:54:41, skipping insertion in model container [2025-03-16 22:54:41,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:54:41" (1/1) ... [2025-03-16 22:54:41,240 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:54:41,336 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_codestructure_dependencies_file-34.i[919,932] [2025-03-16 22:54:41,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:54:41,379 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:54:41,388 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_codestructure_dependencies_file-34.i[919,932] [2025-03-16 22:54:41,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:54:41,437 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:54:41,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:54:41 WrapperNode [2025-03-16 22:54:41,439 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:54:41,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:54:41,440 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:54:41,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:54:41,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:54:41" (1/1) ... [2025-03-16 22:54:41,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:54:41" (1/1) ... [2025-03-16 22:54:41,489 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2025-03-16 22:54:41,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:54:41,490 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:54:41,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:54:41,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:54:41,497 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:54:41" (1/1) ... [2025-03-16 22:54:41,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:54:41" (1/1) ... [2025-03-16 22:54:41,500 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:54:41" (1/1) ... [2025-03-16 22:54:41,523 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-16 22:54:41,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:54:41" (1/1) ... [2025-03-16 22:54:41,523 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:54:41" (1/1) ... [2025-03-16 22:54:41,531 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:54:41" (1/1) ... [2025-03-16 22:54:41,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:54:41" (1/1) ... [2025-03-16 22:54:41,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:54:41" (1/1) ... [2025-03-16 22:54:41,534 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:54:41" (1/1) ... [2025-03-16 22:54:41,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:54:41,536 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:54:41,536 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:54:41,536 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:54:41,537 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:54:41" (1/1) ... [2025-03-16 22:54:41,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:54:41,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:54:41,563 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-16 22:54:41,565 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-16 22:54:41,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:54:41,581 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 22:54:41,581 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 22:54:41,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:54:41,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:54:41,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:54:41,637 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:54:41,638 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:54:41,867 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~bitwise13#1;havoc property_#t~ite15#1;havoc property_#t~bitwise14#1;havoc property_#t~short16#1; [2025-03-16 22:54:41,893 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-16 22:54:41,893 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:54:41,911 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:54:41,911 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:54:41,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:54:41 BoogieIcfgContainer [2025-03-16 22:54:41,913 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:54:41,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:54:41,915 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:54:41,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:54:41,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:54:41" (1/3) ... [2025-03-16 22:54:41,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a32888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:54:41, skipping insertion in model container [2025-03-16 22:54:41,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:54:41" (2/3) ... [2025-03-16 22:54:41,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a32888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:54:41, skipping insertion in model container [2025-03-16 22:54:41,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:54:41" (3/3) ... [2025-03-16 22:54:41,921 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-34.i [2025-03-16 22:54:41,932 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:54:41,933 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-34.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:54:41,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:54:41,976 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;@3f5a692c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:54:41,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:54:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 49 states have internal predecessors, (74), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-16 22:54:41,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 22:54:41,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:54:41,988 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:54:41,988 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:54:41,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:54:41,993 INFO L85 PathProgramCache]: Analyzing trace with hash 537307469, now seen corresponding path program 1 times [2025-03-16 22:54:41,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:54:41,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791517567] [2025-03-16 22:54:41,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:54:42,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:54:42,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 22:54:42,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 22:54:42,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:54:42,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:54:42,208 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-16 22:54:42,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:54:42,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791517567] [2025-03-16 22:54:42,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791517567] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:54:42,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043232470] [2025-03-16 22:54:42,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:54:42,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:54:42,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:54:42,213 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-16 22:54:42,214 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-16 22:54:42,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 22:54:42,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 22:54:42,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:54:42,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:54:42,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 22:54:42,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:54:42,330 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-16 22:54:42,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:54:42,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043232470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:54:42,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:54:42,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 22:54:42,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374434867] [2025-03-16 22:54:42,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:54:42,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 22:54:42,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:54:42,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 22:54:42,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 22:54:42,352 INFO L87 Difference]: Start difference. First operand has 64 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 49 states have internal predecessors, (74), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 22:54:42,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:54:42,375 INFO L93 Difference]: Finished difference Result 125 states and 211 transitions. [2025-03-16 22:54:42,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 22:54:42,377 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 89 [2025-03-16 22:54:42,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:54:42,384 INFO L225 Difference]: With dead ends: 125 [2025-03-16 22:54:42,385 INFO L226 Difference]: Without dead ends: 62 [2025-03-16 22:54:42,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 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-16 22:54:42,388 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:54:42,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:54:42,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-16 22:54:42,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-16 22:54:42,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 47 states have internal predecessors, (70), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-16 22:54:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 96 transitions. [2025-03-16 22:54:42,421 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 96 transitions. Word has length 89 [2025-03-16 22:54:42,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:54:42,421 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 96 transitions. [2025-03-16 22:54:42,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 22:54:42,422 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 96 transitions. [2025-03-16 22:54:42,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 22:54:42,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:54:42,424 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:54:42,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 22:54:42,624 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-16 22:54:42,625 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:54:42,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:54:42,625 INFO L85 PathProgramCache]: Analyzing trace with hash -448232754, now seen corresponding path program 1 times [2025-03-16 22:54:42,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:54:42,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271324417] [2025-03-16 22:54:42,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:54:42,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:54:42,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 22:54:42,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 22:54:42,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:54:42,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:54:42,944 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-16 22:54:42,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:54:42,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271324417] [2025-03-16 22:54:42,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271324417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:54:42,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:54:42,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:54:42,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737365045] [2025-03-16 22:54:42,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:54:42,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:54:42,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:54:42,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:54:42,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:54:42,946 INFO L87 Difference]: Start difference. First operand 62 states and 96 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 22:54:43,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:54:43,075 INFO L93 Difference]: Finished difference Result 212 states and 329 transitions. [2025-03-16 22:54:43,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:54:43,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 89 [2025-03-16 22:54:43,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:54:43,077 INFO L225 Difference]: With dead ends: 212 [2025-03-16 22:54:43,077 INFO L226 Difference]: Without dead ends: 151 [2025-03-16 22:54:43,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:54:43,078 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 122 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:54:43,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 294 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:54:43,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-16 22:54:43,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 123. [2025-03-16 22:54:43,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 94 states have (on average 1.4787234042553192) internal successors, (139), 94 states have internal predecessors, (139), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-16 22:54:43,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 191 transitions. [2025-03-16 22:54:43,102 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 191 transitions. Word has length 89 [2025-03-16 22:54:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:54:43,102 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 191 transitions. [2025-03-16 22:54:43,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 22:54:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 191 transitions. [2025-03-16 22:54:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 22:54:43,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:54:43,105 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:54:43,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:54:43,105 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:54:43,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:54:43,106 INFO L85 PathProgramCache]: Analyzing trace with hash -35721337, now seen corresponding path program 1 times [2025-03-16 22:54:43,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:54:43,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270701413] [2025-03-16 22:54:43,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:54:43,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:54:43,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 22:54:43,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 22:54:43,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:54:43,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:54:43,325 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-16 22:54:43,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:54:43,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270701413] [2025-03-16 22:54:43,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270701413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:54:43,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:54:43,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:54:43,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725171011] [2025-03-16 22:54:43,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:54:43,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:54:43,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:54:43,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:54:43,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:54:43,326 INFO L87 Difference]: Start difference. First operand 123 states and 191 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 22:54:43,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:54:43,466 INFO L93 Difference]: Finished difference Result 398 states and 611 transitions. [2025-03-16 22:54:43,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:54:43,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2025-03-16 22:54:43,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:54:43,470 INFO L225 Difference]: With dead ends: 398 [2025-03-16 22:54:43,470 INFO L226 Difference]: Without dead ends: 276 [2025-03-16 22:54:43,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:54:43,472 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 155 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:54:43,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 249 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:54:43,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-16 22:54:43,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 125. [2025-03-16 22:54:43,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 96 states have internal predecessors, (139), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-16 22:54:43,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 191 transitions. [2025-03-16 22:54:43,499 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 191 transitions. Word has length 90 [2025-03-16 22:54:43,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:54:43,499 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 191 transitions. [2025-03-16 22:54:43,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 22:54:43,500 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 191 transitions. [2025-03-16 22:54:43,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 22:54:43,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:54:43,501 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:54:43,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:54:43,502 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:54:43,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:54:43,503 INFO L85 PathProgramCache]: Analyzing trace with hash -981279413, now seen corresponding path program 1 times [2025-03-16 22:54:43,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:54:43,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588870489] [2025-03-16 22:54:43,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:54:43,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:54:43,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 22:54:43,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 22:54:43,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:54:43,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:54:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-16 22:54:45,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:54:45,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588870489] [2025-03-16 22:54:45,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588870489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:54:45,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:54:45,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:54:45,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225329739] [2025-03-16 22:54:45,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:54:45,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 22:54:45,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:54:45,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 22:54:45,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:54:45,092 INFO L87 Difference]: Start difference. First operand 125 states and 191 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 22:54:45,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:54:45,389 INFO L93 Difference]: Finished difference Result 389 states and 589 transitions. [2025-03-16 22:54:45,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:54:45,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2025-03-16 22:54:45,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:54:45,391 INFO L225 Difference]: With dead ends: 389 [2025-03-16 22:54:45,391 INFO L226 Difference]: Without dead ends: 265 [2025-03-16 22:54:45,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:54:45,392 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 151 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:54:45,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 245 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:54:45,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-16 22:54:45,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 171. [2025-03-16 22:54:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 128 states have (on average 1.4296875) internal successors, (183), 128 states have internal predecessors, (183), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 22:54:45,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 261 transitions. [2025-03-16 22:54:45,416 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 261 transitions. Word has length 91 [2025-03-16 22:54:45,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:54:45,416 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 261 transitions. [2025-03-16 22:54:45,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 22:54:45,416 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 261 transitions. [2025-03-16 22:54:45,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 22:54:45,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:54:45,417 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:54:45,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:54:45,417 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:54:45,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:54:45,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1728563032, now seen corresponding path program 1 times [2025-03-16 22:54:45,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:54:45,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8981431] [2025-03-16 22:54:45,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:54:45,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:54:45,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 22:54:45,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 22:54:45,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:54:45,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:54:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-16 22:54:48,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:54:48,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8981431] [2025-03-16 22:54:48,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8981431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:54:48,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:54:48,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 22:54:48,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444417712] [2025-03-16 22:54:48,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:54:48,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:54:48,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:54:48,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:54:48,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:54:48,384 INFO L87 Difference]: Start difference. First operand 171 states and 261 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 22:54:49,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:54:49,035 INFO L93 Difference]: Finished difference Result 457 states and 687 transitions. [2025-03-16 22:54:49,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:54:49,036 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2025-03-16 22:54:49,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:54:49,037 INFO L225 Difference]: With dead ends: 457 [2025-03-16 22:54:49,037 INFO L226 Difference]: Without dead ends: 316 [2025-03-16 22:54:49,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-16 22:54:49,038 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 292 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:54:49,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 288 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:54:49,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-16 22:54:49,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 246. [2025-03-16 22:54:49,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 203 states have (on average 1.458128078817734) internal successors, (296), 203 states have internal predecessors, (296), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-16 22:54:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 374 transitions. [2025-03-16 22:54:49,074 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 374 transitions. Word has length 91 [2025-03-16 22:54:49,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:54:49,075 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 374 transitions. [2025-03-16 22:54:49,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 22:54:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 374 transitions. [2025-03-16 22:54:49,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 22:54:49,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:54:49,076 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:54:49,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 22:54:49,076 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:54:49,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:54:49,080 INFO L85 PathProgramCache]: Analyzing trace with hash 823593929, now seen corresponding path program 1 times [2025-03-16 22:54:49,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:54:49,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317935961] [2025-03-16 22:54:49,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:54:49,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:54:49,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 22:54:49,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 22:54:49,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:54:49,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:54:50,657 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-16 22:54:50,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:54:50,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317935961] [2025-03-16 22:54:50,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317935961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:54:50,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:54:50,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 22:54:50,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182380311] [2025-03-16 22:54:50,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:54:50,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 22:54:50,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:54:50,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 22:54:50,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:54:50,660 INFO L87 Difference]: Start difference. First operand 246 states and 374 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 22:54:51,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:54:51,461 INFO L93 Difference]: Finished difference Result 703 states and 1047 transitions. [2025-03-16 22:54:51,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 22:54:51,462 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2025-03-16 22:54:51,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:54:51,465 INFO L225 Difference]: With dead ends: 703 [2025-03-16 22:54:51,467 INFO L226 Difference]: Without dead ends: 579 [2025-03-16 22:54:51,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:54:51,468 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 299 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:54:51,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 463 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 22:54:51,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-03-16 22:54:51,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 366. [2025-03-16 22:54:51,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 316 states have (on average 1.4493670886075949) internal successors, (458), 317 states have internal predecessors, (458), 44 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-16 22:54:51,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 546 transitions. [2025-03-16 22:54:51,504 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 546 transitions. Word has length 91 [2025-03-16 22:54:51,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:54:51,505 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 546 transitions. [2025-03-16 22:54:51,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 22:54:51,505 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 546 transitions. [2025-03-16 22:54:51,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 22:54:51,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:54:51,508 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:54:51,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 22:54:51,508 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:54:51,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:54:51,508 INFO L85 PathProgramCache]: Analyzing trace with hash -852196694, now seen corresponding path program 1 times [2025-03-16 22:54:51,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:54:51,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435827004] [2025-03-16 22:54:51,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:54:51,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:54:51,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 22:54:51,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 22:54:51,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:54:51,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:54:51,695 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-16 22:54:51,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:54:51,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435827004] [2025-03-16 22:54:51,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435827004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:54:51,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:54:51,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:54:51,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759283268] [2025-03-16 22:54:51,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:54:51,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:54:51,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:54:51,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:54:51,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:54:51,697 INFO L87 Difference]: Start difference. First operand 366 states and 546 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 22:54:51,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:54:51,868 INFO L93 Difference]: Finished difference Result 623 states and 927 transitions. [2025-03-16 22:54:51,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:54:51,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2025-03-16 22:54:51,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:54:51,871 INFO L225 Difference]: With dead ends: 623 [2025-03-16 22:54:51,872 INFO L226 Difference]: Without dead ends: 366 [2025-03-16 22:54:51,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:54:51,874 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 75 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:54:51,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 213 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:54:51,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-16 22:54:51,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 325. [2025-03-16 22:54:51,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 275 states have (on average 1.4036363636363636) internal successors, (386), 276 states have internal predecessors, (386), 44 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-16 22:54:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 474 transitions. [2025-03-16 22:54:51,904 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 474 transitions. Word has length 91 [2025-03-16 22:54:51,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:54:51,904 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 474 transitions. [2025-03-16 22:54:51,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 22:54:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 474 transitions. [2025-03-16 22:54:51,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 22:54:51,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:54:51,906 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:54:51,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 22:54:51,906 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:54:51,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:54:51,907 INFO L85 PathProgramCache]: Analyzing trace with hash 318035304, now seen corresponding path program 1 times [2025-03-16 22:54:51,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:54:51,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893222120] [2025-03-16 22:54:51,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:54:51,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:54:51,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 22:54:51,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 22:54:51,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:54:51,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:54:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-16 22:54:53,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:54:53,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893222120] [2025-03-16 22:54:53,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893222120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:54:53,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:54:53,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 22:54:53,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973171054] [2025-03-16 22:54:53,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:54:53,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 22:54:53,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:54:53,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 22:54:53,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:54:53,330 INFO L87 Difference]: Start difference. First operand 325 states and 474 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 22:54:54,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:54:54,308 INFO L93 Difference]: Finished difference Result 592 states and 865 transitions. [2025-03-16 22:54:54,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 22:54:54,310 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2025-03-16 22:54:54,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:54:54,312 INFO L225 Difference]: With dead ends: 592 [2025-03-16 22:54:54,312 INFO L226 Difference]: Without dead ends: 484 [2025-03-16 22:54:54,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:54:54,313 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 271 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 22:54:54,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 824 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 22:54:54,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-16 22:54:54,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 369. [2025-03-16 22:54:54,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 310 states have (on average 1.4) internal successors, (434), 310 states have internal predecessors, (434), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-16 22:54:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 538 transitions. [2025-03-16 22:54:54,336 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 538 transitions. Word has length 91 [2025-03-16 22:54:54,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:54:54,336 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 538 transitions. [2025-03-16 22:54:54,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 22:54:54,336 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 538 transitions. [2025-03-16 22:54:54,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 22:54:54,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:54:54,337 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:54:54,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 22:54:54,337 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:54:54,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:54:54,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1059064863, now seen corresponding path program 1 times [2025-03-16 22:54:54,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:54:54,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806458820] [2025-03-16 22:54:54,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:54:54,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:54:54,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 22:54:54,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 22:54:54,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:54:54,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:55:17,569 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-16 22:55:17,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:55:17,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806458820] [2025-03-16 22:55:17,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806458820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:55:17,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:55:17,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 22:55:17,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899574179] [2025-03-16 22:55:17,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:55:17,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 22:55:17,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:55:17,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 22:55:17,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:55:17,570 INFO L87 Difference]: Start difference. First operand 369 states and 538 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 22:55:18,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-16 22:55:19,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:55:19,422 INFO L93 Difference]: Finished difference Result 794 states and 1161 transitions. [2025-03-16 22:55:19,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 22:55:19,422 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2025-03-16 22:55:19,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:55:19,424 INFO L225 Difference]: With dead ends: 794 [2025-03-16 22:55:19,424 INFO L226 Difference]: Without dead ends: 571 [2025-03-16 22:55:19,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-16 22:55:19,426 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 310 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:55:19,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 583 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 22:55:19,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-16 22:55:19,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 369. [2025-03-16 22:55:19,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 310 states have (on average 1.4) internal successors, (434), 310 states have internal predecessors, (434), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-16 22:55:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 538 transitions. [2025-03-16 22:55:19,448 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 538 transitions. Word has length 92 [2025-03-16 22:55:19,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:55:19,448 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 538 transitions. [2025-03-16 22:55:19,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 22:55:19,449 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 538 transitions. [2025-03-16 22:55:19,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 22:55:19,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:55:19,449 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:55:19,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 22:55:19,450 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:55:19,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:55:19,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1946568544, now seen corresponding path program 1 times [2025-03-16 22:55:19,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:55:19,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732885865] [2025-03-16 22:55:19,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:55:19,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:55:19,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 22:55:19,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 22:55:19,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:55:19,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:55:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-16 22:55:19,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:55:19,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732885865] [2025-03-16 22:55:19,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732885865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:55:19,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:55:19,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:55:19,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149227069] [2025-03-16 22:55:19,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:55:19,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 22:55:19,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:55:19,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 22:55:19,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 22:55:19,495 INFO L87 Difference]: Start difference. First operand 369 states and 538 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 22:55:19,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:55:19,565 INFO L93 Difference]: Finished difference Result 895 states and 1317 transitions. [2025-03-16 22:55:19,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 22:55:19,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2025-03-16 22:55:19,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:55:19,568 INFO L225 Difference]: With dead ends: 895 [2025-03-16 22:55:19,568 INFO L226 Difference]: Without dead ends: 612 [2025-03-16 22:55:19,571 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-16 22:55:19,572 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 36 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:55:19,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 178 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:55:19,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-03-16 22:55:19,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 530. [2025-03-16 22:55:19,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 471 states have (on average 1.4225053078556262) internal successors, (670), 471 states have internal predecessors, (670), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-16 22:55:19,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 774 transitions. [2025-03-16 22:55:19,599 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 774 transitions. Word has length 92 [2025-03-16 22:55:19,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:55:19,600 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 774 transitions. [2025-03-16 22:55:19,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 22:55:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 774 transitions. [2025-03-16 22:55:19,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 22:55:19,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:55:19,603 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:55:19,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 22:55:19,603 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:55:19,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:55:19,603 INFO L85 PathProgramCache]: Analyzing trace with hash 553506238, now seen corresponding path program 1 times [2025-03-16 22:55:19,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:55:19,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970774581] [2025-03-16 22:55:19,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:55:19,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:55:19,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 22:55:19,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 22:55:19,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:55:19,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:55:44,374 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-16 22:55:44,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:55:44,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970774581] [2025-03-16 22:55:44,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970774581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:55:44,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:55:44,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-16 22:55:44,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066475060] [2025-03-16 22:55:44,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:55:44,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 22:55:44,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:55:44,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 22:55:44,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-16 22:55:44,375 INFO L87 Difference]: Start difference. First operand 530 states and 774 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 22:55:46,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:55:46,050 INFO L93 Difference]: Finished difference Result 877 states and 1283 transitions. [2025-03-16 22:55:46,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 22:55:46,051 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2025-03-16 22:55:46,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:55:46,053 INFO L225 Difference]: With dead ends: 877 [2025-03-16 22:55:46,054 INFO L226 Difference]: Without dead ends: 663 [2025-03-16 22:55:46,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2025-03-16 22:55:46,056 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 387 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 22:55:46,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 711 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 22:55:46,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2025-03-16 22:55:46,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 530. [2025-03-16 22:55:46,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 471 states have (on average 1.4225053078556262) internal successors, (670), 471 states have internal predecessors, (670), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-16 22:55:46,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 774 transitions. [2025-03-16 22:55:46,087 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 774 transitions. Word has length 92 [2025-03-16 22:55:46,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:55:46,087 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 774 transitions. [2025-03-16 22:55:46,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 22:55:46,088 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 774 transitions. [2025-03-16 22:55:46,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 22:55:46,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:55:46,089 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:55:46,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 22:55:46,090 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:55:46,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:55:46,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1301894077, now seen corresponding path program 1 times [2025-03-16 22:55:46,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:55:46,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80835567] [2025-03-16 22:55:46,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:55:46,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:55:46,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 22:55:46,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 22:55:46,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:55:46,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:56:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-16 22:56:07,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:56:07,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80835567] [2025-03-16 22:56:07,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80835567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:56:07,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:56:07,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 22:56:07,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576197998] [2025-03-16 22:56:07,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:56:07,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 22:56:07,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:56:07,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 22:56:07,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:56:07,862 INFO L87 Difference]: Start difference. First operand 530 states and 774 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 22:56:08,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:56:08,306 INFO L93 Difference]: Finished difference Result 1061 states and 1563 transitions. [2025-03-16 22:56:08,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:56:08,309 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2025-03-16 22:56:08,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:56:08,312 INFO L225 Difference]: With dead ends: 1061 [2025-03-16 22:56:08,312 INFO L226 Difference]: Without dead ends: 733 [2025-03-16 22:56:08,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 22:56:08,313 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 244 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:56:08,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 611 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:56:08,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2025-03-16 22:56:08,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 516. [2025-03-16 22:56:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 457 states have (on average 1.4223194748358863) internal successors, (650), 457 states have internal predecessors, (650), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-16 22:56:08,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 754 transitions. [2025-03-16 22:56:08,341 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 754 transitions. Word has length 92 [2025-03-16 22:56:08,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:56:08,341 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 754 transitions. [2025-03-16 22:56:08,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 22:56:08,341 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 754 transitions. [2025-03-16 22:56:08,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 22:56:08,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:56:08,344 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 22:56:08,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 22:56:08,344 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:56:08,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:56:08,345 INFO L85 PathProgramCache]: Analyzing trace with hash 205657732, now seen corresponding path program 1 times [2025-03-16 22:56:08,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:56:08,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009220671] [2025-03-16 22:56:08,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:56:08,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:56:08,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 22:56:08,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 22:56:08,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:56:08,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat