./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal20.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal20.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 64bit --witnessprinter.graph.data.programhash 4dc4211f2b8131a829ff8e1fa12908da9356d5cadf0e7b793aab2903e0fde547 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 18:37:08,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 18:37:08,081 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 18:37:08,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 18:37:08,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 18:37:08,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 18:37:08,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 18:37:08,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 18:37:08,111 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 18:37:08,111 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 18:37:08,111 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 18:37:08,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 18:37:08,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 18:37:08,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 18:37:08,112 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 18:37:08,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 18:37:08,112 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 18:37:08,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 18:37:08,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 18:37:08,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 18:37:08,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 18:37:08,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 18:37:08,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 18:37:08,114 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 18:37:08,114 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 18:37:08,114 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 18:37:08,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 18:37:08,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 18:37:08,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 18:37:08,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:37:08,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 18:37:08,114 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 18:37:08,114 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 18:37:08,114 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 18:37:08,114 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 18:37:08,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 18:37:08,114 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 18:37:08,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 18:37:08,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 18:37:08,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 18:37:08,115 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-jdk21/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4dc4211f2b8131a829ff8e1fa12908da9356d5cadf0e7b793aab2903e0fde547 [2025-02-05 18:37:08,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 18:37:08,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 18:37:08,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 18:37:08,371 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 18:37:08,371 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 18:37:08,372 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal20.c [2025-02-05 18:37:09,596 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ceac1e5b/3e49e17cb97e4ec784b5889fe820937f/FLAGde671d6fc [2025-02-05 18:37:09,965 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 18:37:09,966 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal20.c [2025-02-05 18:37:09,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ceac1e5b/3e49e17cb97e4ec784b5889fe820937f/FLAGde671d6fc [2025-02-05 18:37:10,154 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ceac1e5b/3e49e17cb97e4ec784b5889fe820937f [2025-02-05 18:37:10,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 18:37:10,157 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 18:37:10,158 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 18:37:10,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 18:37:10,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 18:37:10,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:37:10" (1/1) ... [2025-02-05 18:37:10,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2078f7b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:10, skipping insertion in model container [2025-02-05 18:37:10,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:37:10" (1/1) ... [2025-02-05 18:37:10,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 18:37:10,353 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal20.c[1245,1258] [2025-02-05 18:37:10,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:37:10,609 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 18:37:10,619 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal20.c[1245,1258] [2025-02-05 18:37:10,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 18:37:10,787 INFO L204 MainTranslator]: Completed translation [2025-02-05 18:37:10,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:10 WrapperNode [2025-02-05 18:37:10,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 18:37:10,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 18:37:10,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 18:37:10,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 18:37:10,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:10" (1/1) ... [2025-02-05 18:37:10,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:10" (1/1) ... [2025-02-05 18:37:11,091 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3556 [2025-02-05 18:37:11,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 18:37:11,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 18:37:11,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 18:37:11,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 18:37:11,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:10" (1/1) ... [2025-02-05 18:37:11,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:10" (1/1) ... [2025-02-05 18:37:11,148 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:10" (1/1) ... [2025-02-05 18:37:11,288 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-02-05 18:37:11,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:10" (1/1) ... [2025-02-05 18:37:11,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:10" (1/1) ... [2025-02-05 18:37:11,379 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:10" (1/1) ... [2025-02-05 18:37:11,389 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:10" (1/1) ... [2025-02-05 18:37:11,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:10" (1/1) ... [2025-02-05 18:37:11,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:10" (1/1) ... [2025-02-05 18:37:11,503 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 18:37:11,504 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 18:37:11,504 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 18:37:11,504 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 18:37:11,505 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:10" (1/1) ... [2025-02-05 18:37:11,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 18:37:11,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 18:37:11,563 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 18:37:11,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 18:37:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 18:37:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 18:37:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 18:37:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 18:37:11,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 18:37:11,976 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 18:37:11,979 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 18:37:15,306 INFO L? ?]: Removed 1995 outVars from TransFormulas that were not future-live. [2025-02-05 18:37:15,307 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 18:37:15,416 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 18:37:15,416 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 18:37:15,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:37:15 BoogieIcfgContainer [2025-02-05 18:37:15,416 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 18:37:15,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 18:37:15,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 18:37:15,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 18:37:15,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 06:37:10" (1/3) ... [2025-02-05 18:37:15,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f42bcfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:37:15, skipping insertion in model container [2025-02-05 18:37:15,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:37:10" (2/3) ... [2025-02-05 18:37:15,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f42bcfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:37:15, skipping insertion in model container [2025-02-05 18:37:15,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:37:15" (3/3) ... [2025-02-05 18:37:15,423 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal20.c [2025-02-05 18:37:15,435 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 18:37:15,436 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal20.c that has 1 procedures, 1061 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 18:37:15,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 18:37:15,570 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;@2d05f436, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 18:37:15,570 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 18:37:15,576 INFO L276 IsEmpty]: Start isEmpty. Operand has 1061 states, 1059 states have (on average 1.5004721435316337) internal successors, (1589), 1060 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:15,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-05 18:37:15,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:37:15,597 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 18:37:15,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:37:15,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:37:15,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1541320656, now seen corresponding path program 1 times [2025-02-05 18:37:15,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:37:15,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124122436] [2025-02-05 18:37:15,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:37:15,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:37:15,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-05 18:37:16,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-05 18:37:16,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:37:16,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:37:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:37:17,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:37:17,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124122436] [2025-02-05 18:37:17,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124122436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:37:17,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:37:17,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:37:17,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545760948] [2025-02-05 18:37:17,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:37:17,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:37:17,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:37:17,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:37:17,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:37:17,891 INFO L87 Difference]: Start difference. First operand has 1061 states, 1059 states have (on average 1.5004721435316337) internal successors, (1589), 1060 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:18,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:37:18,724 INFO L93 Difference]: Finished difference Result 2091 states and 3135 transitions. [2025-02-05 18:37:18,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:37:18,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 333 [2025-02-05 18:37:18,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:37:18,748 INFO L225 Difference]: With dead ends: 2091 [2025-02-05 18:37:18,748 INFO L226 Difference]: Without dead ends: 1060 [2025-02-05 18:37:18,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:37:18,758 INFO L435 NwaCegarLoop]: 1321 mSDtfsCounter, 0 mSDsluCounter, 2637 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3958 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:37:18,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3958 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:37:18,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2025-02-05 18:37:18,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1060. [2025-02-05 18:37:18,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 1059 states have (on average 1.498583569405099) internal successors, (1587), 1059 states have internal predecessors, (1587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1587 transitions. [2025-02-05 18:37:18,837 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1587 transitions. Word has length 333 [2025-02-05 18:37:18,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:37:18,839 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1587 transitions. [2025-02-05 18:37:18,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:18,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1587 transitions. [2025-02-05 18:37:18,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-02-05 18:37:18,845 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:37:18,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 18:37:18,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 18:37:18,846 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:37:18,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:37:18,847 INFO L85 PathProgramCache]: Analyzing trace with hash -531620249, now seen corresponding path program 1 times [2025-02-05 18:37:18,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:37:18,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790043460] [2025-02-05 18:37:18,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:37:18,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:37:18,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-02-05 18:37:19,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-02-05 18:37:19,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:37:19,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:37:19,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:37:19,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:37:19,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790043460] [2025-02-05 18:37:19,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790043460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:37:19,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:37:19,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:37:19,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333819368] [2025-02-05 18:37:19,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:37:19,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:37:19,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:37:19,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:37:19,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:37:19,708 INFO L87 Difference]: Start difference. First operand 1060 states and 1587 transitions. Second operand has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:20,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:37:20,282 INFO L93 Difference]: Finished difference Result 2092 states and 3133 transitions. [2025-02-05 18:37:20,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:37:20,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 334 [2025-02-05 18:37:20,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:37:20,287 INFO L225 Difference]: With dead ends: 2092 [2025-02-05 18:37:20,287 INFO L226 Difference]: Without dead ends: 1062 [2025-02-05 18:37:20,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:37:20,289 INFO L435 NwaCegarLoop]: 1321 mSDtfsCounter, 0 mSDsluCounter, 2634 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3955 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:37:20,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3955 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 18:37:20,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2025-02-05 18:37:20,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1062. [2025-02-05 18:37:20,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 1061 states have (on average 1.4976437323279925) internal successors, (1589), 1061 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:20,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1589 transitions. [2025-02-05 18:37:20,309 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1589 transitions. Word has length 334 [2025-02-05 18:37:20,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:37:20,312 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1589 transitions. [2025-02-05 18:37:20,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:20,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1589 transitions. [2025-02-05 18:37:20,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-02-05 18:37:20,315 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:37:20,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 18:37:20,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 18:37:20,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:37:20,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:37:20,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1663815925, now seen corresponding path program 1 times [2025-02-05 18:37:20,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:37:20,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100238270] [2025-02-05 18:37:20,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:37:20,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:37:20,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-02-05 18:37:21,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-02-05 18:37:21,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:37:21,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:37:23,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:37:23,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:37:23,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100238270] [2025-02-05 18:37:23,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100238270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:37:23,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:37:23,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 18:37:23,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823727685] [2025-02-05 18:37:23,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:37:23,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:37:23,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:37:23,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:37:23,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:37:23,400 INFO L87 Difference]: Start difference. First operand 1062 states and 1589 transitions. Second operand has 6 states, 6 states have (on average 55.833333333333336) internal successors, (335), 6 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:24,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:37:24,289 INFO L93 Difference]: Finished difference Result 2734 states and 4091 transitions. [2025-02-05 18:37:24,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:37:24,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 55.833333333333336) internal successors, (335), 6 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 335 [2025-02-05 18:37:24,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:37:24,300 INFO L225 Difference]: With dead ends: 2734 [2025-02-05 18:37:24,301 INFO L226 Difference]: Without dead ends: 1702 [2025-02-05 18:37:24,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-05 18:37:24,305 INFO L435 NwaCegarLoop]: 1302 mSDtfsCounter, 4049 mSDsluCounter, 3907 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4049 SdHoareTripleChecker+Valid, 5209 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 18:37:24,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4049 Valid, 5209 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 18:37:24,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2025-02-05 18:37:24,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1683. [2025-02-05 18:37:24,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1682 states have (on average 1.4988109393579072) internal successors, (2521), 1682 states have internal predecessors, (2521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2521 transitions. [2025-02-05 18:37:24,358 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2521 transitions. Word has length 335 [2025-02-05 18:37:24,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:37:24,359 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2521 transitions. [2025-02-05 18:37:24,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.833333333333336) internal successors, (335), 6 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:24,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2521 transitions. [2025-02-05 18:37:24,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-02-05 18:37:24,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:37:24,365 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 18:37:24,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 18:37:24,365 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:37:24,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:37:24,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1849677068, now seen corresponding path program 1 times [2025-02-05 18:37:24,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:37:24,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130463222] [2025-02-05 18:37:24,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:37:24,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:37:24,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-02-05 18:37:25,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-02-05 18:37:25,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:37:25,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:37:26,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:37:26,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:37:26,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130463222] [2025-02-05 18:37:26,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130463222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:37:26,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:37:26,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 18:37:26,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832347278] [2025-02-05 18:37:26,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:37:26,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 18:37:26,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:37:26,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 18:37:26,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 18:37:26,434 INFO L87 Difference]: Start difference. First operand 1683 states and 2521 transitions. Second operand has 8 states, 8 states have (on average 42.0) internal successors, (336), 8 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:27,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:37:27,580 INFO L93 Difference]: Finished difference Result 2736 states and 4093 transitions. [2025-02-05 18:37:27,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 18:37:27,580 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 42.0) internal successors, (336), 8 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 336 [2025-02-05 18:37:27,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:37:27,586 INFO L225 Difference]: With dead ends: 2736 [2025-02-05 18:37:27,587 INFO L226 Difference]: Without dead ends: 1704 [2025-02-05 18:37:27,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-05 18:37:27,589 INFO L435 NwaCegarLoop]: 1301 mSDtfsCounter, 4052 mSDsluCounter, 6501 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4052 SdHoareTripleChecker+Valid, 7802 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 18:37:27,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4052 Valid, 7802 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 18:37:27,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2025-02-05 18:37:27,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1686. [2025-02-05 18:37:27,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1686 states, 1685 states have (on average 1.4985163204747773) internal successors, (2525), 1685 states have internal predecessors, (2525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 2525 transitions. [2025-02-05 18:37:27,625 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 2525 transitions. Word has length 336 [2025-02-05 18:37:27,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:37:27,625 INFO L471 AbstractCegarLoop]: Abstraction has 1686 states and 2525 transitions. [2025-02-05 18:37:27,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 42.0) internal successors, (336), 8 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:27,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 2525 transitions. [2025-02-05 18:37:27,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-02-05 18:37:27,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:37:27,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 18:37:27,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 18:37:27,629 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:37:27,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:37:27,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1168724522, now seen corresponding path program 1 times [2025-02-05 18:37:27,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:37:27,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490092660] [2025-02-05 18:37:27,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:37:27,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:37:27,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-02-05 18:37:28,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-02-05 18:37:28,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:37:28,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:37:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:37:30,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:37:30,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490092660] [2025-02-05 18:37:30,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490092660] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:37:30,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:37:30,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 18:37:30,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215442138] [2025-02-05 18:37:30,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:37:30,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 18:37:30,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:37:30,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 18:37:30,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 18:37:30,254 INFO L87 Difference]: Start difference. First operand 1686 states and 2525 transitions. Second operand has 9 states, 9 states have (on average 37.44444444444444) internal successors, (337), 9 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:31,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:37:31,559 INFO L93 Difference]: Finished difference Result 2736 states and 4092 transitions. [2025-02-05 18:37:31,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 18:37:31,560 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 37.44444444444444) internal successors, (337), 9 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 337 [2025-02-05 18:37:31,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:37:31,565 INFO L225 Difference]: With dead ends: 2736 [2025-02-05 18:37:31,565 INFO L226 Difference]: Without dead ends: 1704 [2025-02-05 18:37:31,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-02-05 18:37:31,569 INFO L435 NwaCegarLoop]: 1296 mSDtfsCounter, 4046 mSDsluCounter, 7774 mSDsCounter, 0 mSdLazyCounter, 2025 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4046 SdHoareTripleChecker+Valid, 9070 SdHoareTripleChecker+Invalid, 2026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 18:37:31,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4046 Valid, 9070 Invalid, 2026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2025 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 18:37:31,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2025-02-05 18:37:31,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1690. [2025-02-05 18:37:31,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1689 states have (on average 1.4979277679100058) internal successors, (2530), 1689 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:31,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2530 transitions. [2025-02-05 18:37:31,602 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2530 transitions. Word has length 337 [2025-02-05 18:37:31,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:37:31,602 INFO L471 AbstractCegarLoop]: Abstraction has 1690 states and 2530 transitions. [2025-02-05 18:37:31,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 37.44444444444444) internal successors, (337), 9 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:31,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2530 transitions. [2025-02-05 18:37:31,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-02-05 18:37:31,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:37:31,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 18:37:31,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 18:37:31,607 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:37:31,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:37:31,607 INFO L85 PathProgramCache]: Analyzing trace with hash -928227769, now seen corresponding path program 1 times [2025-02-05 18:37:31,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:37:31,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23823877] [2025-02-05 18:37:31,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:37:31,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:37:31,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-02-05 18:37:32,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-02-05 18:37:32,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:37:32,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:37:33,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:37:33,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:37:33,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23823877] [2025-02-05 18:37:33,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23823877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:37:33,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:37:33,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 18:37:33,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853469035] [2025-02-05 18:37:33,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:37:33,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 18:37:33,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:37:33,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 18:37:33,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 18:37:33,764 INFO L87 Difference]: Start difference. First operand 1690 states and 2530 transitions. Second operand has 8 states, 8 states have (on average 42.25) internal successors, (338), 8 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:35,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:37:35,244 INFO L93 Difference]: Finished difference Result 5298 states and 7936 transitions. [2025-02-05 18:37:35,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 18:37:35,244 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 42.25) internal successors, (338), 8 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 338 [2025-02-05 18:37:35,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:37:35,256 INFO L225 Difference]: With dead ends: 5298 [2025-02-05 18:37:35,256 INFO L226 Difference]: Without dead ends: 2634 [2025-02-05 18:37:35,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-02-05 18:37:35,260 INFO L435 NwaCegarLoop]: 1812 mSDtfsCounter, 5453 mSDsluCounter, 8469 mSDsCounter, 0 mSdLazyCounter, 2459 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5453 SdHoareTripleChecker+Valid, 10281 SdHoareTripleChecker+Invalid, 2503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:37:35,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5453 Valid, 10281 Invalid, 2503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2459 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 18:37:35,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2025-02-05 18:37:35,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2580. [2025-02-05 18:37:35,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2580 states, 2579 states have (on average 1.4990306320279179) internal successors, (3866), 2579 states have internal predecessors, (3866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:35,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 3866 transitions. [2025-02-05 18:37:35,295 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 3866 transitions. Word has length 338 [2025-02-05 18:37:35,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:37:35,296 INFO L471 AbstractCegarLoop]: Abstraction has 2580 states and 3866 transitions. [2025-02-05 18:37:35,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 42.25) internal successors, (338), 8 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:35,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 3866 transitions. [2025-02-05 18:37:35,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-02-05 18:37:35,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:37:35,300 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 18:37:35,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 18:37:35,300 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:37:35,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:37:35,301 INFO L85 PathProgramCache]: Analyzing trace with hash -2128272083, now seen corresponding path program 1 times [2025-02-05 18:37:35,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:37:35,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058469079] [2025-02-05 18:37:35,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:37:35,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:37:35,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-02-05 18:37:36,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-02-05 18:37:36,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:37:36,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:37:37,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:37:37,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:37:37,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058469079] [2025-02-05 18:37:37,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058469079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:37:37,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:37:37,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:37:37,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24970740] [2025-02-05 18:37:37,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:37:37,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:37:37,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:37:37,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:37:37,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:37:37,759 INFO L87 Difference]: Start difference. First operand 2580 states and 3866 transitions. Second operand has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:38,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:37:38,171 INFO L93 Difference]: Finished difference Result 4130 states and 6186 transitions. [2025-02-05 18:37:38,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:37:38,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 339 [2025-02-05 18:37:38,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:37:38,180 INFO L225 Difference]: With dead ends: 4130 [2025-02-05 18:37:38,180 INFO L226 Difference]: Without dead ends: 2580 [2025-02-05 18:37:38,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-05 18:37:38,184 INFO L435 NwaCegarLoop]: 1313 mSDtfsCounter, 873 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:37:38,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 3019 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 18:37:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2025-02-05 18:37:38,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2580. [2025-02-05 18:37:38,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2580 states, 2579 states have (on average 1.498255137650252) internal successors, (3864), 2579 states have internal predecessors, (3864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:38,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 3864 transitions. [2025-02-05 18:37:38,225 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 3864 transitions. Word has length 339 [2025-02-05 18:37:38,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:37:38,226 INFO L471 AbstractCegarLoop]: Abstraction has 2580 states and 3864 transitions. [2025-02-05 18:37:38,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:38,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 3864 transitions. [2025-02-05 18:37:38,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-02-05 18:37:38,231 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:37:38,231 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 18:37:38,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 18:37:38,231 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:37:38,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:37:38,233 INFO L85 PathProgramCache]: Analyzing trace with hash 232311083, now seen corresponding path program 1 times [2025-02-05 18:37:38,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:37:38,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644079259] [2025-02-05 18:37:38,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:37:38,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:37:38,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-02-05 18:37:39,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-02-05 18:37:39,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:37:39,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:37:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:37:40,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:37:40,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644079259] [2025-02-05 18:37:40,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644079259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:37:40,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:37:40,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:37:40,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652907643] [2025-02-05 18:37:40,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:37:40,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:37:40,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:37:40,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:37:40,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:37:40,315 INFO L87 Difference]: Start difference. First operand 2580 states and 3864 transitions. Second operand has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:41,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:37:41,114 INFO L93 Difference]: Finished difference Result 5664 states and 8479 transitions. [2025-02-05 18:37:41,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 18:37:41,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 340 [2025-02-05 18:37:41,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:37:41,121 INFO L225 Difference]: With dead ends: 5664 [2025-02-05 18:37:41,121 INFO L226 Difference]: Without dead ends: 2580 [2025-02-05 18:37:41,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 18:37:41,124 INFO L435 NwaCegarLoop]: 1816 mSDtfsCounter, 1737 mSDsluCounter, 3969 mSDsCounter, 0 mSdLazyCounter, 1422 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1737 SdHoareTripleChecker+Valid, 5785 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:37:41,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1737 Valid, 5785 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1422 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:37:41,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2025-02-05 18:37:41,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 1690. [2025-02-05 18:37:41,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1689 states have (on average 1.4955595026642985) internal successors, (2526), 1689 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2526 transitions. [2025-02-05 18:37:41,148 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2526 transitions. Word has length 340 [2025-02-05 18:37:41,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:37:41,148 INFO L471 AbstractCegarLoop]: Abstraction has 1690 states and 2526 transitions. [2025-02-05 18:37:41,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:41,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2526 transitions. [2025-02-05 18:37:41,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-02-05 18:37:41,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:37:41,150 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 18:37:41,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 18:37:41,152 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:37:41,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:37:41,153 INFO L85 PathProgramCache]: Analyzing trace with hash -495005286, now seen corresponding path program 1 times [2025-02-05 18:37:41,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:37:41,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864014786] [2025-02-05 18:37:41,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:37:41,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:37:41,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-02-05 18:37:42,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-02-05 18:37:42,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:37:42,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:37:43,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:37:43,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:37:43,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864014786] [2025-02-05 18:37:43,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864014786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:37:43,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:37:43,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 18:37:43,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691251004] [2025-02-05 18:37:43,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:37:43,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 18:37:43,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:37:43,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 18:37:43,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:37:43,331 INFO L87 Difference]: Start difference. First operand 1690 states and 2526 transitions. Second operand has 7 states, 7 states have (on average 48.57142857142857) internal successors, (340), 7 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:44,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:37:44,204 INFO L93 Difference]: Finished difference Result 2799 states and 4182 transitions. [2025-02-05 18:37:44,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 18:37:44,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 48.57142857142857) internal successors, (340), 7 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 340 [2025-02-05 18:37:44,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:37:44,209 INFO L225 Difference]: With dead ends: 2799 [2025-02-05 18:37:44,209 INFO L226 Difference]: Without dead ends: 1698 [2025-02-05 18:37:44,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 18:37:44,210 INFO L435 NwaCegarLoop]: 1078 mSDtfsCounter, 1299 mSDsluCounter, 3538 mSDsCounter, 0 mSdLazyCounter, 2190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 4616 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 18:37:44,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 4616 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2190 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 18:37:44,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2025-02-05 18:37:44,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1696. [2025-02-05 18:37:44,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1695 states have (on average 1.4938053097345132) internal successors, (2532), 1695 states have internal predecessors, (2532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:44,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2532 transitions. [2025-02-05 18:37:44,231 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2532 transitions. Word has length 340 [2025-02-05 18:37:44,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:37:44,231 INFO L471 AbstractCegarLoop]: Abstraction has 1696 states and 2532 transitions. [2025-02-05 18:37:44,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.57142857142857) internal successors, (340), 7 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:44,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2532 transitions. [2025-02-05 18:37:44,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-02-05 18:37:44,233 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:37:44,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 18:37:44,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 18:37:44,234 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:37:44,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:37:44,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1274148461, now seen corresponding path program 1 times [2025-02-05 18:37:44,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:37:44,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990534075] [2025-02-05 18:37:44,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:37:44,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:37:44,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-02-05 18:37:44,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-02-05 18:37:44,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:37:44,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:37:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:37:45,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:37:45,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990534075] [2025-02-05 18:37:45,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990534075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:37:45,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:37:45,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 18:37:45,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811984452] [2025-02-05 18:37:45,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:37:45,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 18:37:45,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:37:45,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 18:37:45,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 18:37:45,669 INFO L87 Difference]: Start difference. First operand 1696 states and 2532 transitions. Second operand has 8 states, 8 states have (on average 42.625) internal successors, (341), 8 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:37:46,393 INFO L93 Difference]: Finished difference Result 4708 states and 7027 transitions. [2025-02-05 18:37:46,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 18:37:46,394 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 42.625) internal successors, (341), 8 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 341 [2025-02-05 18:37:46,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:37:46,401 INFO L225 Difference]: With dead ends: 4708 [2025-02-05 18:37:46,402 INFO L226 Difference]: Without dead ends: 3160 [2025-02-05 18:37:46,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-05 18:37:46,407 INFO L435 NwaCegarLoop]: 1713 mSDtfsCounter, 3230 mSDsluCounter, 8145 mSDsCounter, 0 mSdLazyCounter, 2066 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3230 SdHoareTripleChecker+Valid, 9858 SdHoareTripleChecker+Invalid, 2067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:37:46,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3230 Valid, 9858 Invalid, 2067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2066 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:37:46,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3160 states. [2025-02-05 18:37:46,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3160 to 2754. [2025-02-05 18:37:46,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2754 states, 2753 states have (on average 1.4950962586269525) internal successors, (4116), 2753 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:46,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2754 states to 2754 states and 4116 transitions. [2025-02-05 18:37:46,457 INFO L78 Accepts]: Start accepts. Automaton has 2754 states and 4116 transitions. Word has length 341 [2025-02-05 18:37:46,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:37:46,458 INFO L471 AbstractCegarLoop]: Abstraction has 2754 states and 4116 transitions. [2025-02-05 18:37:46,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 42.625) internal successors, (341), 8 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:46,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2754 states and 4116 transitions. [2025-02-05 18:37:46,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-02-05 18:37:46,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:37:46,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 18:37:46,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 18:37:46,462 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:37:46,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:37:46,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1129093219, now seen corresponding path program 1 times [2025-02-05 18:37:46,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:37:46,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052346530] [2025-02-05 18:37:46,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:37:46,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:37:46,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-02-05 18:37:47,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-02-05 18:37:47,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:37:47,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:37:48,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:37:48,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:37:48,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052346530] [2025-02-05 18:37:48,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052346530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:37:48,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:37:48,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 18:37:48,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891055897] [2025-02-05 18:37:48,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:37:48,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 18:37:48,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:37:48,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 18:37:48,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:37:48,128 INFO L87 Difference]: Start difference. First operand 2754 states and 4116 transitions. Second operand has 7 states, 7 states have (on average 48.857142857142854) internal successors, (342), 7 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:48,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:37:48,987 INFO L93 Difference]: Finished difference Result 6447 states and 9640 transitions. [2025-02-05 18:37:48,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 18:37:48,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 48.857142857142854) internal successors, (342), 7 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 342 [2025-02-05 18:37:48,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:37:49,001 INFO L225 Difference]: With dead ends: 6447 [2025-02-05 18:37:49,001 INFO L226 Difference]: Without dead ends: 4624 [2025-02-05 18:37:49,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-05 18:37:49,004 INFO L435 NwaCegarLoop]: 1208 mSDtfsCounter, 2662 mSDsluCounter, 4788 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2662 SdHoareTripleChecker+Valid, 5996 SdHoareTripleChecker+Invalid, 2067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 18:37:49,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2662 Valid, 5996 Invalid, 2067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 18:37:49,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4624 states. [2025-02-05 18:37:49,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4624 to 4520. [2025-02-05 18:37:49,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4520 states, 4519 states have (on average 1.4967913255144945) internal successors, (6764), 4519 states have internal predecessors, (6764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:49,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4520 states to 4520 states and 6764 transitions. [2025-02-05 18:37:49,071 INFO L78 Accepts]: Start accepts. Automaton has 4520 states and 6764 transitions. Word has length 342 [2025-02-05 18:37:49,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:37:49,071 INFO L471 AbstractCegarLoop]: Abstraction has 4520 states and 6764 transitions. [2025-02-05 18:37:49,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.857142857142854) internal successors, (342), 7 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 4520 states and 6764 transitions. [2025-02-05 18:37:49,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-02-05 18:37:49,076 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:37:49,077 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 18:37:49,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 18:37:49,077 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:37:49,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:37:49,077 INFO L85 PathProgramCache]: Analyzing trace with hash -224691127, now seen corresponding path program 1 times [2025-02-05 18:37:49,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:37:49,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257307221] [2025-02-05 18:37:49,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:37:49,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:37:49,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-02-05 18:37:50,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-02-05 18:37:50,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:37:50,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:37:51,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:37:51,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:37:51,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257307221] [2025-02-05 18:37:51,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257307221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:37:51,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:37:51,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 18:37:51,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615905840] [2025-02-05 18:37:51,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:37:51,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 18:37:51,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:37:51,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 18:37:51,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 18:37:51,809 INFO L87 Difference]: Start difference. First operand 4520 states and 6764 transitions. Second operand has 8 states, 8 states have (on average 42.875) internal successors, (343), 8 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:53,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:37:53,312 INFO L93 Difference]: Finished difference Result 10162 states and 15201 transitions. [2025-02-05 18:37:53,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 18:37:53,312 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 42.875) internal successors, (343), 8 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 343 [2025-02-05 18:37:53,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:37:53,324 INFO L225 Difference]: With dead ends: 10162 [2025-02-05 18:37:53,324 INFO L226 Difference]: Without dead ends: 6858 [2025-02-05 18:37:53,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-05 18:37:53,329 INFO L435 NwaCegarLoop]: 1978 mSDtfsCounter, 2571 mSDsluCounter, 7792 mSDsCounter, 0 mSdLazyCounter, 4407 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2571 SdHoareTripleChecker+Valid, 9770 SdHoareTripleChecker+Invalid, 4408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:37:53,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2571 Valid, 9770 Invalid, 4408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4407 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 18:37:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6858 states. [2025-02-05 18:37:53,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6858 to 4520. [2025-02-05 18:37:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4520 states, 4519 states have (on average 1.4967913255144945) internal successors, (6764), 4519 states have internal predecessors, (6764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:53,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4520 states to 4520 states and 6764 transitions. [2025-02-05 18:37:53,380 INFO L78 Accepts]: Start accepts. Automaton has 4520 states and 6764 transitions. Word has length 343 [2025-02-05 18:37:53,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:37:53,380 INFO L471 AbstractCegarLoop]: Abstraction has 4520 states and 6764 transitions. [2025-02-05 18:37:53,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 42.875) internal successors, (343), 8 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:53,381 INFO L276 IsEmpty]: Start isEmpty. Operand 4520 states and 6764 transitions. [2025-02-05 18:37:53,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-02-05 18:37:53,384 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:37:53,384 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 18:37:53,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 18:37:53,384 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:37:53,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:37:53,385 INFO L85 PathProgramCache]: Analyzing trace with hash -30706399, now seen corresponding path program 1 times [2025-02-05 18:37:53,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:37:53,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432256376] [2025-02-05 18:37:53,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:37:53,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:37:53,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-02-05 18:37:55,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-02-05 18:37:55,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:37:55,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:37:55,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:37:55,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:37:55,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432256376] [2025-02-05 18:37:55,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432256376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:37:55,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:37:55,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 18:37:55,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072698812] [2025-02-05 18:37:55,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:37:55,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 18:37:55,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:37:55,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 18:37:55,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 18:37:55,710 INFO L87 Difference]: Start difference. First operand 4520 states and 6764 transitions. Second operand has 6 states, 6 states have (on average 57.166666666666664) internal successors, (343), 6 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:56,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:37:56,573 INFO L93 Difference]: Finished difference Result 13866 states and 20735 transitions. [2025-02-05 18:37:56,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:37:56,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 57.166666666666664) internal successors, (343), 6 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 343 [2025-02-05 18:37:56,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:37:56,597 INFO L225 Difference]: With dead ends: 13866 [2025-02-05 18:37:56,597 INFO L226 Difference]: Without dead ends: 11358 [2025-02-05 18:37:56,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:37:56,606 INFO L435 NwaCegarLoop]: 1684 mSDtfsCounter, 1453 mSDsluCounter, 5759 mSDsCounter, 0 mSdLazyCounter, 2060 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1453 SdHoareTripleChecker+Valid, 7443 SdHoareTripleChecker+Invalid, 2072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 18:37:56,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1453 Valid, 7443 Invalid, 2072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2060 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 18:37:56,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11358 states. [2025-02-05 18:37:56,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11358 to 8168. [2025-02-05 18:37:56,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8168 states, 8167 states have (on average 1.4955307946614425) internal successors, (12214), 8167 states have internal predecessors, (12214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8168 states to 8168 states and 12214 transitions. [2025-02-05 18:37:56,713 INFO L78 Accepts]: Start accepts. Automaton has 8168 states and 12214 transitions. Word has length 343 [2025-02-05 18:37:56,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:37:56,713 INFO L471 AbstractCegarLoop]: Abstraction has 8168 states and 12214 transitions. [2025-02-05 18:37:56,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.166666666666664) internal successors, (343), 6 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:56,714 INFO L276 IsEmpty]: Start isEmpty. Operand 8168 states and 12214 transitions. [2025-02-05 18:37:56,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-02-05 18:37:56,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:37:56,722 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 18:37:56,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 18:37:56,722 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:37:56,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:37:56,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1085537414, now seen corresponding path program 1 times [2025-02-05 18:37:56,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:37:56,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283558089] [2025-02-05 18:37:56,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:37:56,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:37:56,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-02-05 18:37:57,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-02-05 18:37:57,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:37:57,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:37:59,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:37:59,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:37:59,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283558089] [2025-02-05 18:37:59,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283558089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:37:59,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:37:59,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 18:37:59,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528437769] [2025-02-05 18:37:59,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:37:59,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 18:37:59,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:37:59,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 18:37:59,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 18:37:59,001 INFO L87 Difference]: Start difference. First operand 8168 states and 12214 transitions. Second operand has 9 states, 9 states have (on average 38.22222222222222) internal successors, (344), 9 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:37:59,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:37:59,898 INFO L93 Difference]: Finished difference Result 16630 states and 24854 transitions. [2025-02-05 18:37:59,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 18:37:59,901 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 38.22222222222222) internal successors, (344), 9 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 344 [2025-02-05 18:37:59,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:37:59,926 INFO L225 Difference]: With dead ends: 16630 [2025-02-05 18:37:59,926 INFO L226 Difference]: Without dead ends: 12318 [2025-02-05 18:37:59,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-02-05 18:37:59,935 INFO L435 NwaCegarLoop]: 1651 mSDtfsCounter, 3787 mSDsluCounter, 7991 mSDsCounter, 0 mSdLazyCounter, 2069 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3787 SdHoareTripleChecker+Valid, 9642 SdHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 18:37:59,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3787 Valid, 9642 Invalid, 2069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2069 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 18:37:59,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12318 states. [2025-02-05 18:38:00,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12318 to 11988. [2025-02-05 18:38:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11988 states, 11987 states have (on average 1.4947860181863686) internal successors, (17918), 11987 states have internal predecessors, (17918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:38:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11988 states to 11988 states and 17918 transitions. [2025-02-05 18:38:00,042 INFO L78 Accepts]: Start accepts. Automaton has 11988 states and 17918 transitions. Word has length 344 [2025-02-05 18:38:00,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:38:00,042 INFO L471 AbstractCegarLoop]: Abstraction has 11988 states and 17918 transitions. [2025-02-05 18:38:00,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 38.22222222222222) internal successors, (344), 9 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:38:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 11988 states and 17918 transitions. [2025-02-05 18:38:00,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-02-05 18:38:00,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:38:00,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 18:38:00,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 18:38:00,050 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:38:00,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:38:00,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1489929056, now seen corresponding path program 1 times [2025-02-05 18:38:00,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:38:00,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404259289] [2025-02-05 18:38:00,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:38:00,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:38:00,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-02-05 18:38:00,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-02-05 18:38:00,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:38:00,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:38:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:38:01,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:38:01,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404259289] [2025-02-05 18:38:01,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404259289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:38:01,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:38:01,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 18:38:01,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834413211] [2025-02-05 18:38:01,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:38:01,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 18:38:01,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:38:01,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 18:38:01,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 18:38:01,596 INFO L87 Difference]: Start difference. First operand 11988 states and 17918 transitions. Second operand has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:38:01,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:38:01,997 INFO L93 Difference]: Finished difference Result 18210 states and 27216 transitions. [2025-02-05 18:38:01,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 18:38:01,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 345 [2025-02-05 18:38:01,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:38:02,009 INFO L225 Difference]: With dead ends: 18210 [2025-02-05 18:38:02,009 INFO L226 Difference]: Without dead ends: 11988 [2025-02-05 18:38:02,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 18:38:02,019 INFO L435 NwaCegarLoop]: 1306 mSDtfsCounter, 1321 mSDsluCounter, 2621 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1321 SdHoareTripleChecker+Valid, 3927 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:38:02,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1321 Valid, 3927 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:38:02,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11988 states. [2025-02-05 18:38:02,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11988 to 8168. [2025-02-05 18:38:02,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8168 states, 8167 states have (on average 1.4952859066976858) internal successors, (12212), 8167 states have internal predecessors, (12212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:38:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8168 states to 8168 states and 12212 transitions. [2025-02-05 18:38:02,107 INFO L78 Accepts]: Start accepts. Automaton has 8168 states and 12212 transitions. Word has length 345 [2025-02-05 18:38:02,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:38:02,107 INFO L471 AbstractCegarLoop]: Abstraction has 8168 states and 12212 transitions. [2025-02-05 18:38:02,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:38:02,107 INFO L276 IsEmpty]: Start isEmpty. Operand 8168 states and 12212 transitions. [2025-02-05 18:38:02,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-02-05 18:38:02,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:38:02,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 18:38:02,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 18:38:02,113 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:38:02,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:38:02,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1636042778, now seen corresponding path program 1 times [2025-02-05 18:38:02,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:38:02,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129221749] [2025-02-05 18:38:02,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:38:02,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:38:02,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-02-05 18:38:03,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-02-05 18:38:03,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:38:03,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:38:03,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:38:03,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:38:03,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129221749] [2025-02-05 18:38:03,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129221749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:38:03,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:38:03,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 18:38:03,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427869285] [2025-02-05 18:38:03,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:38:03,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 18:38:03,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:38:03,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 18:38:03,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 18:38:03,918 INFO L87 Difference]: Start difference. First operand 8168 states and 12212 transitions. Second operand has 8 states, 8 states have (on average 43.125) internal successors, (345), 8 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:38:04,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:38:04,696 INFO L93 Difference]: Finished difference Result 12484 states and 18663 transitions. [2025-02-05 18:38:04,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 18:38:04,697 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 43.125) internal successors, (345), 8 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 345 [2025-02-05 18:38:04,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:38:04,703 INFO L225 Difference]: With dead ends: 12484 [2025-02-05 18:38:04,703 INFO L226 Difference]: Without dead ends: 8176 [2025-02-05 18:38:04,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-05 18:38:04,709 INFO L435 NwaCegarLoop]: 1187 mSDtfsCounter, 2597 mSDsluCounter, 4776 mSDsCounter, 0 mSdLazyCounter, 1948 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2597 SdHoareTripleChecker+Valid, 5963 SdHoareTripleChecker+Invalid, 1949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:38:04,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2597 Valid, 5963 Invalid, 1949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1948 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:38:04,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8176 states. [2025-02-05 18:38:04,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8176 to 8174. [2025-02-05 18:38:04,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8174 states, 8173 states have (on average 1.4949223051511074) internal successors, (12218), 8173 states have internal predecessors, (12218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:38:04,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8174 states to 8174 states and 12218 transitions. [2025-02-05 18:38:04,778 INFO L78 Accepts]: Start accepts. Automaton has 8174 states and 12218 transitions. Word has length 345 [2025-02-05 18:38:04,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:38:04,779 INFO L471 AbstractCegarLoop]: Abstraction has 8174 states and 12218 transitions. [2025-02-05 18:38:04,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 43.125) internal successors, (345), 8 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:38:04,780 INFO L276 IsEmpty]: Start isEmpty. Operand 8174 states and 12218 transitions. [2025-02-05 18:38:04,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-02-05 18:38:04,784 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:38:04,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 18:38:04,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 18:38:04,785 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:38:04,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:38:04,785 INFO L85 PathProgramCache]: Analyzing trace with hash -273726196, now seen corresponding path program 1 times [2025-02-05 18:38:04,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:38:04,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408020859] [2025-02-05 18:38:04,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:38:04,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:38:04,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-02-05 18:38:05,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-02-05 18:38:05,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:38:05,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:38:05,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:38:05,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:38:05,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408020859] [2025-02-05 18:38:05,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408020859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:38:05,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:38:05,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 18:38:05,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885296875] [2025-02-05 18:38:05,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:38:05,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 18:38:05,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:38:05,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 18:38:05,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:38:05,773 INFO L87 Difference]: Start difference. First operand 8174 states and 12218 transitions. Second operand has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:38:06,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:38:06,075 INFO L93 Difference]: Finished difference Result 12496 states and 18675 transitions. [2025-02-05 18:38:06,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 18:38:06,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 346 [2025-02-05 18:38:06,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:38:06,081 INFO L225 Difference]: With dead ends: 12496 [2025-02-05 18:38:06,081 INFO L226 Difference]: Without dead ends: 8180 [2025-02-05 18:38:06,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 18:38:06,086 INFO L435 NwaCegarLoop]: 1317 mSDtfsCounter, 0 mSDsluCounter, 2628 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3945 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:38:06,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3945 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 18:38:06,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8180 states. [2025-02-05 18:38:06,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8180 to 8180. [2025-02-05 18:38:06,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8180 states, 8179 states have (on average 1.4945592370705465) internal successors, (12224), 8179 states have internal predecessors, (12224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:38:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8180 states to 8180 states and 12224 transitions. [2025-02-05 18:38:06,148 INFO L78 Accepts]: Start accepts. Automaton has 8180 states and 12224 transitions. Word has length 346 [2025-02-05 18:38:06,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:38:06,149 INFO L471 AbstractCegarLoop]: Abstraction has 8180 states and 12224 transitions. [2025-02-05 18:38:06,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:38:06,149 INFO L276 IsEmpty]: Start isEmpty. Operand 8180 states and 12224 transitions. [2025-02-05 18:38:06,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-02-05 18:38:06,153 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:38:06,154 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 18:38:06,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 18:38:06,154 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:38:06,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:38:06,154 INFO L85 PathProgramCache]: Analyzing trace with hash -287285989, now seen corresponding path program 1 times [2025-02-05 18:38:06,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:38:06,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201159925] [2025-02-05 18:38:06,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:38:06,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:38:06,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-02-05 18:38:07,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-02-05 18:38:07,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:38:07,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:38:10,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:38:10,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:38:10,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201159925] [2025-02-05 18:38:10,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201159925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:38:10,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:38:10,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 18:38:10,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975071482] [2025-02-05 18:38:10,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:38:10,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 18:38:10,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:38:10,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 18:38:10,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-05 18:38:10,355 INFO L87 Difference]: Start difference. First operand 8180 states and 12224 transitions. Second operand has 10 states, 10 states have (on average 34.7) internal successors, (347), 10 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:38:11,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:38:11,100 INFO L93 Difference]: Finished difference Result 22018 states and 32908 transitions. [2025-02-05 18:38:11,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 18:38:11,100 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 34.7) internal successors, (347), 10 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 347 [2025-02-05 18:38:11,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:38:11,109 INFO L225 Difference]: With dead ends: 22018 [2025-02-05 18:38:11,109 INFO L226 Difference]: Without dead ends: 9532 [2025-02-05 18:38:11,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-05 18:38:11,120 INFO L435 NwaCegarLoop]: 1292 mSDtfsCounter, 2579 mSDsluCounter, 5353 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2579 SdHoareTripleChecker+Valid, 6645 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 18:38:11,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2579 Valid, 6645 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 18:38:11,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9532 states. [2025-02-05 18:38:11,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9532 to 9308. [2025-02-05 18:38:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9308 states, 9307 states have (on average 1.4947888685935318) internal successors, (13912), 9307 states have internal predecessors, (13912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:38:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9308 states to 9308 states and 13912 transitions. [2025-02-05 18:38:11,209 INFO L78 Accepts]: Start accepts. Automaton has 9308 states and 13912 transitions. Word has length 347 [2025-02-05 18:38:11,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:38:11,210 INFO L471 AbstractCegarLoop]: Abstraction has 9308 states and 13912 transitions. [2025-02-05 18:38:11,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 34.7) internal successors, (347), 10 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:38:11,210 INFO L276 IsEmpty]: Start isEmpty. Operand 9308 states and 13912 transitions. [2025-02-05 18:38:11,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-02-05 18:38:11,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:38:11,217 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 18:38:11,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 18:38:11,217 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:38:11,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:38:11,218 INFO L85 PathProgramCache]: Analyzing trace with hash -868301, now seen corresponding path program 1 times [2025-02-05 18:38:11,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:38:11,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860673951] [2025-02-05 18:38:11,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:38:11,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:38:11,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-02-05 18:38:12,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-02-05 18:38:12,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:38:12,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:38:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:38:13,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:38:13,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860673951] [2025-02-05 18:38:13,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860673951] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:38:13,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:38:13,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 18:38:13,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162269443] [2025-02-05 18:38:13,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:38:13,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 18:38:13,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:38:13,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 18:38:13,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 18:38:13,316 INFO L87 Difference]: Start difference. First operand 9308 states and 13912 transitions. Second operand has 8 states, 8 states have (on average 43.5) internal successors, (348), 8 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:38:14,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:38:14,779 INFO L93 Difference]: Finished difference Result 20746 states and 30980 transitions. [2025-02-05 18:38:14,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 18:38:14,780 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 43.5) internal successors, (348), 8 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 348 [2025-02-05 18:38:14,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:38:14,794 INFO L225 Difference]: With dead ends: 20746 [2025-02-05 18:38:14,794 INFO L226 Difference]: Without dead ends: 15850 [2025-02-05 18:38:14,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 18:38:14,805 INFO L435 NwaCegarLoop]: 943 mSDtfsCounter, 2128 mSDsluCounter, 4703 mSDsCounter, 0 mSdLazyCounter, 3871 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2128 SdHoareTripleChecker+Valid, 5646 SdHoareTripleChecker+Invalid, 3872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 18:38:14,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2128 Valid, 5646 Invalid, 3872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3871 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 18:38:14,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15850 states. [2025-02-05 18:38:14,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15850 to 15676. [2025-02-05 18:38:14,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15676 states, 15675 states have (on average 1.4940988835725677) internal successors, (23420), 15675 states have internal predecessors, (23420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:38:14,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15676 states to 15676 states and 23420 transitions. [2025-02-05 18:38:14,926 INFO L78 Accepts]: Start accepts. Automaton has 15676 states and 23420 transitions. Word has length 348 [2025-02-05 18:38:14,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:38:14,926 INFO L471 AbstractCegarLoop]: Abstraction has 15676 states and 23420 transitions. [2025-02-05 18:38:14,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 43.5) internal successors, (348), 8 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:38:14,926 INFO L276 IsEmpty]: Start isEmpty. Operand 15676 states and 23420 transitions. [2025-02-05 18:38:14,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-02-05 18:38:14,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:38:14,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 18:38:14,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 18:38:14,935 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:38:14,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:38:14,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1989314534, now seen corresponding path program 1 times [2025-02-05 18:38:14,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:38:14,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633392291] [2025-02-05 18:38:14,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:38:14,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:38:14,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-02-05 18:38:16,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-02-05 18:38:16,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:38:16,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:38:17,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:38:17,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:38:17,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633392291] [2025-02-05 18:38:17,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633392291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:38:17,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:38:17,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 18:38:17,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352324652] [2025-02-05 18:38:17,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:38:17,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 18:38:17,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:38:17,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 18:38:17,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-05 18:38:17,254 INFO L87 Difference]: Start difference. First operand 15676 states and 23420 transitions. Second operand has 9 states, 9 states have (on average 38.666666666666664) internal successors, (348), 9 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:38:18,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:38:18,876 INFO L93 Difference]: Finished difference Result 23917 states and 35712 transitions. [2025-02-05 18:38:18,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 18:38:18,877 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 38.666666666666664) internal successors, (348), 9 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 348 [2025-02-05 18:38:18,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:38:18,889 INFO L225 Difference]: With dead ends: 23917 [2025-02-05 18:38:18,890 INFO L226 Difference]: Without dead ends: 15848 [2025-02-05 18:38:18,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-05 18:38:18,899 INFO L435 NwaCegarLoop]: 1024 mSDtfsCounter, 4567 mSDsluCounter, 5026 mSDsCounter, 0 mSdLazyCounter, 4188 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4567 SdHoareTripleChecker+Valid, 6050 SdHoareTripleChecker+Invalid, 4190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 18:38:18,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4567 Valid, 6050 Invalid, 4190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4188 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 18:38:18,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15848 states. [2025-02-05 18:38:18,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15848 to 15676. [2025-02-05 18:38:19,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15676 states, 15675 states have (on average 1.4939712918660286) internal successors, (23418), 15675 states have internal predecessors, (23418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:38:19,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15676 states to 15676 states and 23418 transitions. [2025-02-05 18:38:19,016 INFO L78 Accepts]: Start accepts. Automaton has 15676 states and 23418 transitions. Word has length 348 [2025-02-05 18:38:19,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:38:19,017 INFO L471 AbstractCegarLoop]: Abstraction has 15676 states and 23418 transitions. [2025-02-05 18:38:19,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 38.666666666666664) internal successors, (348), 9 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:38:19,017 INFO L276 IsEmpty]: Start isEmpty. Operand 15676 states and 23418 transitions. [2025-02-05 18:38:19,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-02-05 18:38:19,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:38:19,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 18:38:19,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 18:38:19,025 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:38:19,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:38:19,026 INFO L85 PathProgramCache]: Analyzing trace with hash -550804242, now seen corresponding path program 1 times [2025-02-05 18:38:19,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:38:19,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907459006] [2025-02-05 18:38:19,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:38:19,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:38:19,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-02-05 18:38:20,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-02-05 18:38:20,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:38:20,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 18:38:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 18:38:20,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 18:38:20,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907459006] [2025-02-05 18:38:20,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907459006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 18:38:20,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 18:38:20,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 18:38:20,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152796978] [2025-02-05 18:38:20,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 18:38:20,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 18:38:20,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 18:38:20,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 18:38:20,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 18:38:20,795 INFO L87 Difference]: Start difference. First operand 15676 states and 23418 transitions. Second operand has 8 states, 8 states have (on average 43.5) internal successors, (348), 8 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:38:22,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 18:38:22,244 INFO L93 Difference]: Finished difference Result 30293 states and 45232 transitions. [2025-02-05 18:38:22,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 18:38:22,245 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 43.5) internal successors, (348), 8 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 348 [2025-02-05 18:38:22,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 18:38:22,268 INFO L225 Difference]: With dead ends: 30293 [2025-02-05 18:38:22,268 INFO L226 Difference]: Without dead ends: 22212 [2025-02-05 18:38:22,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 18:38:22,280 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 2122 mSDsluCounter, 7341 mSDsCounter, 0 mSdLazyCounter, 4077 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2122 SdHoareTripleChecker+Valid, 8911 SdHoareTripleChecker+Invalid, 4079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 18:38:22,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2122 Valid, 8911 Invalid, 4079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4077 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 18:38:22,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22212 states. [2025-02-05 18:38:22,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22212 to 22042. [2025-02-05 18:38:22,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22042 states, 22041 states have (on average 1.4936708860759493) internal successors, (32922), 22041 states have internal predecessors, (32922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:38:22,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22042 states to 22042 states and 32922 transitions. [2025-02-05 18:38:22,463 INFO L78 Accepts]: Start accepts. Automaton has 22042 states and 32922 transitions. Word has length 348 [2025-02-05 18:38:22,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 18:38:22,464 INFO L471 AbstractCegarLoop]: Abstraction has 22042 states and 32922 transitions. [2025-02-05 18:38:22,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 43.5) internal successors, (348), 8 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 18:38:22,464 INFO L276 IsEmpty]: Start isEmpty. Operand 22042 states and 32922 transitions. [2025-02-05 18:38:22,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-02-05 18:38:22,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 18:38:22,475 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 18:38:22,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 18:38:22,475 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 18:38:22,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 18:38:22,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1439378593, now seen corresponding path program 1 times [2025-02-05 18:38:22,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 18:38:22,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198919394] [2025-02-05 18:38:22,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 18:38:22,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 18:38:22,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-02-05 18:38:23,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-02-05 18:38:23,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 18:38:23,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat