./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ae5f6e98a9adcbdf5e1e7125ae4ea5d0cf3bfadfc22b5bc300cef6d9a8d4cfbb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:34:37,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:34:37,672 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:34:37,677 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:34:37,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:34:37,702 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:34:37,704 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:34:37,704 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:34:37,704 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:34:37,704 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:34:37,705 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:34:37,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:34:37,705 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:34:37,705 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:34:37,706 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:34:37,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:34:37,706 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:34:37,706 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:34:37,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:34:37,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:34:37,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:34:37,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:34:37,707 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:34:37,707 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:34:37,707 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:34:37,707 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:34:37,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:34:37,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:34:37,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:34:37,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:34:37,708 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:34:37,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:34:37,708 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:34:37,708 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:34:37,708 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:34:37,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:34:37,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:34:37,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:34:37,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:34:37,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:34:37,709 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae5f6e98a9adcbdf5e1e7125ae4ea5d0cf3bfadfc22b5bc300cef6d9a8d4cfbb [2025-03-03 17:34:37,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:34:37,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:34:37,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:34:37,938 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:34:37,938 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:34:37,940 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c [2025-03-03 17:34:39,101 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb83689bb/e6519915ba5340bcb9139ac4896a1510/FLAGc66e56593 [2025-03-03 17:34:39,376 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:34:39,377 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c [2025-03-03 17:34:39,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb83689bb/e6519915ba5340bcb9139ac4896a1510/FLAGc66e56593 [2025-03-03 17:34:39,663 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb83689bb/e6519915ba5340bcb9139ac4896a1510 [2025-03-03 17:34:39,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:34:39,667 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:34:39,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:34:39,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:34:39,672 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:34:39,673 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:34:39" (1/1) ... [2025-03-03 17:34:39,674 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a1a9c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:34:39, skipping insertion in model container [2025-03-03 17:34:39,674 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:34:39" (1/1) ... [2025-03-03 17:34:39,689 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:34:39,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c[1248,1261] [2025-03-03 17:34:39,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:34:39,914 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:34:39,923 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c[1248,1261] [2025-03-03 17:34:39,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:34:39,981 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:34:39,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:34:39 WrapperNode [2025-03-03 17:34:39,982 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:34:39,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:34:39,983 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:34:39,983 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:34:39,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:34:39" (1/1) ... [2025-03-03 17:34:40,001 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:34:39" (1/1) ... [2025-03-03 17:34:40,080 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 549 [2025-03-03 17:34:40,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:34:40,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:34:40,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:34:40,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:34:40,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:34:39" (1/1) ... [2025-03-03 17:34:40,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:34:39" (1/1) ... [2025-03-03 17:34:40,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:34:39" (1/1) ... [2025-03-03 17:34:40,128 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 17:34:40,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:34:39" (1/1) ... [2025-03-03 17:34:40,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:34:39" (1/1) ... [2025-03-03 17:34:40,152 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:34:39" (1/1) ... [2025-03-03 17:34:40,157 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:34:39" (1/1) ... [2025-03-03 17:34:40,171 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:34:39" (1/1) ... [2025-03-03 17:34:40,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:34:39" (1/1) ... [2025-03-03 17:34:40,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:34:40,186 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:34:40,187 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:34:40,187 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:34:40,188 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:34:39" (1/1) ... [2025-03-03 17:34:40,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:34:40,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:34:40,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 17:34:40,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 17:34:40,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:34:40,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:34:40,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:34:40,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:34:40,330 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:34:40,331 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:34:40,999 INFO L? ?]: Removed 359 outVars from TransFormulas that were not future-live. [2025-03-03 17:34:40,999 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:34:41,038 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:34:41,038 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:34:41,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:34:41 BoogieIcfgContainer [2025-03-03 17:34:41,039 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:34:41,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:34:41,040 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:34:41,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:34:41,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:34:39" (1/3) ... [2025-03-03 17:34:41,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54204d6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:34:41, skipping insertion in model container [2025-03-03 17:34:41,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:34:39" (2/3) ... [2025-03-03 17:34:41,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54204d6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:34:41, skipping insertion in model container [2025-03-03 17:34:41,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:34:41" (3/3) ... [2025-03-03 17:34:41,046 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Barrel.c [2025-03-03 17:34:41,057 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:34:41,059 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_Barrel.c that has 1 procedures, 158 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:34:41,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:34:41,112 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;@59c301f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:34:41,113 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:34:41,116 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 156 states have (on average 1.4935897435897436) internal successors, (233), 157 states have internal predecessors, (233), 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-03-03 17:34:41,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 17:34:41,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:34:41,123 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] [2025-03-03 17:34:41,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:34:41,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:34:41,127 INFO L85 PathProgramCache]: Analyzing trace with hash 925704785, now seen corresponding path program 1 times [2025-03-03 17:34:41,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:34:41,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814459663] [2025-03-03 17:34:41,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:34:41,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:34:41,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 17:34:41,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 17:34:41,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:34:41,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:34:42,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:34:42,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:34:42,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814459663] [2025-03-03 17:34:42,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814459663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:34:42,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:34:42,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:34:42,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9605335] [2025-03-03 17:34:42,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:34:42,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:34:42,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:34:42,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:34:42,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:34:42,040 INFO L87 Difference]: Start difference. First operand has 158 states, 156 states have (on average 1.4935897435897436) internal successors, (233), 157 states have internal predecessors, (233), 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 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-03-03 17:34:42,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:34:42,186 INFO L93 Difference]: Finished difference Result 297 states and 441 transitions. [2025-03-03 17:34:42,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:34:42,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2025-03-03 17:34:42,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:34:42,194 INFO L225 Difference]: With dead ends: 297 [2025-03-03 17:34:42,194 INFO L226 Difference]: Without dead ends: 157 [2025-03-03 17:34:42,196 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-03-03 17:34:42,198 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 0 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:34:42,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 565 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:34:42,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-03 17:34:42,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-03-03 17:34:42,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.4807692307692308) internal successors, (231), 156 states have internal predecessors, (231), 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-03-03 17:34:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 231 transitions. [2025-03-03 17:34:42,230 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 231 transitions. Word has length 79 [2025-03-03 17:34:42,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:34:42,232 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 231 transitions. [2025-03-03 17:34:42,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-03-03 17:34:42,233 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 231 transitions. [2025-03-03 17:34:42,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 17:34:42,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:34:42,234 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] [2025-03-03 17:34:42,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:34:42,236 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:34:42,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:34:42,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1363243592, now seen corresponding path program 1 times [2025-03-03 17:34:42,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:34:42,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336732233] [2025-03-03 17:34:42,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:34:42,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:34:42,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 17:34:42,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 17:34:42,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:34:42,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:34:42,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:34:42,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:34:42,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336732233] [2025-03-03 17:34:42,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336732233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:34:42,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:34:42,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:34:42,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642998082] [2025-03-03 17:34:42,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:34:42,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:34:42,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:34:42,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:34:42,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:34:42,543 INFO L87 Difference]: Start difference. First operand 157 states and 231 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-03-03 17:34:42,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:34:42,656 INFO L93 Difference]: Finished difference Result 298 states and 439 transitions. [2025-03-03 17:34:42,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:34:42,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 80 [2025-03-03 17:34:42,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:34:42,659 INFO L225 Difference]: With dead ends: 298 [2025-03-03 17:34:42,659 INFO L226 Difference]: Without dead ends: 159 [2025-03-03 17:34:42,659 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-03-03 17:34:42,660 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 0 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:34:42,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 562 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:34:42,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-03 17:34:42,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-03-03 17:34:42,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.4746835443037976) internal successors, (233), 158 states have internal predecessors, (233), 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-03-03 17:34:42,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 233 transitions. [2025-03-03 17:34:42,672 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 233 transitions. Word has length 80 [2025-03-03 17:34:42,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:34:42,672 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 233 transitions. [2025-03-03 17:34:42,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-03-03 17:34:42,673 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 233 transitions. [2025-03-03 17:34:42,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 17:34:42,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:34:42,674 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] [2025-03-03 17:34:42,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:34:42,674 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:34:42,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:34:42,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1674336468, now seen corresponding path program 1 times [2025-03-03 17:34:42,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:34:42,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88307792] [2025-03-03 17:34:42,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:34:42,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:34:42,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 17:34:42,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 17:34:42,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:34:42,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:34:43,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:34:43,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:34:43,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88307792] [2025-03-03 17:34:43,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88307792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:34:43,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:34:43,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:34:43,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446860383] [2025-03-03 17:34:43,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:34:43,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:34:43,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:34:43,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:34:43,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:34:43,160 INFO L87 Difference]: Start difference. First operand 159 states and 233 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-03-03 17:34:43,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:34:43,255 INFO L93 Difference]: Finished difference Result 304 states and 446 transitions. [2025-03-03 17:34:43,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:34:43,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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 81 [2025-03-03 17:34:43,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:34:43,257 INFO L225 Difference]: With dead ends: 304 [2025-03-03 17:34:43,257 INFO L226 Difference]: Without dead ends: 163 [2025-03-03 17:34:43,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:34:43,258 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 162 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:34:43,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 561 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:34:43,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-03 17:34:43,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2025-03-03 17:34:43,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.4658385093167703) internal successors, (236), 161 states have internal predecessors, (236), 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-03-03 17:34:43,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 236 transitions. [2025-03-03 17:34:43,266 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 236 transitions. Word has length 81 [2025-03-03 17:34:43,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:34:43,266 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 236 transitions. [2025-03-03 17:34:43,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-03-03 17:34:43,266 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 236 transitions. [2025-03-03 17:34:43,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 17:34:43,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:34:43,268 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] [2025-03-03 17:34:43,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:34:43,268 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:34:43,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:34:43,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1495952104, now seen corresponding path program 1 times [2025-03-03 17:34:43,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:34:43,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569148292] [2025-03-03 17:34:43,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:34:43,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:34:43,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 17:34:43,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 17:34:43,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:34:43,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:34:44,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:34:44,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:34:44,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569148292] [2025-03-03 17:34:44,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569148292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:34:44,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:34:44,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:34:44,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709950710] [2025-03-03 17:34:44,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:34:44,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:34:44,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:34:44,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:34:44,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:34:44,599 INFO L87 Difference]: Start difference. First operand 162 states and 236 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 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-03-03 17:34:44,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:34:44,937 INFO L93 Difference]: Finished difference Result 458 states and 668 transitions. [2025-03-03 17:34:44,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:34:44,937 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 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 82 [2025-03-03 17:34:44,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:34:44,939 INFO L225 Difference]: With dead ends: 458 [2025-03-03 17:34:44,940 INFO L226 Difference]: Without dead ends: 314 [2025-03-03 17:34:44,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:34:44,943 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 435 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:34:44,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1108 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:34:44,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-03 17:34:44,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 170. [2025-03-03 17:34:44,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.455621301775148) internal successors, (246), 169 states have internal predecessors, (246), 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-03-03 17:34:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 246 transitions. [2025-03-03 17:34:44,954 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 246 transitions. Word has length 82 [2025-03-03 17:34:44,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:34:44,954 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 246 transitions. [2025-03-03 17:34:44,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 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-03-03 17:34:44,955 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 246 transitions. [2025-03-03 17:34:44,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 17:34:44,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:34:44,956 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] [2025-03-03 17:34:44,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 17:34:44,956 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:34:44,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:34:44,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1516055803, now seen corresponding path program 1 times [2025-03-03 17:34:44,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:34:44,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035191832] [2025-03-03 17:34:44,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:34:44,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:34:44,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 17:34:45,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 17:34:45,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:34:45,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:34:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:34:45,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:34:45,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035191832] [2025-03-03 17:34:45,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035191832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:34:45,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:34:45,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:34:45,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928214545] [2025-03-03 17:34:45,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:34:45,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:34:45,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:34:45,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:34:45,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:34:45,699 INFO L87 Difference]: Start difference. First operand 170 states and 246 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 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-03-03 17:34:46,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:34:46,038 INFO L93 Difference]: Finished difference Result 463 states and 673 transitions. [2025-03-03 17:34:46,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:34:46,039 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 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 83 [2025-03-03 17:34:46,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:34:46,040 INFO L225 Difference]: With dead ends: 463 [2025-03-03 17:34:46,040 INFO L226 Difference]: Without dead ends: 319 [2025-03-03 17:34:46,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:34:46,041 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 428 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:34:46,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1152 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:34:46,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-03 17:34:46,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 183. [2025-03-03 17:34:46,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 1.4505494505494505) internal successors, (264), 182 states have internal predecessors, (264), 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-03-03 17:34:46,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 264 transitions. [2025-03-03 17:34:46,053 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 264 transitions. Word has length 83 [2025-03-03 17:34:46,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:34:46,053 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 264 transitions. [2025-03-03 17:34:46,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 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-03-03 17:34:46,054 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 264 transitions. [2025-03-03 17:34:46,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 17:34:46,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:34:46,057 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] [2025-03-03 17:34:46,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 17:34:46,057 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:34:46,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:34:46,057 INFO L85 PathProgramCache]: Analyzing trace with hash -59669566, now seen corresponding path program 1 times [2025-03-03 17:34:46,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:34:46,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643344984] [2025-03-03 17:34:46,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:34:46,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:34:46,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 17:34:46,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 17:34:46,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:34:46,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:34:46,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:34:46,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:34:46,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643344984] [2025-03-03 17:34:46,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643344984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:34:46,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:34:46,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:34:46,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999021074] [2025-03-03 17:34:46,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:34:46,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:34:46,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:34:46,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:34:46,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:34:46,728 INFO L87 Difference]: Start difference. First operand 183 states and 264 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 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-03-03 17:34:47,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:34:47,049 INFO L93 Difference]: Finished difference Result 468 states and 679 transitions. [2025-03-03 17:34:47,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:34:47,049 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 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 84 [2025-03-03 17:34:47,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:34:47,051 INFO L225 Difference]: With dead ends: 468 [2025-03-03 17:34:47,051 INFO L226 Difference]: Without dead ends: 324 [2025-03-03 17:34:47,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:34:47,052 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 623 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:34:47,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1109 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:34:47,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-03-03 17:34:47,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 196. [2025-03-03 17:34:47,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 1.4461538461538461) internal successors, (282), 195 states have internal predecessors, (282), 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-03-03 17:34:47,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 282 transitions. [2025-03-03 17:34:47,058 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 282 transitions. Word has length 84 [2025-03-03 17:34:47,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:34:47,058 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 282 transitions. [2025-03-03 17:34:47,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 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-03-03 17:34:47,058 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 282 transitions. [2025-03-03 17:34:47,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 17:34:47,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:34:47,059 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] [2025-03-03 17:34:47,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:34:47,059 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:34:47,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:34:47,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1045526526, now seen corresponding path program 1 times [2025-03-03 17:34:47,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:34:47,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266426515] [2025-03-03 17:34:47,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:34:47,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:34:47,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 17:34:47,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 17:34:47,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:34:47,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:34:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:34:47,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:34:47,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266426515] [2025-03-03 17:34:47,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266426515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:34:47,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:34:47,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:34:47,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622197177] [2025-03-03 17:34:47,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:34:47,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:34:47,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:34:47,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:34:47,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:34:47,699 INFO L87 Difference]: Start difference. First operand 196 states and 282 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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-03-03 17:34:47,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:34:47,892 INFO L93 Difference]: Finished difference Result 362 states and 524 transitions. [2025-03-03 17:34:47,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:34:47,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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 84 [2025-03-03 17:34:47,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:34:47,893 INFO L225 Difference]: With dead ends: 362 [2025-03-03 17:34:47,893 INFO L226 Difference]: Without dead ends: 205 [2025-03-03 17:34:47,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:34:47,894 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 4 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:34:47,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1072 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:34:47,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-03 17:34:47,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2025-03-03 17:34:47,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 1.4427860696517414) internal successors, (290), 201 states have internal predecessors, (290), 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-03-03 17:34:47,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 290 transitions. [2025-03-03 17:34:47,899 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 290 transitions. Word has length 84 [2025-03-03 17:34:47,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:34:47,899 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 290 transitions. [2025-03-03 17:34:47,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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-03-03 17:34:47,900 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 290 transitions. [2025-03-03 17:34:47,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 17:34:47,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:34:47,900 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] [2025-03-03 17:34:47,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 17:34:47,901 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:34:47,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:34:47,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1843733169, now seen corresponding path program 1 times [2025-03-03 17:34:47,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:34:47,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543439719] [2025-03-03 17:34:47,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:34:47,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:34:47,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 17:34:48,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 17:34:48,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:34:48,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:34:48,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:34:48,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:34:48,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543439719] [2025-03-03 17:34:48,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543439719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:34:48,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:34:48,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:34:48,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972047090] [2025-03-03 17:34:48,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:34:48,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:34:48,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:34:48,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:34:48,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:34:48,349 INFO L87 Difference]: Start difference. First operand 202 states and 290 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-03-03 17:34:48,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:34:48,434 INFO L93 Difference]: Finished difference Result 371 states and 535 transitions. [2025-03-03 17:34:48,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:34:48,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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 84 [2025-03-03 17:34:48,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:34:48,436 INFO L225 Difference]: With dead ends: 371 [2025-03-03 17:34:48,436 INFO L226 Difference]: Without dead ends: 199 [2025-03-03 17:34:48,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:34:48,437 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 0 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:34:48,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 558 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:34:48,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-03 17:34:48,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-03-03 17:34:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 1.4343434343434343) internal successors, (284), 198 states have internal predecessors, (284), 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-03-03 17:34:48,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 284 transitions. [2025-03-03 17:34:48,443 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 284 transitions. Word has length 84 [2025-03-03 17:34:48,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:34:48,443 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 284 transitions. [2025-03-03 17:34:48,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-03-03 17:34:48,443 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 284 transitions. [2025-03-03 17:34:48,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 17:34:48,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:34:48,444 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] [2025-03-03 17:34:48,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 17:34:48,444 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:34:48,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:34:48,446 INFO L85 PathProgramCache]: Analyzing trace with hash 480025465, now seen corresponding path program 1 times [2025-03-03 17:34:48,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:34:48,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037540243] [2025-03-03 17:34:48,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:34:48,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:34:48,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 17:34:48,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 17:34:48,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:34:48,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:34:48,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:34:48,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:34:48,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037540243] [2025-03-03 17:34:48,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037540243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:34:48,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:34:48,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:34:48,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989429198] [2025-03-03 17:34:48,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:34:48,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:34:48,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:34:48,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:34:48,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:34:48,861 INFO L87 Difference]: Start difference. First operand 199 states and 284 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-03-03 17:34:48,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:34:48,941 INFO L93 Difference]: Finished difference Result 360 states and 516 transitions. [2025-03-03 17:34:48,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:34:48,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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 84 [2025-03-03 17:34:48,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:34:48,942 INFO L225 Difference]: With dead ends: 360 [2025-03-03 17:34:48,943 INFO L226 Difference]: Without dead ends: 186 [2025-03-03 17:34:48,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:34:48,943 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:34:48,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 555 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:34:48,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-03 17:34:48,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-03-03 17:34:48,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.427027027027027) internal successors, (264), 185 states have internal predecessors, (264), 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-03-03 17:34:48,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 264 transitions. [2025-03-03 17:34:48,950 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 264 transitions. Word has length 84 [2025-03-03 17:34:48,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:34:48,950 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 264 transitions. [2025-03-03 17:34:48,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-03-03 17:34:48,950 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 264 transitions. [2025-03-03 17:34:48,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 17:34:48,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:34:48,951 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] [2025-03-03 17:34:48,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 17:34:48,951 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:34:48,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:34:48,951 INFO L85 PathProgramCache]: Analyzing trace with hash 962865123, now seen corresponding path program 1 times [2025-03-03 17:34:48,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:34:48,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847981447] [2025-03-03 17:34:48,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:34:48,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:34:48,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 17:34:49,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 17:34:49,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:34:49,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:34:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:34:49,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:34:49,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847981447] [2025-03-03 17:34:49,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847981447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:34:49,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:34:49,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 17:34:49,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107753197] [2025-03-03 17:34:49,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:34:49,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 17:34:49,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:34:49,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 17:34:49,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:34:49,640 INFO L87 Difference]: Start difference. First operand 186 states and 264 transitions. Second operand has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 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-03-03 17:34:49,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:34:49,907 INFO L93 Difference]: Finished difference Result 346 states and 497 transitions. [2025-03-03 17:34:49,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 17:34:49,907 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 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 85 [2025-03-03 17:34:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:34:49,908 INFO L225 Difference]: With dead ends: 346 [2025-03-03 17:34:49,909 INFO L226 Difference]: Without dead ends: 199 [2025-03-03 17:34:49,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:34:49,909 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 6 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:34:49,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1540 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:34:49,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-03 17:34:49,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2025-03-03 17:34:49,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.4234693877551021) internal successors, (279), 196 states have internal predecessors, (279), 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-03-03 17:34:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 279 transitions. [2025-03-03 17:34:49,916 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 279 transitions. Word has length 85 [2025-03-03 17:34:49,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:34:49,917 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 279 transitions. [2025-03-03 17:34:49,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 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-03-03 17:34:49,917 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 279 transitions. [2025-03-03 17:34:49,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 17:34:49,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:34:49,918 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] [2025-03-03 17:34:49,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 17:34:49,918 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:34:49,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:34:49,919 INFO L85 PathProgramCache]: Analyzing trace with hash 346664229, now seen corresponding path program 1 times [2025-03-03 17:34:49,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:34:49,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212677873] [2025-03-03 17:34:49,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:34:49,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:34:49,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 17:34:50,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 17:34:50,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:34:50,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:34:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:34:50,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:34:50,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212677873] [2025-03-03 17:34:50,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212677873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:34:50,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:34:50,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:34:50,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678064632] [2025-03-03 17:34:50,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:34:50,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:34:50,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:34:50,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:34:50,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:34:50,527 INFO L87 Difference]: Start difference. First operand 197 states and 279 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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-03-03 17:34:50,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:34:50,833 INFO L93 Difference]: Finished difference Result 487 states and 699 transitions. [2025-03-03 17:34:50,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:34:50,833 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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 85 [2025-03-03 17:34:50,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:34:50,835 INFO L225 Difference]: With dead ends: 487 [2025-03-03 17:34:50,835 INFO L226 Difference]: Without dead ends: 330 [2025-03-03 17:34:50,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:34:50,837 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 404 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:34:50,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1111 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:34:50,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-03 17:34:50,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 210. [2025-03-03 17:34:50,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.4210526315789473) internal successors, (297), 209 states have internal predecessors, (297), 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-03-03 17:34:50,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 297 transitions. [2025-03-03 17:34:50,842 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 297 transitions. Word has length 85 [2025-03-03 17:34:50,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:34:50,844 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 297 transitions. [2025-03-03 17:34:50,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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-03-03 17:34:50,844 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 297 transitions. [2025-03-03 17:34:50,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 17:34:50,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:34:50,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] [2025-03-03 17:34:50,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 17:34:50,845 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:34:50,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:34:50,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2090470747, now seen corresponding path program 1 times [2025-03-03 17:34:50,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:34:50,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011981515] [2025-03-03 17:34:50,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:34:50,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:34:50,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 17:34:50,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 17:34:50,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:34:50,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:34:51,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:34:51,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:34:51,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011981515] [2025-03-03 17:34:51,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011981515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:34:51,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:34:51,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:34:51,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106939752] [2025-03-03 17:34:51,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:34:51,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:34:51,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:34:51,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:34:51,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:34:51,186 INFO L87 Difference]: Start difference. First operand 210 states and 297 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-03-03 17:34:51,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:34:51,257 INFO L93 Difference]: Finished difference Result 380 states and 541 transitions. [2025-03-03 17:34:51,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:34:51,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 85 [2025-03-03 17:34:51,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:34:51,258 INFO L225 Difference]: With dead ends: 380 [2025-03-03 17:34:51,258 INFO L226 Difference]: Without dead ends: 200 [2025-03-03 17:34:51,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:34:51,259 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:34:51,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 552 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:34:51,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-03 17:34:51,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-03-03 17:34:51,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.4120603015075377) internal successors, (281), 199 states have internal predecessors, (281), 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-03-03 17:34:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 281 transitions. [2025-03-03 17:34:51,270 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 281 transitions. Word has length 85 [2025-03-03 17:34:51,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:34:51,270 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 281 transitions. [2025-03-03 17:34:51,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-03-03 17:34:51,270 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 281 transitions. [2025-03-03 17:34:51,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 17:34:51,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:34:51,271 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] [2025-03-03 17:34:51,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 17:34:51,271 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:34:51,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:34:51,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2029227116, now seen corresponding path program 1 times [2025-03-03 17:34:51,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:34:51,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7656835] [2025-03-03 17:34:51,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:34:51,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:34:51,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 17:34:51,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 17:34:51,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:34:51,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:34:51,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:34:51,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:34:51,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7656835] [2025-03-03 17:34:51,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7656835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:34:51,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:34:51,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:34:51,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467976453] [2025-03-03 17:34:51,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:34:51,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:34:51,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:34:51,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:34:51,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:34:51,833 INFO L87 Difference]: Start difference. First operand 200 states and 281 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-03-03 17:34:52,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:34:52,120 INFO L93 Difference]: Finished difference Result 481 states and 687 transitions. [2025-03-03 17:34:52,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:34:52,121 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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 86 [2025-03-03 17:34:52,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:34:52,122 INFO L225 Difference]: With dead ends: 481 [2025-03-03 17:34:52,122 INFO L226 Difference]: Without dead ends: 325 [2025-03-03 17:34:52,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:34:52,124 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 389 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:34:52,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1131 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:34:52,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-03 17:34:52,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 213. [2025-03-03 17:34:52,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.4103773584905661) internal successors, (299), 212 states have internal predecessors, (299), 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-03-03 17:34:52,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 299 transitions. [2025-03-03 17:34:52,130 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 299 transitions. Word has length 86 [2025-03-03 17:34:52,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:34:52,130 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 299 transitions. [2025-03-03 17:34:52,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-03-03 17:34:52,131 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 299 transitions. [2025-03-03 17:34:52,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 17:34:52,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:34:52,131 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] [2025-03-03 17:34:52,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 17:34:52,132 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:34:52,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:34:52,132 INFO L85 PathProgramCache]: Analyzing trace with hash 630002770, now seen corresponding path program 1 times [2025-03-03 17:34:52,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:34:52,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040794102] [2025-03-03 17:34:52,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:34:52,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:34:52,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 17:34:52,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 17:34:52,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:34:52,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:34:53,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-03-03 17:34:53,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:34:53,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040794102] [2025-03-03 17:34:53,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040794102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:34:53,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:34:53,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 17:34:53,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463082097] [2025-03-03 17:34:53,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:34:53,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 17:34:53,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:34:53,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 17:34:53,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2025-03-03 17:34:53,317 INFO L87 Difference]: Start difference. First operand 213 states and 299 transitions. Second operand has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 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-03-03 17:34:54,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:34:54,397 INFO L93 Difference]: Finished difference Result 482 states and 691 transitions. [2025-03-03 17:34:54,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-03 17:34:54,398 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 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 86 [2025-03-03 17:34:54,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:34:54,399 INFO L225 Difference]: With dead ends: 482 [2025-03-03 17:34:54,399 INFO L226 Difference]: Without dead ends: 313 [2025-03-03 17:34:54,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=1885, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 17:34:54,401 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 391 mSDsluCounter, 2145 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:34:54,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 2300 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 17:34:54,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-03 17:34:54,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 228. [2025-03-03 17:34:54,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.4096916299559472) internal successors, (320), 227 states have internal predecessors, (320), 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-03-03 17:34:54,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 320 transitions. [2025-03-03 17:34:54,409 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 320 transitions. Word has length 86 [2025-03-03 17:34:54,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:34:54,409 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 320 transitions. [2025-03-03 17:34:54,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 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-03-03 17:34:54,409 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 320 transitions. [2025-03-03 17:34:54,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 17:34:54,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:34:54,411 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] [2025-03-03 17:34:54,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 17:34:54,412 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:34:54,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:34:54,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1874417957, now seen corresponding path program 1 times [2025-03-03 17:34:54,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:34:54,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004574994] [2025-03-03 17:34:54,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:34:54,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:34:54,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 17:34:54,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 17:34:54,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:34:54,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:34:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:34:54,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:34:54,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004574994] [2025-03-03 17:34:54,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004574994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:34:54,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:34:54,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:34:54,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669737860] [2025-03-03 17:34:54,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:34:54,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:34:54,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:34:54,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:34:54,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:34:54,964 INFO L87 Difference]: Start difference. First operand 228 states and 320 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-03-03 17:34:55,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:34:55,150 INFO L93 Difference]: Finished difference Result 418 states and 594 transitions. [2025-03-03 17:34:55,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:34:55,151 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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 86 [2025-03-03 17:34:55,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:34:55,152 INFO L225 Difference]: With dead ends: 418 [2025-03-03 17:34:55,152 INFO L226 Difference]: Without dead ends: 236 [2025-03-03 17:34:55,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:34:55,154 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 3 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:34:55,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1249 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:34:55,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-03 17:34:55,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2025-03-03 17:34:55,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.4034334763948497) internal successors, (327), 233 states have internal predecessors, (327), 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-03-03 17:34:55,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 327 transitions. [2025-03-03 17:34:55,160 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 327 transitions. Word has length 86 [2025-03-03 17:34:55,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:34:55,160 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 327 transitions. [2025-03-03 17:34:55,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-03-03 17:34:55,161 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 327 transitions. [2025-03-03 17:34:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 17:34:55,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:34:55,163 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] [2025-03-03 17:34:55,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 17:34:55,163 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:34:55,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:34:55,163 INFO L85 PathProgramCache]: Analyzing trace with hash 822093647, now seen corresponding path program 1 times [2025-03-03 17:34:55,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:34:55,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135074144] [2025-03-03 17:34:55,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:34:55,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:34:55,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 17:34:55,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 17:34:55,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:34:55,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:34:55,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:34:55,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:34:55,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135074144] [2025-03-03 17:34:55,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135074144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:34:55,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:34:55,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:34:55,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806328531] [2025-03-03 17:34:55,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:34:55,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:34:55,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:34:55,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:34:55,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:34:55,911 INFO L87 Difference]: Start difference. First operand 234 states and 327 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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-03-03 17:34:56,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:34:56,208 INFO L93 Difference]: Finished difference Result 527 states and 749 transitions. [2025-03-03 17:34:56,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:34:56,208 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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 87 [2025-03-03 17:34:56,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:34:56,210 INFO L225 Difference]: With dead ends: 527 [2025-03-03 17:34:56,210 INFO L226 Difference]: Without dead ends: 351 [2025-03-03 17:34:56,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:34:56,210 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 549 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:34:56,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1125 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:34:56,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-03 17:34:56,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 247. [2025-03-03 17:34:56,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.4065040650406504) internal successors, (346), 246 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-03-03 17:34:56,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 346 transitions. [2025-03-03 17:34:56,216 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 346 transitions. Word has length 87 [2025-03-03 17:34:56,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:34:56,216 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 346 transitions. [2025-03-03 17:34:56,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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-03-03 17:34:56,217 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 346 transitions. [2025-03-03 17:34:56,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 17:34:56,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:34:56,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] [2025-03-03 17:34:56,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 17:34:56,218 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:34:56,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:34:56,219 INFO L85 PathProgramCache]: Analyzing trace with hash 744176762, now seen corresponding path program 1 times [2025-03-03 17:34:56,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:34:56,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029699874] [2025-03-03 17:34:56,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:34:56,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:34:56,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 17:34:56,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 17:34:56,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:34:56,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:34:56,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:34:56,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:34:56,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029699874] [2025-03-03 17:34:56,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029699874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:34:56,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:34:56,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 17:34:56,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033981367] [2025-03-03 17:34:56,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:34:56,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 17:34:56,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:34:56,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 17:34:56,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-03-03 17:34:56,854 INFO L87 Difference]: Start difference. First operand 247 states and 346 transitions. Second operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 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-03-03 17:34:57,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:34:57,329 INFO L93 Difference]: Finished difference Result 465 states and 661 transitions. [2025-03-03 17:34:57,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 17:34:57,330 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 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 87 [2025-03-03 17:34:57,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:34:57,331 INFO L225 Difference]: With dead ends: 465 [2025-03-03 17:34:57,331 INFO L226 Difference]: Without dead ends: 276 [2025-03-03 17:34:57,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-03-03 17:34:57,331 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 14 mSDsluCounter, 2369 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2529 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:34:57,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2529 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:34:57,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-03 17:34:57,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 274. [2025-03-03 17:34:57,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 1.4065934065934067) internal successors, (384), 273 states have internal predecessors, (384), 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-03-03 17:34:57,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 384 transitions. [2025-03-03 17:34:57,336 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 384 transitions. Word has length 87 [2025-03-03 17:34:57,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:34:57,336 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 384 transitions. [2025-03-03 17:34:57,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 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-03-03 17:34:57,337 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 384 transitions. [2025-03-03 17:34:57,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 17:34:57,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:34:57,337 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] [2025-03-03 17:34:57,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 17:34:57,337 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:34:57,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:34:57,338 INFO L85 PathProgramCache]: Analyzing trace with hash -227056243, now seen corresponding path program 1 times [2025-03-03 17:34:57,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:34:57,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005936816] [2025-03-03 17:34:57,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:34:57,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:34:57,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 17:34:57,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 17:34:57,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:34:57,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:34:57,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:34:57,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:34:57,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005936816] [2025-03-03 17:34:57,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005936816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:34:57,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:34:57,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:34:57,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552493837] [2025-03-03 17:34:57,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:34:57,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:34:57,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:34:57,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:34:57,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:34:57,613 INFO L87 Difference]: Start difference. First operand 274 states and 384 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-03-03 17:34:57,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:34:57,664 INFO L93 Difference]: Finished difference Result 494 states and 700 transitions. [2025-03-03 17:34:57,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:34:57,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 87 [2025-03-03 17:34:57,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:34:57,666 INFO L225 Difference]: With dead ends: 494 [2025-03-03 17:34:57,666 INFO L226 Difference]: Without dead ends: 271 [2025-03-03 17:34:57,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:34:57,667 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:34:57,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 367 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:34:57,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-03 17:34:57,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-03-03 17:34:57,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 1.4) internal successors, (378), 270 states have internal predecessors, (378), 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-03-03 17:34:57,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 378 transitions. [2025-03-03 17:34:57,671 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 378 transitions. Word has length 87 [2025-03-03 17:34:57,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:34:57,672 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 378 transitions. [2025-03-03 17:34:57,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-03-03 17:34:57,672 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 378 transitions. [2025-03-03 17:34:57,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 17:34:57,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:34:57,672 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] [2025-03-03 17:34:57,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 17:34:57,672 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:34:57,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:34:57,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1604210922, now seen corresponding path program 1 times [2025-03-03 17:34:57,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:34:57,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585535783] [2025-03-03 17:34:57,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:34:57,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:34:57,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 17:34:57,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 17:34:57,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:34:57,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:34:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:34:58,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:34:58,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585535783] [2025-03-03 17:34:58,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585535783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:34:58,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:34:58,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:34:58,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446789778] [2025-03-03 17:34:58,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:34:58,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:34:58,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:34:58,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:34:58,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:34:58,120 INFO L87 Difference]: Start difference. First operand 271 states and 378 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 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-03-03 17:34:58,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:34:58,368 INFO L93 Difference]: Finished difference Result 579 states and 820 transitions. [2025-03-03 17:34:58,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:34:58,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 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 88 [2025-03-03 17:34:58,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:34:58,369 INFO L225 Difference]: With dead ends: 579 [2025-03-03 17:34:58,370 INFO L226 Difference]: Without dead ends: 380 [2025-03-03 17:34:58,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:34:58,371 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 374 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:34:58,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1092 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:34:58,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-03 17:34:58,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 284. [2025-03-03 17:34:58,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.3992932862190812) internal successors, (396), 283 states have internal predecessors, (396), 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-03-03 17:34:58,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 396 transitions. [2025-03-03 17:34:58,376 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 396 transitions. Word has length 88 [2025-03-03 17:34:58,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:34:58,376 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 396 transitions. [2025-03-03 17:34:58,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 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-03-03 17:34:58,377 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 396 transitions. [2025-03-03 17:34:58,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 17:34:58,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:34:58,377 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] [2025-03-03 17:34:58,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 17:34:58,378 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:34:58,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:34:58,378 INFO L85 PathProgramCache]: Analyzing trace with hash -938760570, now seen corresponding path program 1 times [2025-03-03 17:34:58,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:34:58,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747534496] [2025-03-03 17:34:58,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:34:58,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:34:58,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 17:34:58,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 17:34:58,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:34:58,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:34:59,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:34:59,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:34:59,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747534496] [2025-03-03 17:34:59,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747534496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:34:59,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:34:59,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-03 17:34:59,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398439958] [2025-03-03 17:34:59,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:34:59,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 17:34:59,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:34:59,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 17:34:59,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2025-03-03 17:34:59,252 INFO L87 Difference]: Start difference. First operand 284 states and 396 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 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-03-03 17:34:59,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:34:59,767 INFO L93 Difference]: Finished difference Result 511 states and 722 transitions. [2025-03-03 17:34:59,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 17:34:59,768 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 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 88 [2025-03-03 17:34:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:34:59,769 INFO L225 Difference]: With dead ends: 511 [2025-03-03 17:34:59,769 INFO L226 Difference]: Without dead ends: 299 [2025-03-03 17:34:59,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2025-03-03 17:34:59,770 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 17 mSDsluCounter, 2718 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2871 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:34:59,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2871 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:34:59,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-03 17:34:59,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2025-03-03 17:34:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.3986486486486487) internal successors, (414), 296 states have internal predecessors, (414), 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-03-03 17:34:59,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 414 transitions. [2025-03-03 17:34:59,774 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 414 transitions. Word has length 88 [2025-03-03 17:34:59,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:34:59,774 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 414 transitions. [2025-03-03 17:34:59,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 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-03-03 17:34:59,775 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 414 transitions. [2025-03-03 17:34:59,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 17:34:59,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:34:59,775 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] [2025-03-03 17:34:59,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 17:34:59,775 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:34:59,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:34:59,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1884086442, now seen corresponding path program 1 times [2025-03-03 17:34:59,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:34:59,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777388743] [2025-03-03 17:34:59,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:34:59,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:34:59,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 17:34:59,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 17:34:59,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:34:59,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:00,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:00,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:00,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777388743] [2025-03-03 17:35:00,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777388743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:00,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:00,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:35:00,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581185520] [2025-03-03 17:35:00,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:00,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:35:00,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:00,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:35:00,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:35:00,336 INFO L87 Difference]: Start difference. First operand 297 states and 414 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 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-03-03 17:35:00,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:00,457 INFO L93 Difference]: Finished difference Result 533 states and 752 transitions. [2025-03-03 17:35:00,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:35:00,458 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 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 88 [2025-03-03 17:35:00,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:00,459 INFO L225 Difference]: With dead ends: 533 [2025-03-03 17:35:00,459 INFO L226 Difference]: Without dead ends: 312 [2025-03-03 17:35:00,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:35:00,460 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 3 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:00,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1242 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:00,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-03 17:35:00,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2025-03-03 17:35:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.3941368078175895) internal successors, (428), 307 states have internal predecessors, (428), 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-03-03 17:35:00,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 428 transitions. [2025-03-03 17:35:00,464 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 428 transitions. Word has length 88 [2025-03-03 17:35:00,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:00,464 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 428 transitions. [2025-03-03 17:35:00,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 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-03-03 17:35:00,465 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 428 transitions. [2025-03-03 17:35:00,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 17:35:00,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:00,465 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] [2025-03-03 17:35:00,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 17:35:00,465 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:00,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:00,466 INFO L85 PathProgramCache]: Analyzing trace with hash -432726795, now seen corresponding path program 1 times [2025-03-03 17:35:00,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:00,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085193971] [2025-03-03 17:35:00,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:00,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:00,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 17:35:00,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 17:35:00,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:00,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:00,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:00,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085193971] [2025-03-03 17:35:00,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085193971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:00,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:00,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:00,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635456836] [2025-03-03 17:35:00,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:00,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:00,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:00,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:00,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:00,780 INFO L87 Difference]: Start difference. First operand 308 states and 428 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-03-03 17:35:00,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:00,842 INFO L93 Difference]: Finished difference Result 550 states and 772 transitions. [2025-03-03 17:35:00,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:00,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 88 [2025-03-03 17:35:00,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:00,846 INFO L225 Difference]: With dead ends: 550 [2025-03-03 17:35:00,846 INFO L226 Difference]: Without dead ends: 277 [2025-03-03 17:35:00,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:00,847 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 0 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:00,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 546 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:00,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-03 17:35:00,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 271. [2025-03-03 17:35:00,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 1.3888888888888888) internal successors, (375), 270 states have internal predecessors, (375), 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-03-03 17:35:00,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 375 transitions. [2025-03-03 17:35:00,853 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 375 transitions. Word has length 88 [2025-03-03 17:35:00,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:00,853 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 375 transitions. [2025-03-03 17:35:00,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-03-03 17:35:00,853 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 375 transitions. [2025-03-03 17:35:00,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 17:35:00,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:00,854 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] [2025-03-03 17:35:00,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 17:35:00,855 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:00,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:00,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1841445857, now seen corresponding path program 1 times [2025-03-03 17:35:00,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:00,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675821025] [2025-03-03 17:35:00,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:00,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:00,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 17:35:00,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 17:35:00,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:00,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:01,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:01,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:01,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675821025] [2025-03-03 17:35:01,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675821025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:01,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:01,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:35:01,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150376448] [2025-03-03 17:35:01,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:01,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:35:01,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:01,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:35:01,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:35:01,407 INFO L87 Difference]: Start difference. First operand 271 states and 375 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-03-03 17:35:01,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:01,545 INFO L93 Difference]: Finished difference Result 486 states and 683 transitions. [2025-03-03 17:35:01,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:35:01,546 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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 89 [2025-03-03 17:35:01,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:01,547 INFO L225 Difference]: With dead ends: 486 [2025-03-03 17:35:01,547 INFO L226 Difference]: Without dead ends: 283 [2025-03-03 17:35:01,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:35:01,547 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 3 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:01,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1237 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:01,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-03 17:35:01,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 278. [2025-03-03 17:35:01,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.3862815884476534) internal successors, (384), 277 states have internal predecessors, (384), 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-03-03 17:35:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 384 transitions. [2025-03-03 17:35:01,551 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 384 transitions. Word has length 89 [2025-03-03 17:35:01,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:01,552 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 384 transitions. [2025-03-03 17:35:01,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-03-03 17:35:01,552 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 384 transitions. [2025-03-03 17:35:01,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 17:35:01,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:01,552 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] [2025-03-03 17:35:01,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 17:35:01,553 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:01,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:01,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1076796281, now seen corresponding path program 1 times [2025-03-03 17:35:01,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:01,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9948541] [2025-03-03 17:35:01,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:01,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:01,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 17:35:01,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 17:35:01,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:01,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:01,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:01,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9948541] [2025-03-03 17:35:01,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9948541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:01,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:01,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:35:01,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521503541] [2025-03-03 17:35:01,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:01,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:35:01,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:01,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:35:01,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:35:01,992 INFO L87 Difference]: Start difference. First operand 278 states and 384 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-03-03 17:35:02,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:02,185 INFO L93 Difference]: Finished difference Result 588 states and 827 transitions. [2025-03-03 17:35:02,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:35:02,185 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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 89 [2025-03-03 17:35:02,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:02,186 INFO L225 Difference]: With dead ends: 588 [2025-03-03 17:35:02,187 INFO L226 Difference]: Without dead ends: 379 [2025-03-03 17:35:02,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:35:02,187 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 496 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:02,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 1115 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:35:02,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-03 17:35:02,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 291. [2025-03-03 17:35:02,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.3862068965517242) internal successors, (402), 290 states have internal predecessors, (402), 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-03-03 17:35:02,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 402 transitions. [2025-03-03 17:35:02,192 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 402 transitions. Word has length 89 [2025-03-03 17:35:02,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:02,192 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 402 transitions. [2025-03-03 17:35:02,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-03-03 17:35:02,192 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 402 transitions. [2025-03-03 17:35:02,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 17:35:02,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:02,193 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] [2025-03-03 17:35:02,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 17:35:02,193 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:02,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:02,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1512958101, now seen corresponding path program 1 times [2025-03-03 17:35:02,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:02,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818095024] [2025-03-03 17:35:02,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:02,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:02,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 17:35:02,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 17:35:02,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:02,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:02,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:02,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:02,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818095024] [2025-03-03 17:35:02,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818095024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:02,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:02,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-03 17:35:02,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648867035] [2025-03-03 17:35:02,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:02,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 17:35:02,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:03,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 17:35:03,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2025-03-03 17:35:03,001 INFO L87 Difference]: Start difference. First operand 291 states and 402 transitions. Second operand has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 24 states have internal predecessors, (89), 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-03-03 17:35:03,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:03,563 INFO L93 Difference]: Finished difference Result 563 states and 789 transitions. [2025-03-03 17:35:03,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 17:35:03,564 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 24 states have internal predecessors, (89), 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 89 [2025-03-03 17:35:03,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:03,565 INFO L225 Difference]: With dead ends: 563 [2025-03-03 17:35:03,565 INFO L226 Difference]: Without dead ends: 341 [2025-03-03 17:35:03,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2025-03-03 17:35:03,566 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 20 mSDsluCounter, 3303 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3463 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:03,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3463 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1739 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:35:03,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-03 17:35:03,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 335. [2025-03-03 17:35:03,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.3892215568862276) internal successors, (464), 334 states have internal predecessors, (464), 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-03-03 17:35:03,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 464 transitions. [2025-03-03 17:35:03,576 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 464 transitions. Word has length 89 [2025-03-03 17:35:03,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:03,576 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 464 transitions. [2025-03-03 17:35:03,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 24 states have internal predecessors, (89), 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-03-03 17:35:03,577 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 464 transitions. [2025-03-03 17:35:03,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 17:35:03,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:03,577 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] [2025-03-03 17:35:03,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 17:35:03,578 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:03,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:03,578 INFO L85 PathProgramCache]: Analyzing trace with hash 560076013, now seen corresponding path program 1 times [2025-03-03 17:35:03,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:03,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759549629] [2025-03-03 17:35:03,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:03,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:03,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 17:35:03,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 17:35:03,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:03,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:03,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:03,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759549629] [2025-03-03 17:35:03,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759549629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:03,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:03,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:35:03,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064903811] [2025-03-03 17:35:03,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:03,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:35:03,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:03,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:35:03,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:03,903 INFO L87 Difference]: Start difference. First operand 335 states and 464 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-03-03 17:35:04,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:04,001 INFO L93 Difference]: Finished difference Result 691 states and 971 transitions. [2025-03-03 17:35:04,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:35:04,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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 90 [2025-03-03 17:35:04,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:04,003 INFO L225 Difference]: With dead ends: 691 [2025-03-03 17:35:04,003 INFO L226 Difference]: Without dead ends: 414 [2025-03-03 17:35:04,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:35:04,003 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 347 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:04,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 502 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:04,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-03 17:35:04,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 329. [2025-03-03 17:35:04,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 1.3841463414634145) internal successors, (454), 328 states have internal predecessors, (454), 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-03-03 17:35:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 454 transitions. [2025-03-03 17:35:04,007 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 454 transitions. Word has length 90 [2025-03-03 17:35:04,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:04,007 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 454 transitions. [2025-03-03 17:35:04,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-03-03 17:35:04,007 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 454 transitions. [2025-03-03 17:35:04,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 17:35:04,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:04,008 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] [2025-03-03 17:35:04,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 17:35:04,008 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:04,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:04,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1860816045, now seen corresponding path program 1 times [2025-03-03 17:35:04,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:04,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890098995] [2025-03-03 17:35:04,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:04,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:04,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 17:35:04,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 17:35:04,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:04,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:04,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:04,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:04,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890098995] [2025-03-03 17:35:04,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890098995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:04,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:04,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:04,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279436133] [2025-03-03 17:35:04,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:04,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:04,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:04,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:04,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:04,375 INFO L87 Difference]: Start difference. First operand 329 states and 454 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-03-03 17:35:04,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:04,418 INFO L93 Difference]: Finished difference Result 586 states and 821 transitions. [2025-03-03 17:35:04,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:04,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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 90 [2025-03-03 17:35:04,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:04,422 INFO L225 Difference]: With dead ends: 586 [2025-03-03 17:35:04,422 INFO L226 Difference]: Without dead ends: 326 [2025-03-03 17:35:04,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:04,422 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:04,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 363 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:35:04,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-03 17:35:04,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2025-03-03 17:35:04,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.3784615384615384) internal successors, (448), 325 states have internal predecessors, (448), 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-03-03 17:35:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 448 transitions. [2025-03-03 17:35:04,429 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 448 transitions. Word has length 90 [2025-03-03 17:35:04,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:04,429 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 448 transitions. [2025-03-03 17:35:04,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-03-03 17:35:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 448 transitions. [2025-03-03 17:35:04,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 17:35:04,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:04,429 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] [2025-03-03 17:35:04,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 17:35:04,430 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:04,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:04,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1178473536, now seen corresponding path program 1 times [2025-03-03 17:35:04,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:04,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627400076] [2025-03-03 17:35:04,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:04,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:04,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 17:35:04,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 17:35:04,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:04,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:04,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:04,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:04,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627400076] [2025-03-03 17:35:04,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627400076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:04,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:04,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:35:04,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781598447] [2025-03-03 17:35:04,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:04,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:35:04,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:04,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:35:04,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:35:04,840 INFO L87 Difference]: Start difference. First operand 326 states and 448 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-03-03 17:35:05,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:05,043 INFO L93 Difference]: Finished difference Result 668 states and 936 transitions. [2025-03-03 17:35:05,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:35:05,043 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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 90 [2025-03-03 17:35:05,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:05,044 INFO L225 Difference]: With dead ends: 668 [2025-03-03 17:35:05,044 INFO L226 Difference]: Without dead ends: 419 [2025-03-03 17:35:05,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:35:05,045 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 473 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:05,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 1065 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:35:05,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-03 17:35:05,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 339. [2025-03-03 17:35:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 1.378698224852071) internal successors, (466), 338 states have internal predecessors, (466), 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-03-03 17:35:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 466 transitions. [2025-03-03 17:35:05,050 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 466 transitions. Word has length 90 [2025-03-03 17:35:05,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:05,050 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 466 transitions. [2025-03-03 17:35:05,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-03-03 17:35:05,050 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 466 transitions. [2025-03-03 17:35:05,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 17:35:05,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:05,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] [2025-03-03 17:35:05,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 17:35:05,051 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:05,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:05,051 INFO L85 PathProgramCache]: Analyzing trace with hash 214953371, now seen corresponding path program 1 times [2025-03-03 17:35:05,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:05,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7320330] [2025-03-03 17:35:05,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:05,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:05,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 17:35:05,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 17:35:05,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:05,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:06,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:06,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:06,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7320330] [2025-03-03 17:35:06,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7320330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:06,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:06,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2025-03-03 17:35:06,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989948038] [2025-03-03 17:35:06,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:06,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 17:35:06,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:06,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 17:35:06,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2025-03-03 17:35:06,074 INFO L87 Difference]: Start difference. First operand 339 states and 466 transitions. Second operand has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 states have internal predecessors, (90), 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-03-03 17:35:06,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:06,745 INFO L93 Difference]: Finished difference Result 634 states and 887 transitions. [2025-03-03 17:35:06,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 17:35:06,745 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 states have internal predecessors, (90), 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 90 [2025-03-03 17:35:06,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:06,746 INFO L225 Difference]: With dead ends: 634 [2025-03-03 17:35:06,746 INFO L226 Difference]: Without dead ends: 372 [2025-03-03 17:35:06,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2025-03-03 17:35:06,747 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 24 mSDsluCounter, 3156 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3295 SdHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:06,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3295 Invalid, 1923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 17:35:06,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-03 17:35:06,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 371. [2025-03-03 17:35:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 1.3810810810810812) internal successors, (511), 370 states have internal predecessors, (511), 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-03-03 17:35:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 511 transitions. [2025-03-03 17:35:06,751 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 511 transitions. Word has length 90 [2025-03-03 17:35:06,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:06,751 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 511 transitions. [2025-03-03 17:35:06,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 states have internal predecessors, (90), 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-03-03 17:35:06,751 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 511 transitions. [2025-03-03 17:35:06,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 17:35:06,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:06,751 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] [2025-03-03 17:35:06,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 17:35:06,752 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:06,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:06,752 INFO L85 PathProgramCache]: Analyzing trace with hash 758261488, now seen corresponding path program 1 times [2025-03-03 17:35:06,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:06,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895605974] [2025-03-03 17:35:06,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:06,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:06,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 17:35:06,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 17:35:06,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:06,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:07,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:07,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895605974] [2025-03-03 17:35:07,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895605974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:07,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:07,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:35:07,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355213653] [2025-03-03 17:35:07,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:07,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:35:07,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:07,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:35:07,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:07,092 INFO L87 Difference]: Start difference. First operand 371 states and 511 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-03-03 17:35:07,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:07,184 INFO L93 Difference]: Finished difference Result 750 states and 1044 transitions. [2025-03-03 17:35:07,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:35:07,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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 90 [2025-03-03 17:35:07,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:07,186 INFO L225 Difference]: With dead ends: 750 [2025-03-03 17:35:07,186 INFO L226 Difference]: Without dead ends: 424 [2025-03-03 17:35:07,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:35:07,187 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 334 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:07,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 499 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:07,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-03-03 17:35:07,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 347. [2025-03-03 17:35:07,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.3786127167630058) internal successors, (477), 346 states have internal predecessors, (477), 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-03-03 17:35:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 477 transitions. [2025-03-03 17:35:07,191 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 477 transitions. Word has length 90 [2025-03-03 17:35:07,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:07,191 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 477 transitions. [2025-03-03 17:35:07,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-03-03 17:35:07,191 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 477 transitions. [2025-03-03 17:35:07,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 17:35:07,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:07,192 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] [2025-03-03 17:35:07,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 17:35:07,192 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:07,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:07,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1006433885, now seen corresponding path program 1 times [2025-03-03 17:35:07,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:07,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942997912] [2025-03-03 17:35:07,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:07,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:07,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 17:35:07,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 17:35:07,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:07,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:07,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:07,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942997912] [2025-03-03 17:35:07,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942997912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:07,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:07,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:35:07,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660430435] [2025-03-03 17:35:07,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:07,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:35:07,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:07,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:35:07,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:35:07,698 INFO L87 Difference]: Start difference. First operand 347 states and 477 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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-03-03 17:35:07,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:07,881 INFO L93 Difference]: Finished difference Result 710 states and 994 transitions. [2025-03-03 17:35:07,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:35:07,881 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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 91 [2025-03-03 17:35:07,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:07,882 INFO L225 Difference]: With dead ends: 710 [2025-03-03 17:35:07,882 INFO L226 Difference]: Without dead ends: 432 [2025-03-03 17:35:07,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:35:07,883 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 433 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:07,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1056 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:35:07,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-03-03 17:35:07,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 360. [2025-03-03 17:35:07,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.3788300835654597) internal successors, (495), 359 states have internal predecessors, (495), 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-03-03 17:35:07,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 495 transitions. [2025-03-03 17:35:07,887 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 495 transitions. Word has length 91 [2025-03-03 17:35:07,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:07,887 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 495 transitions. [2025-03-03 17:35:07,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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-03-03 17:35:07,888 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 495 transitions. [2025-03-03 17:35:07,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 17:35:07,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:07,888 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] [2025-03-03 17:35:07,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 17:35:07,888 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:07,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:07,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1392573117, now seen corresponding path program 1 times [2025-03-03 17:35:07,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:07,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849344118] [2025-03-03 17:35:07,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:07,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:07,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 17:35:08,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 17:35:08,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:08,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:08,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:08,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:08,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849344118] [2025-03-03 17:35:08,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849344118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:08,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:08,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2025-03-03 17:35:08,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216922927] [2025-03-03 17:35:08,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:08,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 17:35:08,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:08,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 17:35:08,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2025-03-03 17:35:08,806 INFO L87 Difference]: Start difference. First operand 360 states and 495 transitions. Second operand has 29 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 29 states have internal predecessors, (91), 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-03-03 17:35:09,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:09,565 INFO L93 Difference]: Finished difference Result 664 states and 929 transitions. [2025-03-03 17:35:09,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-03 17:35:09,565 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 29 states have internal predecessors, (91), 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 91 [2025-03-03 17:35:09,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:09,566 INFO L225 Difference]: With dead ends: 664 [2025-03-03 17:35:09,566 INFO L226 Difference]: Without dead ends: 373 [2025-03-03 17:35:09,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2025-03-03 17:35:09,567 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 28 mSDsluCounter, 3540 mSDsCounter, 0 mSdLazyCounter, 2421 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 3673 SdHoareTripleChecker+Invalid, 2442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:09,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 3673 Invalid, 2442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2421 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 17:35:09,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-03 17:35:09,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 371. [2025-03-03 17:35:09,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 1.3783783783783783) internal successors, (510), 370 states have internal predecessors, (510), 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-03-03 17:35:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 510 transitions. [2025-03-03 17:35:09,576 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 510 transitions. Word has length 91 [2025-03-03 17:35:09,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:09,576 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 510 transitions. [2025-03-03 17:35:09,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 29 states have internal predecessors, (91), 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-03-03 17:35:09,577 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 510 transitions. [2025-03-03 17:35:09,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 17:35:09,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:09,577 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] [2025-03-03 17:35:09,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 17:35:09,577 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:09,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:09,578 INFO L85 PathProgramCache]: Analyzing trace with hash -2028781547, now seen corresponding path program 1 times [2025-03-03 17:35:09,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:09,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178386729] [2025-03-03 17:35:09,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:09,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:09,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 17:35:09,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 17:35:09,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:09,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:09,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:09,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:09,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178386729] [2025-03-03 17:35:09,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178386729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:09,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:09,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:35:09,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465944703] [2025-03-03 17:35:09,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:09,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:35:09,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:09,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:35:09,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:35:09,999 INFO L87 Difference]: Start difference. First operand 371 states and 510 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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-03-03 17:35:10,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:10,118 INFO L93 Difference]: Finished difference Result 681 states and 952 transitions. [2025-03-03 17:35:10,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:35:10,119 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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 91 [2025-03-03 17:35:10,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:10,120 INFO L225 Difference]: With dead ends: 681 [2025-03-03 17:35:10,120 INFO L226 Difference]: Without dead ends: 381 [2025-03-03 17:35:10,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:35:10,121 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 3 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:10,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1228 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:10,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-03 17:35:10,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 379. [2025-03-03 17:35:10,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 1.3756613756613756) internal successors, (520), 378 states have internal predecessors, (520), 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-03-03 17:35:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 520 transitions. [2025-03-03 17:35:10,125 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 520 transitions. Word has length 91 [2025-03-03 17:35:10,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:10,125 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 520 transitions. [2025-03-03 17:35:10,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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-03-03 17:35:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 520 transitions. [2025-03-03 17:35:10,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 17:35:10,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:10,125 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] [2025-03-03 17:35:10,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 17:35:10,126 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:10,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:10,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1894104470, now seen corresponding path program 1 times [2025-03-03 17:35:10,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:10,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068185186] [2025-03-03 17:35:10,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:10,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:10,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 17:35:10,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 17:35:10,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:10,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:10,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:10,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:10,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068185186] [2025-03-03 17:35:10,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068185186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:10,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:10,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:35:10,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626747198] [2025-03-03 17:35:10,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:10,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:35:10,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:10,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:35:10,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:35:10,756 INFO L87 Difference]: Start difference. First operand 379 states and 520 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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-03-03 17:35:10,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:10,938 INFO L93 Difference]: Finished difference Result 752 states and 1050 transitions. [2025-03-03 17:35:10,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:35:10,939 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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 92 [2025-03-03 17:35:10,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:10,940 INFO L225 Difference]: With dead ends: 752 [2025-03-03 17:35:10,940 INFO L226 Difference]: Without dead ends: 456 [2025-03-03 17:35:10,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:35:10,940 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 423 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:10,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1055 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:35:10,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-03-03 17:35:10,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 392. [2025-03-03 17:35:10,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 1.3759590792838874) internal successors, (538), 391 states have internal predecessors, (538), 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-03-03 17:35:10,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 538 transitions. [2025-03-03 17:35:10,945 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 538 transitions. Word has length 92 [2025-03-03 17:35:10,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:10,945 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 538 transitions. [2025-03-03 17:35:10,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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-03-03 17:35:10,945 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 538 transitions. [2025-03-03 17:35:10,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 17:35:10,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:10,945 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] [2025-03-03 17:35:10,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 17:35:10,946 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:10,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:10,946 INFO L85 PathProgramCache]: Analyzing trace with hash -869315251, now seen corresponding path program 1 times [2025-03-03 17:35:10,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:10,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503529876] [2025-03-03 17:35:10,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:10,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:10,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 17:35:11,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 17:35:11,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:11,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:11,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:11,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:11,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503529876] [2025-03-03 17:35:11,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503529876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:11,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:11,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2025-03-03 17:35:11,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743586836] [2025-03-03 17:35:11,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:11,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 17:35:11,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:11,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 17:35:11,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2025-03-03 17:35:11,890 INFO L87 Difference]: Start difference. First operand 392 states and 538 transitions. Second operand has 32 states, 32 states have (on average 2.875) internal successors, (92), 32 states have internal predecessors, (92), 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-03-03 17:35:12,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:12,795 INFO L93 Difference]: Finished difference Result 721 states and 1007 transitions. [2025-03-03 17:35:12,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-03 17:35:12,796 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.875) internal successors, (92), 32 states have internal predecessors, (92), 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 92 [2025-03-03 17:35:12,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:12,797 INFO L225 Difference]: With dead ends: 721 [2025-03-03 17:35:12,797 INFO L226 Difference]: Without dead ends: 412 [2025-03-03 17:35:12,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2025-03-03 17:35:12,798 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 33 mSDsluCounter, 3754 mSDsCounter, 0 mSdLazyCounter, 2866 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3881 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:12,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3881 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2866 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 17:35:12,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-03 17:35:12,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 410. [2025-03-03 17:35:12,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.3765281173594133) internal successors, (563), 409 states have internal predecessors, (563), 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-03-03 17:35:12,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 563 transitions. [2025-03-03 17:35:12,802 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 563 transitions. Word has length 92 [2025-03-03 17:35:12,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:12,802 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 563 transitions. [2025-03-03 17:35:12,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.875) internal successors, (92), 32 states have internal predecessors, (92), 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-03-03 17:35:12,802 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 563 transitions. [2025-03-03 17:35:12,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 17:35:12,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:12,803 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] [2025-03-03 17:35:12,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 17:35:12,803 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:12,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:12,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1544869666, now seen corresponding path program 1 times [2025-03-03 17:35:12,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:12,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475373619] [2025-03-03 17:35:12,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:12,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:12,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 17:35:12,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 17:35:12,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:12,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:13,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:13,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475373619] [2025-03-03 17:35:13,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475373619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:13,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:13,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:35:13,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580424604] [2025-03-03 17:35:13,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:13,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:35:13,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:13,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:35:13,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:35:13,315 INFO L87 Difference]: Start difference. First operand 410 states and 563 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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-03-03 17:35:13,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:13,432 INFO L93 Difference]: Finished difference Result 748 states and 1044 transitions. [2025-03-03 17:35:13,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:35:13,432 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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 92 [2025-03-03 17:35:13,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:13,433 INFO L225 Difference]: With dead ends: 748 [2025-03-03 17:35:13,434 INFO L226 Difference]: Without dead ends: 425 [2025-03-03 17:35:13,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:35:13,434 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 3 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:13,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1228 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:13,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-03 17:35:13,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 421. [2025-03-03 17:35:13,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.3738095238095238) internal successors, (577), 420 states have internal predecessors, (577), 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-03-03 17:35:13,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 577 transitions. [2025-03-03 17:35:13,439 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 577 transitions. Word has length 92 [2025-03-03 17:35:13,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:13,439 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 577 transitions. [2025-03-03 17:35:13,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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-03-03 17:35:13,439 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 577 transitions. [2025-03-03 17:35:13,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 17:35:13,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:13,440 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] [2025-03-03 17:35:13,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 17:35:13,440 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:13,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:13,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1733261465, now seen corresponding path program 1 times [2025-03-03 17:35:13,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:13,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597201465] [2025-03-03 17:35:13,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:13,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:13,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 17:35:13,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 17:35:13,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:13,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:15,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:15,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597201465] [2025-03-03 17:35:15,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597201465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:15,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:15,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2025-03-03 17:35:15,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823277621] [2025-03-03 17:35:15,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:15,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-03 17:35:15,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:15,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-03 17:35:15,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1330, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 17:35:15,052 INFO L87 Difference]: Start difference. First operand 421 states and 577 transitions. Second operand has 38 states, 38 states have (on average 2.4473684210526314) internal successors, (93), 38 states have internal predecessors, (93), 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-03-03 17:35:17,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:17,487 INFO L93 Difference]: Finished difference Result 837 states and 1166 transitions. [2025-03-03 17:35:17,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-03-03 17:35:17,488 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.4473684210526314) internal successors, (93), 38 states have internal predecessors, (93), 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 93 [2025-03-03 17:35:17,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:17,489 INFO L225 Difference]: With dead ends: 837 [2025-03-03 17:35:17,489 INFO L226 Difference]: Without dead ends: 518 [2025-03-03 17:35:17,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2467 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=426, Invalid=10704, Unknown=0, NotChecked=0, Total=11130 [2025-03-03 17:35:17,492 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 403 mSDsluCounter, 4875 mSDsCounter, 0 mSdLazyCounter, 4007 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 5020 SdHoareTripleChecker+Invalid, 4008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:17,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 5020 Invalid, 4008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4007 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 17:35:17,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-03 17:35:17,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 471. [2025-03-03 17:35:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 1.376595744680851) internal successors, (647), 470 states have internal predecessors, (647), 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-03-03 17:35:17,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 647 transitions. [2025-03-03 17:35:17,496 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 647 transitions. Word has length 93 [2025-03-03 17:35:17,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:17,496 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 647 transitions. [2025-03-03 17:35:17,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.4473684210526314) internal successors, (93), 38 states have internal predecessors, (93), 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-03-03 17:35:17,496 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 647 transitions. [2025-03-03 17:35:17,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 17:35:17,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:17,497 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] [2025-03-03 17:35:17,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 17:35:17,497 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:17,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:17,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1867215309, now seen corresponding path program 1 times [2025-03-03 17:35:17,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:17,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729301514] [2025-03-03 17:35:17,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:17,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:17,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 17:35:17,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 17:35:17,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:17,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:18,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:18,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:18,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729301514] [2025-03-03 17:35:18,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729301514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:18,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:18,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:35:18,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470956375] [2025-03-03 17:35:18,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:18,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:35:18,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:18,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:35:18,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:35:18,035 INFO L87 Difference]: Start difference. First operand 471 states and 647 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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-03-03 17:35:18,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:18,207 INFO L93 Difference]: Finished difference Result 875 states and 1223 transitions. [2025-03-03 17:35:18,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:35:18,207 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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 93 [2025-03-03 17:35:18,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:18,208 INFO L225 Difference]: With dead ends: 875 [2025-03-03 17:35:18,208 INFO L226 Difference]: Without dead ends: 513 [2025-03-03 17:35:18,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:35:18,209 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 357 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:18,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 956 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:18,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-03-03 17:35:18,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 484. [2025-03-03 17:35:18,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 1.3768115942028984) internal successors, (665), 483 states have internal predecessors, (665), 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-03-03 17:35:18,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 665 transitions. [2025-03-03 17:35:18,213 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 665 transitions. Word has length 93 [2025-03-03 17:35:18,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:18,214 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 665 transitions. [2025-03-03 17:35:18,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 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-03-03 17:35:18,214 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 665 transitions. [2025-03-03 17:35:18,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 17:35:18,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:18,214 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] [2025-03-03 17:35:18,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 17:35:18,215 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:18,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:18,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1771647382, now seen corresponding path program 1 times [2025-03-03 17:35:18,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:18,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579268125] [2025-03-03 17:35:18,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:18,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:18,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 17:35:18,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 17:35:18,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:18,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:18,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:18,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579268125] [2025-03-03 17:35:18,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579268125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:18,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:18,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:35:18,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185433804] [2025-03-03 17:35:18,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:18,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:35:18,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:18,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:35:18,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:35:18,621 INFO L87 Difference]: Start difference. First operand 484 states and 665 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-03-03 17:35:18,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:18,739 INFO L93 Difference]: Finished difference Result 871 states and 1215 transitions. [2025-03-03 17:35:18,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:35:18,740 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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 93 [2025-03-03 17:35:18,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:18,741 INFO L225 Difference]: With dead ends: 871 [2025-03-03 17:35:18,741 INFO L226 Difference]: Without dead ends: 497 [2025-03-03 17:35:18,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:35:18,742 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 3 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:18,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1228 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:18,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-03-03 17:35:18,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 491. [2025-03-03 17:35:18,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.3755102040816327) internal successors, (674), 490 states have internal predecessors, (674), 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-03-03 17:35:18,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 674 transitions. [2025-03-03 17:35:18,748 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 674 transitions. Word has length 93 [2025-03-03 17:35:18,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:18,748 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 674 transitions. [2025-03-03 17:35:18,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-03-03 17:35:18,748 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 674 transitions. [2025-03-03 17:35:18,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 17:35:18,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:18,749 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] [2025-03-03 17:35:18,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 17:35:18,749 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:18,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:18,749 INFO L85 PathProgramCache]: Analyzing trace with hash -850595105, now seen corresponding path program 1 times [2025-03-03 17:35:18,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:18,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834621740] [2025-03-03 17:35:18,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:18,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:18,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 17:35:18,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 17:35:18,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:18,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:19,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:19,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834621740] [2025-03-03 17:35:19,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834621740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:19,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:19,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:19,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684050640] [2025-03-03 17:35:19,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:19,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:19,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:19,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:19,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:19,117 INFO L87 Difference]: Start difference. First operand 491 states and 674 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-03-03 17:35:19,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:19,160 INFO L93 Difference]: Finished difference Result 899 states and 1249 transitions. [2025-03-03 17:35:19,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:19,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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 93 [2025-03-03 17:35:19,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:19,161 INFO L225 Difference]: With dead ends: 899 [2025-03-03 17:35:19,161 INFO L226 Difference]: Without dead ends: 468 [2025-03-03 17:35:19,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:19,162 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:19,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 540 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:35:19,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-03 17:35:19,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-03-03 17:35:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 1.366167023554604) internal successors, (638), 467 states have internal predecessors, (638), 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-03-03 17:35:19,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 638 transitions. [2025-03-03 17:35:19,166 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 638 transitions. Word has length 93 [2025-03-03 17:35:19,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:19,166 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 638 transitions. [2025-03-03 17:35:19,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-03-03 17:35:19,166 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 638 transitions. [2025-03-03 17:35:19,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 17:35:19,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:19,167 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] [2025-03-03 17:35:19,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 17:35:19,167 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:19,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:19,167 INFO L85 PathProgramCache]: Analyzing trace with hash 762360596, now seen corresponding path program 1 times [2025-03-03 17:35:19,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:19,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159309531] [2025-03-03 17:35:19,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:19,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:19,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 17:35:19,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 17:35:19,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:19,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:19,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:19,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:19,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159309531] [2025-03-03 17:35:19,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159309531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:19,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:19,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:35:19,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21350076] [2025-03-03 17:35:19,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:19,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:35:19,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:19,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:35:19,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:35:19,604 INFO L87 Difference]: Start difference. First operand 468 states and 638 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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-03-03 17:35:19,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:19,785 INFO L93 Difference]: Finished difference Result 865 states and 1200 transitions. [2025-03-03 17:35:19,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:35:19,786 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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 94 [2025-03-03 17:35:19,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:19,787 INFO L225 Difference]: With dead ends: 865 [2025-03-03 17:35:19,787 INFO L226 Difference]: Without dead ends: 502 [2025-03-03 17:35:19,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:35:19,788 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 329 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:19,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1103 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:35:19,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-03-03 17:35:19,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 481. [2025-03-03 17:35:19,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.3666666666666667) internal successors, (656), 480 states have internal predecessors, (656), 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-03-03 17:35:19,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 656 transitions. [2025-03-03 17:35:19,793 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 656 transitions. Word has length 94 [2025-03-03 17:35:19,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:19,793 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 656 transitions. [2025-03-03 17:35:19,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 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-03-03 17:35:19,793 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 656 transitions. [2025-03-03 17:35:19,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 17:35:19,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:19,797 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] [2025-03-03 17:35:19,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 17:35:19,797 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:19,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:19,797 INFO L85 PathProgramCache]: Analyzing trace with hash -692899293, now seen corresponding path program 1 times [2025-03-03 17:35:19,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:19,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25684805] [2025-03-03 17:35:19,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:19,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:19,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 17:35:19,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 17:35:19,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:19,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:21,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:21,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25684805] [2025-03-03 17:35:21,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25684805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:21,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:21,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2025-03-03 17:35:21,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979623514] [2025-03-03 17:35:21,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:21,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-03 17:35:21,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:21,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-03 17:35:21,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 17:35:21,274 INFO L87 Difference]: Start difference. First operand 481 states and 656 transitions. Second operand has 38 states, 38 states have (on average 2.473684210526316) internal successors, (94), 38 states have internal predecessors, (94), 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-03-03 17:35:22,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:22,730 INFO L93 Difference]: Finished difference Result 891 states and 1236 transitions. [2025-03-03 17:35:22,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-03 17:35:22,731 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.473684210526316) internal successors, (94), 38 states have internal predecessors, (94), 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 94 [2025-03-03 17:35:22,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:22,732 INFO L225 Difference]: With dead ends: 891 [2025-03-03 17:35:22,732 INFO L226 Difference]: Without dead ends: 515 [2025-03-03 17:35:22,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 17:35:22,733 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 41 mSDsluCounter, 3928 mSDsCounter, 0 mSdLazyCounter, 3722 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 4042 SdHoareTripleChecker+Invalid, 3752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:22,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 4042 Invalid, 3752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3722 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 17:35:22,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-03 17:35:22,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 513. [2025-03-03 17:35:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 1.369140625) internal successors, (701), 512 states have internal predecessors, (701), 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-03-03 17:35:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 701 transitions. [2025-03-03 17:35:22,737 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 701 transitions. Word has length 94 [2025-03-03 17:35:22,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:22,737 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 701 transitions. [2025-03-03 17:35:22,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.473684210526316) internal successors, (94), 38 states have internal predecessors, (94), 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-03-03 17:35:22,738 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 701 transitions. [2025-03-03 17:35:22,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 17:35:22,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:22,738 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] [2025-03-03 17:35:22,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-03 17:35:22,738 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:22,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:22,739 INFO L85 PathProgramCache]: Analyzing trace with hash -590062410, now seen corresponding path program 1 times [2025-03-03 17:35:22,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:22,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80840588] [2025-03-03 17:35:22,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:22,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:22,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 17:35:22,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 17:35:22,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:22,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:23,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:23,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80840588] [2025-03-03 17:35:23,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80840588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:23,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:23,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:23,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660793914] [2025-03-03 17:35:23,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:23,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:23,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:23,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:23,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:23,078 INFO L87 Difference]: Start difference. First operand 513 states and 701 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-03-03 17:35:23,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:23,121 INFO L93 Difference]: Finished difference Result 925 states and 1282 transitions. [2025-03-03 17:35:23,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:23,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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 94 [2025-03-03 17:35:23,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:23,123 INFO L225 Difference]: With dead ends: 925 [2025-03-03 17:35:23,123 INFO L226 Difference]: Without dead ends: 510 [2025-03-03 17:35:23,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:23,124 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:23,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 359 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:35:23,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-03 17:35:23,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2025-03-03 17:35:23,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.3654223968565815) internal successors, (695), 509 states have internal predecessors, (695), 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-03-03 17:35:23,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 695 transitions. [2025-03-03 17:35:23,129 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 695 transitions. Word has length 94 [2025-03-03 17:35:23,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:23,129 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 695 transitions. [2025-03-03 17:35:23,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-03-03 17:35:23,129 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 695 transitions. [2025-03-03 17:35:23,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 17:35:23,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:23,129 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] [2025-03-03 17:35:23,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-03 17:35:23,130 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:23,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:23,130 INFO L85 PathProgramCache]: Analyzing trace with hash -788677909, now seen corresponding path program 1 times [2025-03-03 17:35:23,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:23,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687789006] [2025-03-03 17:35:23,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:23,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:23,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 17:35:23,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 17:35:23,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:23,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:23,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:23,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687789006] [2025-03-03 17:35:23,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687789006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:23,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:23,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:35:23,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914971390] [2025-03-03 17:35:23,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:23,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:35:23,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:23,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:35:23,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:23,449 INFO L87 Difference]: Start difference. First operand 510 states and 695 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-03-03 17:35:23,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:23,532 INFO L93 Difference]: Finished difference Result 988 states and 1361 transitions. [2025-03-03 17:35:23,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:35:23,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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 94 [2025-03-03 17:35:23,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:23,534 INFO L225 Difference]: With dead ends: 988 [2025-03-03 17:35:23,534 INFO L226 Difference]: Without dead ends: 543 [2025-03-03 17:35:23,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:35:23,534 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 382 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:23,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 492 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:23,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-03-03 17:35:23,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 498. [2025-03-03 17:35:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 497 states have (on average 1.364185110663984) internal successors, (678), 497 states have internal predecessors, (678), 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-03-03 17:35:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 678 transitions. [2025-03-03 17:35:23,539 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 678 transitions. Word has length 94 [2025-03-03 17:35:23,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:23,539 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 678 transitions. [2025-03-03 17:35:23,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-03-03 17:35:23,539 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 678 transitions. [2025-03-03 17:35:23,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 17:35:23,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:23,540 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] [2025-03-03 17:35:23,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-03 17:35:23,540 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:23,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:23,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1708512247, now seen corresponding path program 1 times [2025-03-03 17:35:23,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:23,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63121909] [2025-03-03 17:35:23,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:23,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:23,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 17:35:23,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 17:35:23,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:23,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:24,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:24,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63121909] [2025-03-03 17:35:24,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63121909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:24,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:24,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:35:24,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208610242] [2025-03-03 17:35:24,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:24,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:35:24,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:24,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:35:24,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:35:24,067 INFO L87 Difference]: Start difference. First operand 498 states and 678 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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-03-03 17:35:24,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:24,229 INFO L93 Difference]: Finished difference Result 915 states and 1267 transitions. [2025-03-03 17:35:24,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:35:24,230 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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 95 [2025-03-03 17:35:24,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:24,231 INFO L225 Difference]: With dead ends: 915 [2025-03-03 17:35:24,231 INFO L226 Difference]: Without dead ends: 524 [2025-03-03 17:35:24,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:35:24,231 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 255 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:24,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 925 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:24,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-03 17:35:24,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 511. [2025-03-03 17:35:24,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 1.3647058823529412) internal successors, (696), 510 states have internal predecessors, (696), 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-03-03 17:35:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 696 transitions. [2025-03-03 17:35:24,235 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 696 transitions. Word has length 95 [2025-03-03 17:35:24,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:24,236 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 696 transitions. [2025-03-03 17:35:24,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 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-03-03 17:35:24,236 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 696 transitions. [2025-03-03 17:35:24,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 17:35:24,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:24,236 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] [2025-03-03 17:35:24,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-03 17:35:24,236 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:24,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:24,236 INFO L85 PathProgramCache]: Analyzing trace with hash -24104757, now seen corresponding path program 1 times [2025-03-03 17:35:24,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:24,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848305664] [2025-03-03 17:35:24,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:24,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:24,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 17:35:24,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 17:35:24,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:24,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:25,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:25,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:25,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848305664] [2025-03-03 17:35:25,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848305664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:25,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:25,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2025-03-03 17:35:25,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632944647] [2025-03-03 17:35:25,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:25,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-03 17:35:25,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:25,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-03 17:35:25,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 17:35:25,471 INFO L87 Difference]: Start difference. First operand 511 states and 696 transitions. Second operand has 41 states, 41 states have (on average 2.317073170731707) internal successors, (95), 41 states have internal predecessors, (95), 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-03-03 17:35:26,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:26,783 INFO L93 Difference]: Finished difference Result 930 states and 1288 transitions. [2025-03-03 17:35:26,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-03 17:35:26,784 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.317073170731707) internal successors, (95), 41 states have internal predecessors, (95), 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 95 [2025-03-03 17:35:26,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:26,785 INFO L225 Difference]: With dead ends: 930 [2025-03-03 17:35:26,785 INFO L226 Difference]: Without dead ends: 526 [2025-03-03 17:35:26,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 17:35:26,786 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 44 mSDsluCounter, 4102 mSDsCounter, 0 mSdLazyCounter, 4337 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4209 SdHoareTripleChecker+Invalid, 4370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 4337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:26,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4209 Invalid, 4370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 4337 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 17:35:26,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-03 17:35:26,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 524. [2025-03-03 17:35:26,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 523 states have (on average 1.3652007648183557) internal successors, (714), 523 states have internal predecessors, (714), 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-03-03 17:35:26,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 714 transitions. [2025-03-03 17:35:26,791 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 714 transitions. Word has length 95 [2025-03-03 17:35:26,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:26,791 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 714 transitions. [2025-03-03 17:35:26,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.317073170731707) internal successors, (95), 41 states have internal predecessors, (95), 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-03-03 17:35:26,791 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 714 transitions. [2025-03-03 17:35:26,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 17:35:26,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:26,792 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] [2025-03-03 17:35:26,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-03 17:35:26,792 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:26,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:26,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2027193756, now seen corresponding path program 1 times [2025-03-03 17:35:26,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:26,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098430326] [2025-03-03 17:35:26,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:26,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:26,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 17:35:26,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 17:35:26,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:26,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:27,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:27,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:27,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098430326] [2025-03-03 17:35:27,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098430326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:27,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:27,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:35:27,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024253385] [2025-03-03 17:35:27,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:27,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:35:27,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:27,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:35:27,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:35:27,184 INFO L87 Difference]: Start difference. First operand 524 states and 714 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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-03-03 17:35:27,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:27,290 INFO L93 Difference]: Finished difference Result 952 states and 1318 transitions. [2025-03-03 17:35:27,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:35:27,291 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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 95 [2025-03-03 17:35:27,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:27,292 INFO L225 Difference]: With dead ends: 952 [2025-03-03 17:35:27,292 INFO L226 Difference]: Without dead ends: 539 [2025-03-03 17:35:27,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:35:27,293 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 3 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:27,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1214 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:27,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-03 17:35:27,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 535. [2025-03-03 17:35:27,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 1.3632958801498127) internal successors, (728), 534 states have internal predecessors, (728), 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-03-03 17:35:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 728 transitions. [2025-03-03 17:35:27,297 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 728 transitions. Word has length 95 [2025-03-03 17:35:27,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:27,297 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 728 transitions. [2025-03-03 17:35:27,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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-03-03 17:35:27,297 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 728 transitions. [2025-03-03 17:35:27,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 17:35:27,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:27,297 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] [2025-03-03 17:35:27,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-03 17:35:27,297 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:27,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:27,297 INFO L85 PathProgramCache]: Analyzing trace with hash 802498464, now seen corresponding path program 1 times [2025-03-03 17:35:27,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:27,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285845481] [2025-03-03 17:35:27,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:27,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:27,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 17:35:27,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 17:35:27,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:27,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:27,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:27,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:27,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285845481] [2025-03-03 17:35:27,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285845481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:27,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:27,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:27,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618817489] [2025-03-03 17:35:27,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:27,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:27,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:27,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:27,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:27,580 INFO L87 Difference]: Start difference. First operand 535 states and 728 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-03-03 17:35:27,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:27,615 INFO L93 Difference]: Finished difference Result 969 states and 1337 transitions. [2025-03-03 17:35:27,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:27,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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 95 [2025-03-03 17:35:27,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:27,617 INFO L225 Difference]: With dead ends: 969 [2025-03-03 17:35:27,617 INFO L226 Difference]: Without dead ends: 504 [2025-03-03 17:35:27,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:27,618 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:27,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 357 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:35:27,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-03 17:35:27,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 498. [2025-03-03 17:35:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 497 states have (on average 1.3581488933601609) internal successors, (675), 497 states have internal predecessors, (675), 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-03-03 17:35:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 675 transitions. [2025-03-03 17:35:27,622 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 675 transitions. Word has length 95 [2025-03-03 17:35:27,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:27,622 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 675 transitions. [2025-03-03 17:35:27,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-03-03 17:35:27,622 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 675 transitions. [2025-03-03 17:35:27,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 17:35:27,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:27,623 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] [2025-03-03 17:35:27,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-03 17:35:27,623 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:27,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:27,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1530184258, now seen corresponding path program 1 times [2025-03-03 17:35:27,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:27,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076966393] [2025-03-03 17:35:27,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:27,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:27,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 17:35:27,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 17:35:27,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:27,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:28,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:28,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:28,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076966393] [2025-03-03 17:35:28,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076966393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:28,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:28,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:35:28,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037436839] [2025-03-03 17:35:28,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:28,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:35:28,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:28,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:35:28,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:35:28,335 INFO L87 Difference]: Start difference. First operand 498 states and 675 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 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-03-03 17:35:28,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:28,532 INFO L93 Difference]: Finished difference Result 911 states and 1257 transitions. [2025-03-03 17:35:28,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:35:28,533 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 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 96 [2025-03-03 17:35:28,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:28,534 INFO L225 Difference]: With dead ends: 911 [2025-03-03 17:35:28,534 INFO L226 Difference]: Without dead ends: 516 [2025-03-03 17:35:28,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:35:28,535 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 255 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:28,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1076 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:35:28,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-03 17:35:28,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 511. [2025-03-03 17:35:28,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 1.3607843137254902) internal successors, (694), 510 states have internal predecessors, (694), 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-03-03 17:35:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 694 transitions. [2025-03-03 17:35:28,539 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 694 transitions. Word has length 96 [2025-03-03 17:35:28,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:28,539 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 694 transitions. [2025-03-03 17:35:28,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 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-03-03 17:35:28,539 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 694 transitions. [2025-03-03 17:35:28,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 17:35:28,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:28,540 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] [2025-03-03 17:35:28,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-03 17:35:28,540 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:28,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:28,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1489307395, now seen corresponding path program 1 times [2025-03-03 17:35:28,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:28,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586567628] [2025-03-03 17:35:28,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:28,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:28,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 17:35:28,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 17:35:28,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:28,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:30,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:30,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586567628] [2025-03-03 17:35:30,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586567628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:30,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:30,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2025-03-03 17:35:30,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416029447] [2025-03-03 17:35:30,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:30,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-03 17:35:30,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:30,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-03 17:35:30,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2404, Unknown=0, NotChecked=0, Total=2550 [2025-03-03 17:35:30,158 INFO L87 Difference]: Start difference. First operand 511 states and 694 transitions. Second operand has 51 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 51 states have internal predecessors, (96), 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-03-03 17:35:32,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:32,042 INFO L93 Difference]: Finished difference Result 944 states and 1306 transitions. [2025-03-03 17:35:32,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-03 17:35:32,043 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 51 states have internal predecessors, (96), 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 96 [2025-03-03 17:35:32,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:32,044 INFO L225 Difference]: With dead ends: 944 [2025-03-03 17:35:32,044 INFO L226 Difference]: Without dead ends: 549 [2025-03-03 17:35:32,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2025-03-03 17:35:32,045 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 258 mSDsluCounter, 4089 mSDsCounter, 0 mSdLazyCounter, 6141 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 4176 SdHoareTripleChecker+Invalid, 6187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 6141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:32,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 4176 Invalid, 6187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 6141 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 17:35:32,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-03 17:35:32,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 545. [2025-03-03 17:35:32,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 1.3676470588235294) internal successors, (744), 544 states have internal predecessors, (744), 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-03-03 17:35:32,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 744 transitions. [2025-03-03 17:35:32,050 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 744 transitions. Word has length 96 [2025-03-03 17:35:32,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:32,050 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 744 transitions. [2025-03-03 17:35:32,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 51 states have internal predecessors, (96), 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-03-03 17:35:32,051 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 744 transitions. [2025-03-03 17:35:32,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 17:35:32,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:32,051 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] [2025-03-03 17:35:32,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-03 17:35:32,051 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:32,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:32,052 INFO L85 PathProgramCache]: Analyzing trace with hash -997070828, now seen corresponding path program 1 times [2025-03-03 17:35:32,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:32,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080129102] [2025-03-03 17:35:32,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:32,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:32,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 17:35:32,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 17:35:32,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:32,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:33,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:33,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:33,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080129102] [2025-03-03 17:35:33,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080129102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:33,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:33,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2025-03-03 17:35:33,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981504005] [2025-03-03 17:35:33,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:33,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-03 17:35:33,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:33,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-03 17:35:33,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 17:35:33,525 INFO L87 Difference]: Start difference. First operand 545 states and 744 transitions. Second operand has 44 states, 44 states have (on average 2.1818181818181817) internal successors, (96), 44 states have internal predecessors, (96), 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-03-03 17:35:35,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:35,120 INFO L93 Difference]: Finished difference Result 993 states and 1379 transitions. [2025-03-03 17:35:35,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-03 17:35:35,121 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.1818181818181817) internal successors, (96), 44 states have internal predecessors, (96), 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 96 [2025-03-03 17:35:35,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:35,122 INFO L225 Difference]: With dead ends: 993 [2025-03-03 17:35:35,122 INFO L226 Difference]: Without dead ends: 551 [2025-03-03 17:35:35,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 17:35:35,123 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 47 mSDsluCounter, 4124 mSDsCounter, 0 mSdLazyCounter, 4877 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 4224 SdHoareTripleChecker+Invalid, 4913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 4877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:35,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 4224 Invalid, 4913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 4877 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 17:35:35,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-03 17:35:35,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-03-03 17:35:35,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 1.3672727272727272) internal successors, (752), 550 states have internal predecessors, (752), 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-03-03 17:35:35,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 752 transitions. [2025-03-03 17:35:35,129 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 752 transitions. Word has length 96 [2025-03-03 17:35:35,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:35,129 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 752 transitions. [2025-03-03 17:35:35,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.1818181818181817) internal successors, (96), 44 states have internal predecessors, (96), 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-03-03 17:35:35,129 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 752 transitions. [2025-03-03 17:35:35,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 17:35:35,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:35,130 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] [2025-03-03 17:35:35,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-03 17:35:35,130 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:35,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:35,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1060775028, now seen corresponding path program 1 times [2025-03-03 17:35:35,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:35,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528904940] [2025-03-03 17:35:35,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:35,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:35,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 17:35:35,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 17:35:35,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:35,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:35,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:35,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528904940] [2025-03-03 17:35:35,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528904940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:35,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:35,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:35,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855335127] [2025-03-03 17:35:35,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:35,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:35,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:35,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:35,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:35,427 INFO L87 Difference]: Start difference. First operand 551 states and 752 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-03-03 17:35:35,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:35,467 INFO L93 Difference]: Finished difference Result 1002 states and 1390 transitions. [2025-03-03 17:35:35,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:35,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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 96 [2025-03-03 17:35:35,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:35,469 INFO L225 Difference]: With dead ends: 1002 [2025-03-03 17:35:35,469 INFO L226 Difference]: Without dead ends: 547 [2025-03-03 17:35:35,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:35,470 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:35,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:35:35,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-03 17:35:35,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-03-03 17:35:35,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.3626373626373627) internal successors, (744), 546 states have internal predecessors, (744), 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-03-03 17:35:35,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 744 transitions. [2025-03-03 17:35:35,474 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 744 transitions. Word has length 96 [2025-03-03 17:35:35,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:35,475 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 744 transitions. [2025-03-03 17:35:35,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-03-03 17:35:35,475 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 744 transitions. [2025-03-03 17:35:35,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 17:35:35,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:35,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] [2025-03-03 17:35:35,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-03 17:35:35,475 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:35,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:35,476 INFO L85 PathProgramCache]: Analyzing trace with hash 755728114, now seen corresponding path program 1 times [2025-03-03 17:35:35,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:35,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104678108] [2025-03-03 17:35:35,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:35,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:35,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 17:35:35,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 17:35:35,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:35,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:35,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:35,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:35,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104678108] [2025-03-03 17:35:35,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104678108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:35,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:35,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:35:35,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392111307] [2025-03-03 17:35:35,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:35,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:35:35,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:35,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:35:35,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:35:35,869 INFO L87 Difference]: Start difference. First operand 547 states and 744 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 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-03-03 17:35:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:35,961 INFO L93 Difference]: Finished difference Result 997 states and 1380 transitions. [2025-03-03 17:35:35,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:35:35,961 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 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 97 [2025-03-03 17:35:35,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:35,963 INFO L225 Difference]: With dead ends: 997 [2025-03-03 17:35:35,963 INFO L226 Difference]: Without dead ends: 567 [2025-03-03 17:35:35,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:35:35,963 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 3 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:35,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1034 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:35:35,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-03 17:35:35,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 560. [2025-03-03 17:35:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3613595706618962) internal successors, (761), 559 states have internal predecessors, (761), 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-03-03 17:35:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 761 transitions. [2025-03-03 17:35:35,967 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 761 transitions. Word has length 97 [2025-03-03 17:35:35,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:35,967 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 761 transitions. [2025-03-03 17:35:35,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 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-03-03 17:35:35,967 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 761 transitions. [2025-03-03 17:35:35,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 17:35:35,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:35,968 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] [2025-03-03 17:35:35,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-03 17:35:35,968 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:35,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:35,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2087727137, now seen corresponding path program 1 times [2025-03-03 17:35:35,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:35,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101137197] [2025-03-03 17:35:35,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:35,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:35,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 17:35:36,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 17:35:36,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:36,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:35:36,150 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 17:35:36,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 17:35:36,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 17:35:36,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:36,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:35:36,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 17:35:36,344 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 17:35:36,344 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 17:35:36,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-03 17:35:36,348 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-03 17:35:36,385 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:35:36,402 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 17:35:36,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:35:36 BoogieIcfgContainer [2025-03-03 17:35:36,404 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 17:35:36,404 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 17:35:36,404 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 17:35:36,404 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 17:35:36,405 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:34:41" (3/4) ... [2025-03-03 17:35:36,406 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 17:35:36,407 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 17:35:36,407 INFO L158 Benchmark]: Toolchain (without parser) took 56740.27ms. Allocated memory was 142.6MB in the beginning and 880.8MB in the end (delta: 738.2MB). Free memory was 104.9MB in the beginning and 594.7MB in the end (delta: -489.7MB). Peak memory consumption was 252.2MB. Max. memory is 16.1GB. [2025-03-03 17:35:36,407 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 192.9MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:35:36,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.04ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 86.8MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 17:35:36,408 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.83ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 73.3MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 17:35:36,408 INFO L158 Benchmark]: Boogie Preprocessor took 104.62ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 65.8MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:35:36,408 INFO L158 Benchmark]: IcfgBuilder took 852.39ms. Allocated memory is still 142.6MB. Free memory was 65.8MB in the beginning and 50.8MB in the end (delta: 15.0MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. [2025-03-03 17:35:36,408 INFO L158 Benchmark]: TraceAbstraction took 55363.70ms. Allocated memory was 142.6MB in the beginning and 880.8MB in the end (delta: 738.2MB). Free memory was 50.2MB in the beginning and 594.8MB in the end (delta: -544.6MB). Peak memory consumption was 191.3MB. Max. memory is 16.1GB. [2025-03-03 17:35:36,408 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 880.8MB. Free memory was 594.8MB in the beginning and 594.7MB in the end (delta: 121.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:35:36,409 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.63ms. Allocated memory is still 192.9MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.04ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 86.8MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.83ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 73.3MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.62ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 65.8MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 852.39ms. Allocated memory is still 142.6MB. Free memory was 65.8MB in the beginning and 50.8MB in the end (delta: 15.0MB). Peak memory consumption was 44.1MB. Max. memory is 16.1GB. * TraceAbstraction took 55363.70ms. Allocated memory was 142.6MB in the beginning and 880.8MB in the end (delta: 738.2MB). Free memory was 50.2MB in the beginning and 594.8MB in the end (delta: -544.6MB). Peak memory consumption was 191.3MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 880.8MB. Free memory was 594.8MB in the beginning and 594.7MB in the end (delta: 121.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 248. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 2); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (2 - 1); [L32] const SORT_3 var_4 = 0; [L33] const SORT_1 var_78 = 1; [L35] SORT_1 input_2; [L37] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=3, var_4=0, var_78=1] [L37] SORT_3 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L38] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=3, var_4=0, var_78=1] [L38] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L39] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=3, var_4=0, var_78=1] [L39] SORT_3 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, var_4=0, var_78=1] [L40] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L42] SORT_3 init_6_arg_1 = var_4; [L43] state_5 = init_6_arg_1 [L44] SORT_3 init_9_arg_1 = var_4; [L45] state_8 = init_9_arg_1 [L46] SORT_3 init_26_arg_1 = var_4; [L47] state_25 = init_26_arg_1 [L48] SORT_3 init_44_arg_1 = var_4; [L49] state_43 = init_44_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L52] input_2 = __VERIFIER_nondet_uchar() [L55] SORT_3 var_7_arg_0 = state_5; [L56] SORT_3 var_7_arg_1 = var_4; [L57] SORT_1 var_7 = var_7_arg_0 != var_7_arg_1; [L58] SORT_3 var_10_arg_0 = state_8; [L59] SORT_3 var_10_arg_1 = var_4; [L60] SORT_1 var_10 = var_10_arg_0 == var_10_arg_1; [L61] SORT_1 var_11_arg_0 = var_7; [L62] SORT_1 var_11_arg_1 = var_10; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_11_arg_0=0, var_11_arg_1=1, var_4=0, var_78=1] [L63] EXPR var_11_arg_0 | var_11_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L63] SORT_1 var_11 = var_11_arg_0 | var_11_arg_1; [L64] SORT_3 var_12_arg_0 = state_5; [L65] SORT_3 var_12_arg_1 = var_4; [L66] SORT_1 var_12 = var_12_arg_0 != var_12_arg_1; [L67] SORT_3 var_13_arg_0 = state_8; [L68] SORT_3 var_13_arg_1 = var_4; [L69] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L70] SORT_1 var_14_arg_0 = var_12; [L71] SORT_1 var_14_arg_1 = var_13; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_11=1, var_14_arg_0=0, var_14_arg_1=1, var_4=0, var_78=1] [L72] EXPR var_14_arg_0 | var_14_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_11=1, var_4=0, var_78=1] [L72] SORT_1 var_14 = var_14_arg_0 | var_14_arg_1; [L73] SORT_1 var_15_arg_0 = var_11; [L74] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_15_arg_0=1, var_15_arg_1=1, var_4=0, var_78=1] [L75] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L75] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L76] SORT_3 var_16_arg_0 = state_5; [L77] SORT_3 var_16_arg_1 = var_4; [L78] SORT_1 var_16 = var_16_arg_0 != var_16_arg_1; [L79] SORT_3 var_17_arg_0 = state_8; [L80] SORT_3 var_17_arg_1 = var_4; [L81] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L82] SORT_1 var_18_arg_0 = var_16; [L83] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_15=1, var_18_arg_0=0, var_18_arg_1=1, var_4=0, var_78=1] [L84] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_15=1, var_4=0, var_78=1] [L84] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L85] SORT_1 var_19_arg_0 = var_15; [L86] SORT_1 var_19_arg_1 = var_18; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_19_arg_0=1, var_19_arg_1=1, var_4=0, var_78=1] [L87] EXPR var_19_arg_0 & var_19_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L87] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L88] SORT_3 var_20_arg_0 = state_5; [L89] SORT_3 var_20_arg_1 = var_4; [L90] SORT_1 var_20 = var_20_arg_0 != var_20_arg_1; [L91] SORT_3 var_21_arg_0 = state_8; [L92] SORT_3 var_21_arg_1 = var_4; [L93] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L94] SORT_1 var_22_arg_0 = var_20; [L95] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_19=1, var_22_arg_0=0, var_22_arg_1=1, var_4=0, var_78=1] [L96] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_19=1, var_4=0, var_78=1] [L96] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L97] SORT_1 var_23_arg_0 = var_19; [L98] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_23_arg_0=1, var_23_arg_1=1, var_4=0, var_78=1] [L99] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L99] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L100] SORT_3 var_24_arg_0 = state_8; [L101] SORT_3 var_24_arg_1 = var_4; [L102] SORT_1 var_24 = var_24_arg_0 != var_24_arg_1; [L103] SORT_3 var_27_arg_0 = state_25; [L104] SORT_3 var_27_arg_1 = var_4; [L105] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L106] SORT_1 var_28_arg_0 = var_24; [L107] SORT_1 var_28_arg_1 = var_27; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_23=1, var_28_arg_0=0, var_28_arg_1=1, var_4=0, var_78=1] [L108] EXPR var_28_arg_0 | var_28_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_23=1, var_4=0, var_78=1] [L108] SORT_1 var_28 = var_28_arg_0 | var_28_arg_1; [L109] SORT_1 var_29_arg_0 = var_23; [L110] SORT_1 var_29_arg_1 = var_28; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_29_arg_0=1, var_29_arg_1=1, var_4=0, var_78=1] [L111] EXPR var_29_arg_0 & var_29_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L111] SORT_1 var_29 = var_29_arg_0 & var_29_arg_1; [L112] SORT_3 var_30_arg_0 = state_8; [L113] SORT_3 var_30_arg_1 = var_4; [L114] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L115] SORT_3 var_31_arg_0 = state_25; [L116] SORT_3 var_31_arg_1 = var_4; [L117] SORT_1 var_31 = var_31_arg_0 == var_31_arg_1; [L118] SORT_1 var_32_arg_0 = var_30; [L119] SORT_1 var_32_arg_1 = var_31; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_29=1, var_32_arg_0=0, var_32_arg_1=1, var_4=0, var_78=1] [L120] EXPR var_32_arg_0 | var_32_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_29=1, var_4=0, var_78=1] [L120] SORT_1 var_32 = var_32_arg_0 | var_32_arg_1; [L121] SORT_1 var_33_arg_0 = var_29; [L122] SORT_1 var_33_arg_1 = var_32; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_33_arg_0=1, var_33_arg_1=1, var_4=0, var_78=1] [L123] EXPR var_33_arg_0 & var_33_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L123] SORT_1 var_33 = var_33_arg_0 & var_33_arg_1; [L124] SORT_3 var_34_arg_0 = state_8; [L125] SORT_3 var_34_arg_1 = var_4; [L126] SORT_1 var_34 = var_34_arg_0 != var_34_arg_1; [L127] SORT_3 var_35_arg_0 = state_25; [L128] SORT_3 var_35_arg_1 = var_4; [L129] SORT_1 var_35 = var_35_arg_0 == var_35_arg_1; [L130] SORT_1 var_36_arg_0 = var_34; [L131] SORT_1 var_36_arg_1 = var_35; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_33=1, var_36_arg_0=0, var_36_arg_1=1, var_4=0, var_78=1] [L132] EXPR var_36_arg_0 | var_36_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_33=1, var_4=0, var_78=1] [L132] SORT_1 var_36 = var_36_arg_0 | var_36_arg_1; [L133] SORT_1 var_37_arg_0 = var_33; [L134] SORT_1 var_37_arg_1 = var_36; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_37_arg_0=1, var_37_arg_1=1, var_4=0, var_78=1] [L135] EXPR var_37_arg_0 & var_37_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L135] SORT_1 var_37 = var_37_arg_0 & var_37_arg_1; [L136] SORT_3 var_38_arg_0 = state_8; [L137] SORT_3 var_38_arg_1 = var_4; [L138] SORT_1 var_38 = var_38_arg_0 != var_38_arg_1; [L139] SORT_3 var_39_arg_0 = state_25; [L140] SORT_3 var_39_arg_1 = var_4; [L141] SORT_1 var_39 = var_39_arg_0 == var_39_arg_1; [L142] SORT_1 var_40_arg_0 = var_38; [L143] SORT_1 var_40_arg_1 = var_39; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_37=1, var_40_arg_0=0, var_40_arg_1=1, var_4=0, var_78=1] [L144] EXPR var_40_arg_0 | var_40_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_37=1, var_4=0, var_78=1] [L144] SORT_1 var_40 = var_40_arg_0 | var_40_arg_1; [L145] SORT_1 var_41_arg_0 = var_37; [L146] SORT_1 var_41_arg_1 = var_40; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_41_arg_0=1, var_41_arg_1=1, var_4=0, var_78=1] [L147] EXPR var_41_arg_0 & var_41_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L147] SORT_1 var_41 = var_41_arg_0 & var_41_arg_1; [L148] SORT_3 var_42_arg_0 = state_25; [L149] SORT_3 var_42_arg_1 = var_4; [L150] SORT_1 var_42 = var_42_arg_0 != var_42_arg_1; [L151] SORT_3 var_45_arg_0 = state_43; [L152] SORT_3 var_45_arg_1 = var_4; [L153] SORT_1 var_45 = var_45_arg_0 == var_45_arg_1; [L154] SORT_1 var_46_arg_0 = var_42; [L155] SORT_1 var_46_arg_1 = var_45; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_41=1, var_46_arg_0=0, var_46_arg_1=1, var_4=0, var_78=1] [L156] EXPR var_46_arg_0 | var_46_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_41=1, var_4=0, var_78=1] [L156] SORT_1 var_46 = var_46_arg_0 | var_46_arg_1; [L157] SORT_1 var_47_arg_0 = var_41; [L158] SORT_1 var_47_arg_1 = var_46; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_47_arg_0=1, var_47_arg_1=1, var_4=0, var_78=1] [L159] EXPR var_47_arg_0 & var_47_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L159] SORT_1 var_47 = var_47_arg_0 & var_47_arg_1; [L160] SORT_3 var_48_arg_0 = state_25; [L161] SORT_3 var_48_arg_1 = var_4; [L162] SORT_1 var_48 = var_48_arg_0 != var_48_arg_1; [L163] SORT_3 var_49_arg_0 = state_43; [L164] SORT_3 var_49_arg_1 = var_4; [L165] SORT_1 var_49 = var_49_arg_0 == var_49_arg_1; [L166] SORT_1 var_50_arg_0 = var_48; [L167] SORT_1 var_50_arg_1 = var_49; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_47=1, var_4=0, var_50_arg_0=0, var_50_arg_1=1, var_78=1] [L168] EXPR var_50_arg_0 | var_50_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_47=1, var_4=0, var_78=1] [L168] SORT_1 var_50 = var_50_arg_0 | var_50_arg_1; [L169] SORT_1 var_51_arg_0 = var_47; [L170] SORT_1 var_51_arg_1 = var_50; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_51_arg_0=1, var_51_arg_1=1, var_78=1] [L171] EXPR var_51_arg_0 & var_51_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L171] SORT_1 var_51 = var_51_arg_0 & var_51_arg_1; [L172] SORT_3 var_52_arg_0 = state_25; [L173] SORT_3 var_52_arg_1 = var_4; [L174] SORT_1 var_52 = var_52_arg_0 != var_52_arg_1; [L175] SORT_3 var_53_arg_0 = state_43; [L176] SORT_3 var_53_arg_1 = var_4; [L177] SORT_1 var_53 = var_53_arg_0 == var_53_arg_1; [L178] SORT_1 var_54_arg_0 = var_52; [L179] SORT_1 var_54_arg_1 = var_53; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_51=1, var_54_arg_0=0, var_54_arg_1=1, var_78=1] [L180] EXPR var_54_arg_0 | var_54_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_51=1, var_78=1] [L180] SORT_1 var_54 = var_54_arg_0 | var_54_arg_1; [L181] SORT_1 var_55_arg_0 = var_51; [L182] SORT_1 var_55_arg_1 = var_54; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_55_arg_0=1, var_55_arg_1=1, var_78=1] [L183] EXPR var_55_arg_0 & var_55_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L183] SORT_1 var_55 = var_55_arg_0 & var_55_arg_1; [L184] SORT_3 var_56_arg_0 = state_25; [L185] SORT_3 var_56_arg_1 = var_4; [L186] SORT_1 var_56 = var_56_arg_0 != var_56_arg_1; [L187] SORT_3 var_57_arg_0 = state_43; [L188] SORT_3 var_57_arg_1 = var_4; [L189] SORT_1 var_57 = var_57_arg_0 == var_57_arg_1; [L190] SORT_1 var_58_arg_0 = var_56; [L191] SORT_1 var_58_arg_1 = var_57; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_55=1, var_58_arg_0=0, var_58_arg_1=1, var_78=1] [L192] EXPR var_58_arg_0 | var_58_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_55=1, var_78=1] [L192] SORT_1 var_58 = var_58_arg_0 | var_58_arg_1; [L193] SORT_1 var_59_arg_0 = var_55; [L194] SORT_1 var_59_arg_1 = var_58; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_59_arg_0=1, var_59_arg_1=1, var_78=1] [L195] EXPR var_59_arg_0 & var_59_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L195] SORT_1 var_59 = var_59_arg_0 & var_59_arg_1; [L196] SORT_3 var_60_arg_0 = state_43; [L197] SORT_3 var_60_arg_1 = var_4; [L198] SORT_1 var_60 = var_60_arg_0 != var_60_arg_1; [L199] SORT_3 var_61_arg_0 = state_5; [L200] SORT_3 var_61_arg_1 = var_4; [L201] SORT_1 var_61 = var_61_arg_0 == var_61_arg_1; [L202] SORT_1 var_62_arg_0 = var_60; [L203] SORT_1 var_62_arg_1 = var_61; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_59=1, var_62_arg_0=0, var_62_arg_1=1, var_78=1] [L204] EXPR var_62_arg_0 | var_62_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_59=1, var_78=1] [L204] SORT_1 var_62 = var_62_arg_0 | var_62_arg_1; [L205] SORT_1 var_63_arg_0 = var_59; [L206] SORT_1 var_63_arg_1 = var_62; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_63_arg_0=1, var_63_arg_1=1, var_78=1] [L207] EXPR var_63_arg_0 & var_63_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L207] SORT_1 var_63 = var_63_arg_0 & var_63_arg_1; [L208] SORT_3 var_64_arg_0 = state_43; [L209] SORT_3 var_64_arg_1 = var_4; [L210] SORT_1 var_64 = var_64_arg_0 != var_64_arg_1; [L211] SORT_3 var_65_arg_0 = state_5; [L212] SORT_3 var_65_arg_1 = var_4; [L213] SORT_1 var_65 = var_65_arg_0 == var_65_arg_1; [L214] SORT_1 var_66_arg_0 = var_64; [L215] SORT_1 var_66_arg_1 = var_65; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_63=1, var_66_arg_0=0, var_66_arg_1=1, var_78=1] [L216] EXPR var_66_arg_0 | var_66_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_63=1, var_78=1] [L216] SORT_1 var_66 = var_66_arg_0 | var_66_arg_1; [L217] SORT_1 var_67_arg_0 = var_63; [L218] SORT_1 var_67_arg_1 = var_66; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_67_arg_0=1, var_67_arg_1=1, var_78=1] [L219] EXPR var_67_arg_0 & var_67_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L219] SORT_1 var_67 = var_67_arg_0 & var_67_arg_1; [L220] SORT_3 var_68_arg_0 = state_43; [L221] SORT_3 var_68_arg_1 = var_4; [L222] SORT_1 var_68 = var_68_arg_0 != var_68_arg_1; [L223] SORT_3 var_69_arg_0 = state_5; [L224] SORT_3 var_69_arg_1 = var_4; [L225] SORT_1 var_69 = var_69_arg_0 == var_69_arg_1; [L226] SORT_1 var_70_arg_0 = var_68; [L227] SORT_1 var_70_arg_1 = var_69; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_67=1, var_70_arg_0=0, var_70_arg_1=1, var_78=1] [L228] EXPR var_70_arg_0 | var_70_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_67=1, var_78=1] [L228] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1; [L229] SORT_1 var_71_arg_0 = var_67; [L230] SORT_1 var_71_arg_1 = var_70; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_71_arg_0=1, var_71_arg_1=1, var_78=1] [L231] EXPR var_71_arg_0 & var_71_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L231] SORT_1 var_71 = var_71_arg_0 & var_71_arg_1; [L232] SORT_3 var_72_arg_0 = state_43; [L233] SORT_3 var_72_arg_1 = var_4; [L234] SORT_1 var_72 = var_72_arg_0 != var_72_arg_1; [L235] SORT_3 var_73_arg_0 = state_5; [L236] SORT_3 var_73_arg_1 = var_4; [L237] SORT_1 var_73 = var_73_arg_0 == var_73_arg_1; [L238] SORT_1 var_74_arg_0 = var_72; [L239] SORT_1 var_74_arg_1 = var_73; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_71=1, var_74_arg_0=0, var_74_arg_1=1, var_78=1] [L240] EXPR var_74_arg_0 | var_74_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_71=1, var_78=1] [L240] SORT_1 var_74 = var_74_arg_0 | var_74_arg_1; [L241] SORT_1 var_75_arg_0 = var_71; [L242] SORT_1 var_75_arg_1 = var_74; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_75_arg_0=1, var_75_arg_1=1, var_78=1] [L243] EXPR var_75_arg_0 & var_75_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_78=1] [L243] SORT_1 var_75 = var_75_arg_0 & var_75_arg_1; [L244] SORT_1 var_79_arg_0 = var_75; [L245] SORT_1 var_79 = ~var_79_arg_0; [L246] SORT_1 var_80_arg_0 = var_78; [L247] SORT_1 var_80_arg_1 = var_79; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_78=1, var_80_arg_0=1, var_80_arg_1=-2] [L248] EXPR var_80_arg_0 & var_80_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_78=1] [L248] SORT_1 var_80 = var_80_arg_0 & var_80_arg_1; [L249] EXPR var_80 & mask_SORT_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_78=1] [L249] var_80 = var_80 & mask_SORT_1 [L250] SORT_1 bad_81_arg_0 = var_80; [L251] CALL __VERIFIER_assert(!(bad_81_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 158 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.3s, OverallIterations: 54, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8802 SdHoareTripleChecker+Valid, 17.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8802 mSDsluCounter, 79867 SdHoareTripleChecker+Invalid, 14.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71185 mSDsCounter, 255 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46705 IncrementalHoareTripleChecker+Invalid, 46960 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 255 mSolverCounterUnsat, 8682 mSDtfsCounter, 46705 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 843 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 708 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3159 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=560occurred in iteration=53, InterpolantAutomatonStates: 715, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 53 MinimizatonAttempts, 1626 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 5.4s SatisfiabilityAnalysisTime, 27.9s InterpolantComputationTime, 4839 NumberOfCodeBlocks, 4839 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 4689 ConstructedInterpolants, 0 QuantifiedInterpolants, 17229 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 53 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 17:35:36,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ae5f6e98a9adcbdf5e1e7125ae4ea5d0cf3bfadfc22b5bc300cef6d9a8d4cfbb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:35:38,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:35:38,427 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 17:35:38,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:35:38,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:35:38,455 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:35:38,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:35:38,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:35:38,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:35:38,457 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:35:38,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:35:38,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:35:38,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:35:38,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:35:38,458 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:35:38,458 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:35:38,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:35:38,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:35:38,458 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:35:38,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:35:38,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:35:38,458 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 17:35:38,458 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 17:35:38,458 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 17:35:38,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:35:38,459 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:35:38,459 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:35:38,459 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:35:38,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:35:38,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:35:38,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:35:38,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:35:38,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:35:38,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:35:38,459 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:35:38,459 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:35:38,459 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 17:35:38,459 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 17:35:38,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:35:38,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:35:38,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:35:38,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:35:38,459 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae5f6e98a9adcbdf5e1e7125ae4ea5d0cf3bfadfc22b5bc300cef6d9a8d4cfbb [2025-03-03 17:35:38,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:35:38,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:35:38,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:35:38,697 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:35:38,698 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:35:38,698 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c [2025-03-03 17:35:39,907 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c47999c65/1e9da06ad6f64a2baf208629b7d7cc1a/FLAGc773861cd [2025-03-03 17:35:40,080 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:35:40,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c [2025-03-03 17:35:40,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c47999c65/1e9da06ad6f64a2baf208629b7d7cc1a/FLAGc773861cd [2025-03-03 17:35:40,102 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c47999c65/1e9da06ad6f64a2baf208629b7d7cc1a [2025-03-03 17:35:40,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:35:40,104 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:35:40,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:35:40,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:35:40,108 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:35:40,109 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:35:40" (1/1) ... [2025-03-03 17:35:40,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a8ddb24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:40, skipping insertion in model container [2025-03-03 17:35:40,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:35:40" (1/1) ... [2025-03-03 17:35:40,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:35:40,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c[1248,1261] [2025-03-03 17:35:40,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:35:40,341 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:35:40,350 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c[1248,1261] [2025-03-03 17:35:40,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:35:40,409 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:35:40,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:40 WrapperNode [2025-03-03 17:35:40,410 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:35:40,411 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:35:40,411 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:35:40,411 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:35:40,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:40" (1/1) ... [2025-03-03 17:35:40,429 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:40" (1/1) ... [2025-03-03 17:35:40,454 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 253 [2025-03-03 17:35:40,454 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:35:40,455 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:35:40,455 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:35:40,455 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:35:40,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:40" (1/1) ... [2025-03-03 17:35:40,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:40" (1/1) ... [2025-03-03 17:35:40,468 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:40" (1/1) ... [2025-03-03 17:35:40,480 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 17:35:40,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:40" (1/1) ... [2025-03-03 17:35:40,480 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:40" (1/1) ... [2025-03-03 17:35:40,487 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:40" (1/1) ... [2025-03-03 17:35:40,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:40" (1/1) ... [2025-03-03 17:35:40,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:40" (1/1) ... [2025-03-03 17:35:40,490 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:40" (1/1) ... [2025-03-03 17:35:40,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:35:40,493 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:35:40,493 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:35:40,493 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:35:40,493 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:40" (1/1) ... [2025-03-03 17:35:40,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:35:40,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:35:40,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 17:35:40,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 17:35:40,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:35:40,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 17:35:40,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:35:40,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:35:40,626 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:35:40,627 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:35:40,931 INFO L? ?]: Removed 208 outVars from TransFormulas that were not future-live. [2025-03-03 17:35:40,933 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:35:40,939 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:35:40,939 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:35:40,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:35:40 BoogieIcfgContainer [2025-03-03 17:35:40,940 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:35:40,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:35:40,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:35:40,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:35:40,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:35:40" (1/3) ... [2025-03-03 17:35:40,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d2988d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:35:40, skipping insertion in model container [2025-03-03 17:35:40,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:40" (2/3) ... [2025-03-03 17:35:40,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d2988d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:35:40, skipping insertion in model container [2025-03-03 17:35:40,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:35:40" (3/3) ... [2025-03-03 17:35:40,960 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Barrel.c [2025-03-03 17:35:40,969 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:35:40,971 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_Barrel.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:35:41,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:35:41,014 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;@3c783eda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:35:41,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:35:41,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-03-03 17:35:41,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 17:35:41,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:41,021 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 17:35:41,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:41,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:41,026 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 17:35:41,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:35:41,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [914128666] [2025-03-03 17:35:41,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:41,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:35:41,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:35:41,037 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:35:41,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 17:35:41,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 17:35:41,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 17:35:41,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:41,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:41,229 WARN L254 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 142 conjuncts are in the unsatisfiable core [2025-03-03 17:35:41,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:35:42,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:42,037 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:35:42,037 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:35:42,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914128666] [2025-03-03 17:35:42,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914128666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:42,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:42,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:42,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860444766] [2025-03-03 17:35:42,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:42,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:42,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:35:42,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:42,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:42,056 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-03-03 17:35:42,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:42,090 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-03-03 17:35:42,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:42,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2025-03-03 17:35:42,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:42,101 INFO L225 Difference]: With dead ends: 17 [2025-03-03 17:35:42,101 INFO L226 Difference]: Without dead ends: 9 [2025-03-03 17:35:42,104 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-03-03 17:35:42,105 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:42,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:35:42,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-03 17:35:42,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-03 17:35:42,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-03-03 17:35:42,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 17:35:42,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 17:35:42,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:42,128 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 17:35:42,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-03-03 17:35:42,128 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 17:35:42,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 17:35:42,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:42,128 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 17:35:42,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 17:35:42,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:35:42,333 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:42,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:42,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 17:35:42,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:35:42,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [686541879] [2025-03-03 17:35:42,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:42,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:35:42,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:35:42,349 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:35:42,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 17:35:42,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 17:35:42,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 17:35:42,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:42,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:42,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 147 conjuncts are in the unsatisfiable core [2025-03-03 17:35:42,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:35:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:43,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:35:51,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-03-03 17:35:51,131 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-03-03 17:35:51,132 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:35:51,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686541879] [2025-03-03 17:35:51,132 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-03-03 17:35:51,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 17:35:51,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:35:51,337 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:842) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2025-03-03 17:35:51,341 INFO L158 Benchmark]: Toolchain (without parser) took 11236.79ms. Allocated memory was 117.4MB in the beginning and 511.7MB in the end (delta: 394.3MB). Free memory was 92.1MB in the beginning and 197.4MB in the end (delta: -105.4MB). Peak memory consumption was 285.7MB. Max. memory is 16.1GB. [2025-03-03 17:35:51,341 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 83.9MB. Free memory was 63.0MB in the beginning and 63.0MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:35:51,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.77ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 75.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 17:35:51,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.59ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 72.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:35:51,343 INFO L158 Benchmark]: Boogie Preprocessor took 37.31ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 69.5MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:35:51,343 INFO L158 Benchmark]: IcfgBuilder took 447.28ms. Allocated memory is still 117.4MB. Free memory was 69.5MB in the beginning and 37.5MB in the end (delta: 32.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 17:35:51,343 INFO L158 Benchmark]: TraceAbstraction took 10399.27ms. Allocated memory was 117.4MB in the beginning and 511.7MB in the end (delta: 394.3MB). Free memory was 37.1MB in the beginning and 197.4MB in the end (delta: -160.4MB). Peak memory consumption was 235.4MB. Max. memory is 16.1GB. [2025-03-03 17:35:51,344 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 83.9MB. Free memory was 63.0MB in the beginning and 63.0MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.77ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 75.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.59ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 72.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.31ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 69.5MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 447.28ms. Allocated memory is still 117.4MB. Free memory was 69.5MB in the beginning and 37.5MB in the end (delta: 32.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10399.27ms. Allocated memory was 117.4MB in the beginning and 511.7MB in the end (delta: 394.3MB). Free memory was 37.1MB in the beginning and 197.4MB in the end (delta: -160.4MB). Peak memory consumption was 235.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")